0.01/0.02 c SCIP version 1.1.0.7
0.01/0.02 c LP-Solver Clp 1.8.2
0.01/0.02 c user parameter file <scip.set> not found - using default parameters
0.01/0.02 c read problem <HOME/instance-1868581-1245128606.opb>
0.01/0.02 c original problem has 495 variables (495 bin, 0 int, 0 impl, 0 cont) and 940 constraints
0.01/0.03 c No objective function, only one solution is needed.
0.01/0.03 c start presolving problem
0.01/0.03 c presolving:
0.01/0.04 c (round 1) 65 del vars, 17 del conss, 5 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.01/0.04 c (round 2) 66 del vars, 135 del conss, 6 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.01/0.04 c (round 3) 68 del vars, 138 del conss, 8 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.01/0.05 c (round 4) 70 del vars, 143 del conss, 10 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6218 impls, 0 clqs
0.01/0.05 c (round 5) 74 del vars, 149 del conss, 14 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6218 impls, 0 clqs
0.01/0.05 c (round 6) 88 del vars, 176 del conss, 23 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6316 impls, 0 clqs
0.01/0.05 c (round 7) 95 del vars, 198 del conss, 29 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6370 impls, 0 clqs
0.01/0.05 c (round 8) 104 del vars, 214 del conss, 33 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6480 impls, 0 clqs
0.01/0.05 c (round 9) 112 del vars, 236 del conss, 37 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6520 impls, 0 clqs
0.01/0.06 c (round 10) 119 del vars, 255 del conss, 41 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6584 impls, 0 clqs
0.01/0.06 c (round 11) 127 del vars, 272 del conss, 45 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6664 impls, 0 clqs
0.01/0.06 c (round 12) 140 del vars, 301 del conss, 52 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6797 impls, 0 clqs
0.01/0.06 c (round 13) 147 del vars, 325 del conss, 58 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6811 impls, 0 clqs
0.01/0.06 c (round 14) 155 del vars, 344 del conss, 65 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6823 impls, 0 clqs
0.01/0.06 c (round 15) 164 del vars, 362 del conss, 71 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6871 impls, 0 clqs
0.01/0.07 c (round 16) 166 del vars, 377 del conss, 73 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6873 impls, 0 clqs
0.01/0.07 c (round 17) 170 del vars, 383 del conss, 77 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6873 impls, 0 clqs
0.01/0.07 c (round 18) 177 del vars, 396 del conss, 83 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6965 impls, 0 clqs
0.01/0.07 c (round 19) 184 del vars, 417 del conss, 89 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 7067 impls, 0 clqs
0.01/0.07 c (round 20) 195 del vars, 444 del conss, 94 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 7191 impls, 0 clqs
0.01/0.07 c (round 21) 199 del vars, 464 del conss, 96 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 7203 impls, 0 clqs
0.01/0.07 c (round 22) 205 del vars, 477 del conss, 98 chg bounds, 71 chg sides, 145 chg coeffs, 0 upgd conss, 7243 impls, 0 clqs
0.01/0.08 c (round 23) 212 del vars, 496 del conss, 100 chg bounds, 73 chg sides, 148 chg coeffs, 0 upgd conss, 7262 impls, 0 clqs
0.01/0.08 c (round 24) 225 del vars, 528 del conss, 105 chg bounds, 75 chg sides, 152 chg coeffs, 0 upgd conss, 7326 impls, 0 clqs
0.01/0.08 c (round 25) 225 del vars, 549 del conss, 105 chg bounds, 75 chg sides, 152 chg coeffs, 0 upgd conss, 7326 impls, 0 clqs
0.01/0.09 c (round 26) 225 del vars, 556 del conss, 105 chg bounds, 75 chg sides, 152 chg coeffs, 377 upgd conss, 7326 impls, 0 clqs
0.01/0.09 c (round 27) 267 del vars, 563 del conss, 105 chg bounds, 75 chg sides, 152 chg coeffs, 377 upgd conss, 7326 impls, 0 clqs
0.01/0.09 c presolving (28 rounds):
0.01/0.09 c 267 deleted vars, 563 deleted constraints, 105 tightened bounds, 0 added holes, 75 changed sides, 152 changed coefficients
0.01/0.09 c 7326 implications, 0 cliques
0.01/0.09 c presolved problem has 228 variables (228 bin, 0 int, 0 impl, 0 cont) and 377 constraints
0.01/0.09 c 112 constraints of type <knapsack>
0.01/0.09 c 265 constraints of type <logicor>
0.01/0.09 c transformed objective value is always integral (scale: 1)
0.01/0.09 c Presolving Time: 0.05
0.01/0.09 c SATUNSAT-LIN
0.01/0.09 c -----------------------------------------------------------------------------------------------
0.01/0.09 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.09 c separating/flowcover/freq = c -1
0.01/0.09 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.09 c separating/cmir/freq = c -1
0.01/0.09 c # additional number of allowed LP iterations
0.01/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09 c heuristics/veclendiving/maxlpiterofs = c 1500
0.01/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.09 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.01/0.09 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.09 c heuristics/veclendiving/freq = c -1
0.01/0.09 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.09 c heuristics/simplerounding/freq = c -1
0.01/0.09 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.09 c heuristics/shifting/freq = c -1
0.01/0.09 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.09 c heuristics/rounding/freq = c -1
0.01/0.09 c # additional number of allowed LP iterations
0.01/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.01/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.09 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.01/0.09 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.09 c heuristics/rootsoldiving/freq = c -1
0.01/0.09 c # number of nodes added to the contingent of the total nodes
0.01/0.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.09 c heuristics/rens/nodesofs = c 2000
0.01/0.09 c # minimum percentage of integer variables that have to be fixable
0.01/0.09 c # [type: real, range: [0,1], default: 0.5]
0.01/0.09 c heuristics/rens/minfixingrate = c 0.3
0.01/0.09 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.09 c heuristics/rens/freq = c -1
0.01/0.09 c # additional number of allowed LP iterations
0.01/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.01/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.09 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.01/0.09 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.09 c heuristics/pscostdiving/freq = c -1
0.01/0.09 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.10 c heuristics/oneopt/freq = c -1
0.01/0.10 c # additional number of allowed LP iterations
0.01/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.10 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.01/0.10 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.10 c # [type: real, range: [0,1], default: 0.01]
0.01/0.10 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.01/0.10 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.10 c heuristics/objpscostdiving/freq = c -1
0.01/0.10 c # additional number of allowed LP iterations
0.01/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.10 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.01/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.10 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.01/0.10 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.10 c heuristics/linesearchdiving/freq = c -1
0.01/0.10 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.10 c heuristics/intshifting/freq = c -1
0.01/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.10 c heuristics/intdiving/maxlpiterquot = c 0.075
0.01/0.10 c # additional number of allowed LP iterations
0.01/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.10 c heuristics/guideddiving/maxlpiterofs = c 1500
0.01/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.10 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.01/0.10 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.10 c heuristics/guideddiving/freq = c -1
0.01/0.10 c # additional number of allowed LP iterations
0.01/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.10 c heuristics/fracdiving/maxlpiterofs = c 1500
0.01/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.10 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.01/0.10 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.10 c heuristics/fracdiving/freq = c -1
0.01/0.10 c # additional number of allowed LP iterations
0.01/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.10 c heuristics/feaspump/maxlpiterofs = c 2000
0.01/0.10 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.10 c heuristics/feaspump/freq = c -1
0.01/0.10 c # minimum percentage of integer variables that have to be fixed
0.01/0.10 c # [type: real, range: [0,1], default: 0.666]
0.01/0.10 c heuristics/crossover/minfixingrate = c 0.5
0.01/0.10 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.10 c # [type: real, range: [0,1], default: 0.1]
0.01/0.10 c heuristics/crossover/nodesquot = c 0.15
0.01/0.10 c # number of nodes without incumbent change that heuristic should wait
0.01/0.10 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.10 c heuristics/crossover/nwaitingnodes = c 100
0.01/0.10 c # number of nodes added to the contingent of the total nodes
0.01/0.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.10 c heuristics/crossover/nodesofs = c 750
0.01/0.10 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.10 c heuristics/crossover/freq = c -1
0.01/0.10 c # additional number of allowed LP iterations
0.01/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.10 c heuristics/coefdiving/maxlpiterofs = c 1500
0.01/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.10 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.01/0.10 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.10 c heuristics/coefdiving/freq = c -1
0.01/0.10 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.10 c presolving/probing/maxrounds = c 0
0.01/0.10 c # should presolving try to simplify knapsacks
0.01/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.10 c constraints/knapsack/simplifyinequalities = c TRUE
0.01/0.10 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.10 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.10 c constraints/knapsack/disaggregation = c FALSE
0.01/0.10 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.10 c constraints/knapsack/maxnumcardlift = c 0
0.01/0.10 c # should presolving try to simplify inequalities
0.01/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.10 c constraints/linear/simplifyinequalities = c TRUE
0.01/0.10 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.10 c separating/maxroundsroot = c 5
0.01/0.10 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.10 c separating/maxrounds = c 1
0.01/0.10 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.10 c limits/solutions = c 1
0.01/0.10 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.10 c limits/memory = c 1620
0.01/0.10 c # maximal time in seconds to run
0.01/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.10 c limits/time = c 1791
0.01/0.10 c # frequency for displaying node information lines
0.01/0.10 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.10 c display/freq = c 10000
0.01/0.10 c -----------------------------------------------------------------------------------------------
0.01/0.10 c start solving problem
0.01/0.10 c
0.09/0.10 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.10 c 0.1s| 1 | 0 | 104 |1955k| 0 | 94 | 228 | 377 | 377 | 228 | 377 | 0 | 0 | 0 | 1.397425e+02 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 141 |2010k| 0 | 59 | 228 | 377 | 377 | 228 | 396 | 19 | 0 | 0 | 1.542344e+02 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 188 |2031k| 0 | 71 | 228 | 377 | 377 | 228 | 414 | 37 | 0 | 0 | 1.617956e+02 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 243 |2072k| 0 | 93 | 228 | 377 | 377 | 228 | 434 | 57 | 0 | 0 | 1.644849e+02 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 284 |2149k| 0 | 93 | 228 | 377 | 377 | 228 | 464 | 87 | 0 | 0 | 1.663377e+02 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 357 |2241k| 0 | 112 | 228 | 377 | 377 | 228 | 491 | 114 | 0 | 0 | 1.673677e+02 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 366 |2239k| 0 | 76 | 228 | 377 | 377 | 228 | 491 | 114 | 0 | 30 | 1.675677e+02 | -- | Inf
0.39/0.44 c 0.4s| 1 | 2 | 366 |2240k| 0 | 76 | 228 | 377 | 377 | 228 | 491 | 114 | 0 | 57 | 1.675677e+02 | -- | Inf
2.69/2.70 c
2.69/2.70 c SCIP Status : problem is solved [infeasible]
2.69/2.70 c Solving Time (sec) : 2.63
2.69/2.70 c Solving Nodes : 102
2.69/2.70 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.69/2.70 c Dual Bound : +1.00000000000000e+20
2.69/2.70 c Gap : 0.00 %
2.69/2.70 c NODE 102
2.69/2.70 c DUAL BOUND 1e+20
2.69/2.70 c PRIMAL BOUND 1e+20
2.69/2.70 c GAP 0
2.69/2.70 s UNSATISFIABLE
2.69/2.70 c SCIP Status : problem is solved [infeasible]
2.69/2.70 c Solving Time : 2.63
2.69/2.70 c Original Problem :
2.69/2.70 c Problem name : HOME/instance-1868581-1245128606.opb
2.69/2.70 c Variables : 495 (495 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.70 c Constraints : 940 initial, 940 maximal
2.69/2.70 c Presolved Problem :
2.69/2.70 c Problem name : t_HOME/instance-1868581-1245128606.opb
2.69/2.70 c Variables : 228 (228 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.70 c Constraints : 377 initial, 403 maximal
2.69/2.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.69/2.70 c trivial : 0.00 0 0 0 0 0 0 0 0
2.69/2.70 c dualfix : 0.00 1 0 0 0 0 0 0 0
2.69/2.70 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.69/2.70 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.69/2.70 c implics : 0.00 0 116 0 0 0 0 0 0
2.69/2.70 c probing : 0.00 0 0 0 0 0 0 0 0
2.69/2.70 c knapsack : 0.00 0 0 0 0 0 0 0 0
2.69/2.70 c linear : 0.04 105 45 0 105 0 563 75 152
2.69/2.70 c logicor : 0.00 0 0 0 0 0 0 0 0
2.69/2.70 c root node : - 41 - - 41 - - - -
2.69/2.70 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.69/2.70 c integral : 0 0 0 132 0 19 158 0 0 102
2.69/2.70 c knapsack : 112 5 690 0 0 0 0 185 0 0
2.69/2.70 c logicor : 265+ 5 649 0 0 23 1454 0 0 0
2.69/2.70 c countsols : 0 0 0 0 0 0 0 0 0 0
2.69/2.70 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.69/2.70 c integral : 2.14 0.00 0.00 2.14 0.00
2.69/2.70 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.69/2.70 c logicor : 0.01 0.00 0.01 0.00 0.00
2.69/2.70 c countsols : 0.00 0.00 0.00 0.00 0.00
2.69/2.70 c Propagators : Time Calls Cutoffs DomReds
2.69/2.70 c rootredcost : 0.00 0 0 0
2.69/2.70 c pseudoobj : 0.00 710 0 0
2.69/2.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.69/2.70 c propagation : 0.01 23 19 21 4.0 6 3.5 -
2.69/2.70 c infeasible LP : 0.00 10 0 0 0.0 0 0.0 0
2.69/2.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.69/2.70 c applied globally : - - - 26 3.8 - - -
2.69/2.70 c applied locally : - - - 0 0.0 - - -
2.69/2.70 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.69/2.70 c cut pool : 0.00 4 - - 68 - (maximal pool size: 419)
2.69/2.70 c redcost : 0.00 94 0 0 0 0
2.69/2.70 c impliedbounds : 0.00 5 0 0 0 0
2.69/2.70 c intobj : 0.00 0 0 0 0 0
2.69/2.70 c gomory : 0.05 5 0 0 911 0
2.69/2.70 c strongcg : 0.03 5 0 0 934 0
2.69/2.70 c cmir : 0.00 0 0 0 0 0
2.69/2.70 c flowcover : 0.00 0 0 0 0 0
2.69/2.70 c clique : 0.00 5 0 0 13 0
2.69/2.70 c zerohalf : 0.00 0 0 0 0 0
2.69/2.70 c mcf : 0.00 1 0 0 0 0
2.69/2.70 c Pricers : Time Calls Vars
2.69/2.70 c problem variables: 0.00 0 0
2.69/2.70 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.69/2.70 c relpscost : 2.14 132 19 158 0 0 102
2.69/2.70 c pscost : 0.00 0 0 0 0 0 0
2.69/2.70 c inference : 0.00 0 0 0 0 0 0
2.69/2.70 c mostinf : 0.00 0 0 0 0 0 0
2.69/2.70 c leastinf : 0.00 0 0 0 0 0 0
2.69/2.70 c fullstrong : 0.00 0 0 0 0 0 0
2.69/2.70 c allfullstrong : 0.00 0 0 0 0 0 0
2.69/2.70 c random : 0.00 0 0 0 0 0 0
2.69/2.70 c Primal Heuristics : Time Calls Found
2.69/2.70 c LP solutions : 0.00 - 0
2.69/2.70 c pseudo solutions : 0.00 - 0
2.69/2.70 c simplerounding : 0.00 0 0
2.69/2.70 c rounding : 0.00 0 0
2.69/2.70 c shifting : 0.00 0 0
2.69/2.70 c intshifting : 0.00 0 0
2.69/2.70 c oneopt : 0.00 0 0
2.69/2.70 c fixandinfer : 0.00 0 0
2.69/2.70 c feaspump : 0.00 0 0
2.69/2.70 c coefdiving : 0.00 0 0
2.69/2.70 c pscostdiving : 0.00 0 0
2.69/2.70 c fracdiving : 0.00 0 0
2.69/2.70 c veclendiving : 0.00 0 0
2.69/2.70 c intdiving : 0.00 0 0
2.69/2.70 c actconsdiving : 0.00 0 0
2.69/2.70 c objpscostdiving : 0.00 0 0
2.69/2.70 c rootsoldiving : 0.00 0 0
2.69/2.70 c linesearchdiving : 0.00 0 0
2.69/2.70 c guideddiving : 0.00 0 0
2.69/2.70 c octane : 0.00 0 0
2.69/2.70 c rens : 0.00 0 0
2.69/2.70 c rins : 0.00 0 0
2.69/2.70 c localbranching : 0.00 0 0
2.69/2.70 c mutation : 0.00 0 0
2.69/2.70 c crossover : 0.00 0 0
2.69/2.70 c dins : 0.00 0 0
2.69/2.70 c LP : Time Calls Iterations Iter/call Iter/sec
2.69/2.70 c primal LP : 0.00 0 0 0.00 -
2.69/2.70 c dual LP : 0.32 146 2348 16.08 7337.50
2.69/2.70 c barrier LP : 0.00 0 0 0.00 -
2.69/2.70 c diving/probing LP: 0.00 0 0 0.00 -
2.69/2.70 c strong branching : 2.12 1051 27125 25.81 12794.81
2.69/2.70 c (at root node) : - 57 2233 39.18 -
2.69/2.70 c conflict analysis: 0.00 0 0 0.00 -
2.69/2.70 c B&B Tree :
2.69/2.70 c number of runs : 1
2.69/2.70 c nodes : 102
2.69/2.70 c nodes (total) : 102
2.69/2.70 c nodes left : 0
2.69/2.70 c max depth : 10
2.69/2.70 c max depth (total): 10
2.69/2.70 c backtracks : 22 (21.6%)
2.69/2.70 c delayed cutoffs : 1
2.69/2.70 c repropagations : 19 (57 domain reductions, 1 cutoffs)
2.69/2.70 c avg switch length: 2.92
2.69/2.70 c switching time : 0.00
2.69/2.70 c Solution :
2.69/2.70 c Solutions found : 0 (0 improvements)
2.69/2.70 c Primal Bound : infeasible
2.69/2.70 c Dual Bound : -
2.69/2.70 c Gap : 0.00 %
2.69/2.70 c Root Dual Bound : +1.67567708333333e+02
2.69/2.71 c Time complete: 2.7.