0.01/0.07 c SCIP version 1.1.0.7
0.01/0.07 c LP-Solver Clp 1.8.2
0.01/0.07 c user parameter file <scip.set> not found - using default parameters
0.01/0.07 c read problem <HOME/instance-1868563-1245128056.opb>
0.01/0.07 c original problem has 1612 variables (1612 bin, 0 int, 0 impl, 0 cont) and 3653 constraints
0.01/0.09 c No objective function, only one solution is needed.
0.01/0.09 c start presolving problem
0.01/0.09 c presolving:
0.09/0.14 c (round 1) 214 del vars, 149 del conss, 49 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 57928 impls, 0 clqs
0.09/0.15 c (round 2) 215 del vars, 495 del conss, 50 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 57928 impls, 0 clqs
0.09/0.16 c (round 3) 239 del vars, 525 del conss, 65 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58276 impls, 0 clqs
0.09/0.16 c (round 4) 255 del vars, 564 del conss, 72 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58392 impls, 0 clqs
0.09/0.17 c (round 5) 269 del vars, 605 del conss, 80 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58494 impls, 0 clqs
0.09/0.17 c (round 6) 285 del vars, 648 del conss, 91 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58596 impls, 0 clqs
0.09/0.17 c (round 7) 304 del vars, 688 del conss, 107 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58622 impls, 0 clqs
0.09/0.18 c (round 8) 328 del vars, 747 del conss, 122 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58966 impls, 0 clqs
0.09/0.19 c (round 9) 418 del vars, 959 del conss, 191 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 59510 impls, 0 clqs
0.09/0.19 c (round 10) 439 del vars, 1051 del conss, 209 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 59776 impls, 0 clqs
0.19/0.20 c (round 11) 450 del vars, 1077 del conss, 214 chg bounds, 194 chg sides, 398 chg coeffs, 0 upgd conss, 60377 impls, 0 clqs
0.19/0.20 c (round 12) 494 del vars, 1185 del conss, 244 chg bounds, 194 chg sides, 398 chg coeffs, 0 upgd conss, 60851 impls, 0 clqs
0.19/0.21 c (round 13) 513 del vars, 1250 del conss, 255 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61264 impls, 0 clqs
0.19/0.21 c (round 14) 517 del vars, 1280 del conss, 257 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61270 impls, 0 clqs
0.19/0.22 c (round 15) 520 del vars, 1290 del conss, 259 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61274 impls, 0 clqs
0.19/0.22 c (round 16) 522 del vars, 1297 del conss, 261 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61276 impls, 0 clqs
0.19/0.22 c (round 17) 524 del vars, 1303 del conss, 263 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61278 impls, 0 clqs
0.19/0.23 c (round 18) 528 del vars, 1309 del conss, 267 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61278 impls, 0 clqs
0.19/0.23 c (round 19) 539 del vars, 1327 del conss, 274 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61336 impls, 0 clqs
0.19/0.23 c (round 20) 545 del vars, 1355 del conss, 277 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61403 impls, 0 clqs
0.19/0.24 c (round 21) 550 del vars, 1370 del conss, 280 chg bounds, 197 chg sides, 401 chg coeffs, 0 upgd conss, 61422 impls, 0 clqs
0.19/0.24 c (round 22) 554 del vars, 1382 del conss, 282 chg bounds, 198 chg sides, 403 chg coeffs, 0 upgd conss, 61434 impls, 0 clqs
0.19/0.24 c (round 23) 564 del vars, 1405 del conss, 286 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61627 impls, 0 clqs
0.19/0.25 c (round 24) 567 del vars, 1425 del conss, 287 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61641 impls, 0 clqs
0.19/0.25 c (round 25) 567 del vars, 1429 del conss, 287 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61641 impls, 0 clqs
0.19/0.29 c (round 26) 567 del vars, 1446 del conss, 287 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 61641 impls, 0 clqs
0.29/0.32 c (round 27) 639 del vars, 1458 del conss, 287 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 61641 impls, 0 clqs
0.29/0.33 c presolving (28 rounds):
0.29/0.33 c 639 deleted vars, 1458 deleted constraints, 287 tightened bounds, 0 added holes, 199 changed sides, 405 changed coefficients
0.29/0.33 c 61641 implications, 0 cliques
0.29/0.33 c presolved problem has 973 variables (973 bin, 0 int, 0 impl, 0 cont) and 2195 constraints
0.29/0.33 c 332 constraints of type <knapsack>
0.29/0.33 c 1863 constraints of type <logicor>
0.29/0.33 c transformed objective value is always integral (scale: 1)
0.29/0.33 c Presolving Time: 0.21
0.29/0.33 c SATUNSAT-LIN
0.29/0.33 c -----------------------------------------------------------------------------------------------
0.29/0.33 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c separating/flowcover/freq = c -1
0.29/0.33 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c separating/cmir/freq = c -1
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.33 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/veclendiving/freq = c -1
0.29/0.33 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/simplerounding/freq = c -1
0.29/0.33 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/shifting/freq = c -1
0.29/0.33 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/rounding/freq = c -1
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.33 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.33 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/rootsoldiving/freq = c -1
0.29/0.33 c # number of nodes added to the contingent of the total nodes
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.33 c heuristics/rens/nodesofs = c 2000
0.29/0.33 c # minimum percentage of integer variables that have to be fixable
0.29/0.33 c # [type: real, range: [0,1], default: 0.5]
0.29/0.33 c heuristics/rens/minfixingrate = c 0.3
0.29/0.33 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c heuristics/rens/freq = c -1
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.33 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/pscostdiving/freq = c -1
0.29/0.33 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/oneopt/freq = c -1
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.33 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.33 c # [type: real, range: [0,1], default: 0.01]
0.29/0.33 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.33 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/objpscostdiving/freq = c -1
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.33 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/linesearchdiving/freq = c -1
0.29/0.33 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/intshifting/freq = c -1
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.33 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/guideddiving/freq = c -1
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.33 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/fracdiving/freq = c -1
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.33 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/feaspump/freq = c -1
0.29/0.33 c # minimum percentage of integer variables that have to be fixed
0.29/0.33 c # [type: real, range: [0,1], default: 0.666]
0.29/0.33 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.33 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.33 c # [type: real, range: [0,1], default: 0.1]
0.29/0.33 c heuristics/crossover/nodesquot = c 0.15
0.29/0.33 c # number of nodes without incumbent change that heuristic should wait
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.33 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.33 c # number of nodes added to the contingent of the total nodes
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.33 c heuristics/crossover/nodesofs = c 750
0.29/0.33 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.33 c heuristics/crossover/freq = c -1
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.33 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/coefdiving/freq = c -1
0.29/0.33 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c presolving/probing/maxrounds = c 0
0.29/0.33 c # should presolving try to simplify knapsacks
0.29/0.33 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.33 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.33 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.33 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.33 c constraints/knapsack/disaggregation = c FALSE
0.29/0.33 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.33 c # should presolving try to simplify inequalities
0.29/0.34 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.34 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.34 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.34 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.34 c separating/maxroundsroot = c 5
0.29/0.34 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.34 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.34 c separating/maxrounds = c 1
0.29/0.34 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.34 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.34 c limits/solutions = c 1
0.29/0.34 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.34 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.34 c limits/memory = c 1620
0.29/0.34 c # maximal time in seconds to run
0.29/0.34 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.34 c limits/time = c 1791
0.29/0.34 c # frequency for displaying node information lines
0.29/0.34 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.34 c display/freq = c 10000
0.29/0.34 c -----------------------------------------------------------------------------------------------
0.29/0.34 c start solving problem
0.29/0.34 c
0.29/0.36 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.36 c 0.2s| 1 | 0 | 227 |8048k| 0 | 200 | 973 |2195 |2195 | 973 |2195 | 0 | 0 | 0 | 2.858782e+02 | -- | Inf
0.39/0.46 c 0.3s| 1 | 0 | 344 |8169k| 0 | 165 | 973 |2195 |2195 | 973 |2237 | 42 | 0 | 0 | 3.191725e+02 | -- | Inf
0.49/0.55 c 0.4s| 1 | 0 | 486 |8237k| 0 | 256 | 973 |2195 |2195 | 973 |2284 | 89 | 0 | 0 | 3.319685e+02 | -- | Inf
0.59/0.69 c 0.6s| 1 | 0 | 756 |8368k| 0 | 282 | 973 |2195 |2195 | 973 |2381 | 186 | 0 | 0 | 3.360479e+02 | -- | Inf
0.79/0.87 c 0.8s| 1 | 0 | 989 |8468k| 0 | 296 | 973 |2195 |2195 | 973 |2434 | 239 | 0 | 0 | 3.397989e+02 | -- | Inf
1.00/1.09 c 0.9s| 1 | 0 | 1245 |8642k| 0 | 301 | 973 |2195 |2195 | 973 |2504 | 309 | 0 | 0 | 3.420161e+02 | -- | Inf
1.59/1.62 c 1.5s| 1 | 2 | 1245 |8643k| 0 | 301 | 973 |2195 |2195 | 973 |2504 | 309 | 0 | 18 | 3.420161e+02 | -- | Inf
108.76/108.87 c 108s| 10000 | 6557 |228098 | 19M| 57 | 71 | 973 |2413 | 642 | 973 |2472 | 309 | 706 |3965 | 3.747902e+02 | -- | Inf
200.63/200.78 c 199s| 20000 | 12560 |442161 | 29M| 57 | 79 | 973 |2463 | 710 | 973 |2472 | 309 |1326 |7811 | 3.760285e+02 | -- | Inf
284.20/284.39 c 282s| 30000 | 12364 |649107 | 31M| 57 | 59 | 973 |2832 | 696 | 973 |2472 | 309 |2479 |9668 | 3.833928e+02 | -- | Inf
356.58/356.73 c 354s| 40000 | 8367 |829205 | 26M| 57 | - | 973 |3545 | 796 | 973 |2472 | 309 |3909 |9866 | 3.928881e+02 | -- | Inf
377.98/378.16 c
377.98/378.16 c SCIP Status : problem is solved [infeasible]
377.98/378.16 c Solving Time (sec) : 374.82
377.98/378.16 c Solving Nodes : 42041
377.98/378.16 c Primal Bound : +1.00000000000000e+20 (0 solutions)
377.98/378.16 c Dual Bound : +1.00000000000000e+20
377.98/378.16 c Gap : 0.00 %
377.98/378.16 c NODE 42041
377.98/378.16 c DUAL BOUND 1e+20
377.98/378.16 c PRIMAL BOUND 1e+20
377.98/378.16 c GAP 0
377.98/378.16 s UNSATISFIABLE
377.98/378.16 c SCIP Status : problem is solved [infeasible]
377.98/378.16 c Solving Time : 374.82
377.98/378.16 c Original Problem :
377.98/378.16 c Problem name : HOME/instance-1868563-1245128056.opb
377.98/378.16 c Variables : 1612 (1612 binary, 0 integer, 0 implicit integer, 0 continuous)
377.98/378.16 c Constraints : 3653 initial, 3653 maximal
377.98/378.16 c Presolved Problem :
377.98/378.16 c Problem name : t_HOME/instance-1868563-1245128056.opb
377.98/378.16 c Variables : 973 (973 binary, 0 integer, 0 implicit integer, 0 continuous)
377.98/378.16 c Constraints : 2195 initial, 4011 maximal
377.98/378.16 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
377.98/378.16 c trivial : 0.00 1 0 0 0 0 0 0 0
377.98/378.16 c dualfix : 0.00 0 0 0 0 0 0 0 0
377.98/378.16 c boundshift : 0.00 0 0 0 0 0 0 0 0
377.98/378.16 c inttobinary : 0.00 0 0 0 0 0 0 0 0
377.98/378.16 c implics : 0.02 0 270 0 0 0 0 0 0
377.98/378.16 c probing : 0.00 0 0 0 0 0 0 0 0
377.98/378.16 c knapsack : 0.01 0 0 0 0 0 0 0 0
377.98/378.16 c linear : 0.13 286 82 0 287 0 1458 199 405
377.98/378.16 c logicor : 0.03 0 0 0 0 0 0 0 0
377.98/378.16 c root node : - 245 - - 245 - - - -
377.98/378.16 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
377.98/378.16 c integral : 0 0 0 36165 0 1550 4961 0 0 64582
377.98/378.16 c knapsack : 332 5 135505 0 0 1044 178917 614 0 0
377.98/378.16 c logicor : 1863+ 5 107622 0 0 719 147015 0 0 0
377.98/378.16 c countsols : 0 0 0 0 0 0 0 0 0 0
377.98/378.16 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
377.98/378.16 c integral : 54.97 0.00 0.00 54.97 0.00
377.98/378.16 c knapsack : 4.68 0.01 4.67 0.00 0.00
377.98/378.16 c logicor : 2.92 0.00 2.92 0.00 0.00
377.98/378.16 c countsols : 0.00 0.00 0.00 0.00 0.00
377.98/378.16 c Propagators : Time Calls Cutoffs DomReds
377.98/378.16 c rootredcost : 0.11 0 0 0
377.98/378.16 c pseudoobj : 6.51 136209 1 0
377.98/378.16 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
377.98/378.16 c propagation : 0.13 1763 1759 6161 11.2 1614 4.1 -
377.98/378.16 c infeasible LP : 1.50 6798 0 0 0.0 0 0.0 0
377.98/378.16 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
377.98/378.16 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
377.98/378.16 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
377.98/378.16 c applied globally : - - - 4598 7.7 - - -
377.98/378.16 c applied locally : - - - 0 0.0 - - -
377.98/378.16 c Separators : Time Calls Cutoffs DomReds Cuts Conss
377.98/378.16 c cut pool : 0.00 4 - - 233 - (maximal pool size: 844)
377.98/378.16 c redcost : 1.90 33925 0 0 0 0
377.98/378.16 c impliedbounds : 0.00 5 0 0 0 0
377.98/378.16 c intobj : 0.00 0 0 0 0 0
377.98/378.16 c gomory : 0.23 5 0 0 1703 0
377.98/378.16 c strongcg : 0.24 5 0 0 1704 0
377.98/378.16 c cmir : 0.00 0 0 0 0 0
377.98/378.16 c flowcover : 0.00 0 0 0 0 0
377.98/378.16 c clique : 0.02 5 0 0 27 0
377.98/378.16 c zerohalf : 0.00 0 0 0 0 0
377.98/378.16 c mcf : 0.00 1 0 0 0 0
377.98/378.16 c Pricers : Time Calls Vars
377.98/378.16 c problem variables: 0.00 0 0
377.98/378.16 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
377.98/378.16 c relpscost : 54.87 36165 1550 4961 0 0 64582
377.98/378.16 c pscost : 0.00 0 0 0 0 0 0
377.98/378.16 c inference : 0.00 0 0 0 0 0 0
377.98/378.16 c mostinf : 0.00 0 0 0 0 0 0
377.98/378.16 c leastinf : 0.00 0 0 0 0 0 0
377.98/378.16 c fullstrong : 0.00 0 0 0 0 0 0
377.98/378.16 c allfullstrong : 0.00 0 0 0 0 0 0
377.98/378.16 c random : 0.00 0 0 0 0 0 0
377.98/378.16 c Primal Heuristics : Time Calls Found
377.98/378.16 c LP solutions : 0.00 - 0
377.98/378.16 c pseudo solutions : 0.00 - 0
377.98/378.16 c simplerounding : 0.00 0 0
377.98/378.16 c rounding : 0.00 0 0
377.98/378.16 c shifting : 0.00 0 0
377.98/378.16 c intshifting : 0.00 0 0
377.98/378.16 c oneopt : 0.00 0 0
377.98/378.16 c fixandinfer : 0.00 0 0
377.98/378.16 c feaspump : 0.00 0 0
377.98/378.16 c coefdiving : 0.00 0 0
377.98/378.16 c pscostdiving : 0.00 0 0
377.98/378.16 c fracdiving : 0.00 0 0
377.98/378.16 c veclendiving : 0.00 0 0
377.98/378.16 c intdiving : 0.00 0 0
377.98/378.16 c actconsdiving : 0.00 0 0
377.98/378.16 c objpscostdiving : 0.00 0 0
377.98/378.16 c rootsoldiving : 0.00 0 0
377.98/378.16 c linesearchdiving : 0.00 0 0
377.98/378.16 c guideddiving : 0.00 0 0
377.98/378.16 c octane : 0.00 0 0
377.98/378.16 c rens : 0.00 0 0
377.98/378.17 c rins : 0.00 0 0
377.98/378.17 c localbranching : 0.00 0 0
377.98/378.17 c mutation : 0.00 0 0
377.98/378.17 c crossover : 0.00 0 0
377.98/378.17 c dins : 0.00 0 0
377.98/378.17 c LP : Time Calls Iterations Iter/call Iter/sec
377.98/378.17 c primal LP : 0.01 0 0 0.00 0.00
377.98/378.17 c dual LP : 260.55 42647 890375 20.88 3417.29
377.98/378.17 c barrier LP : 0.00 0 0 0.00 -
377.98/378.17 c diving/probing LP: 0.00 0 0 0.00 -
377.98/378.17 c strong branching : 52.01 10139 218279 21.53 4196.87
377.98/378.17 c (at root node) : - 18 2577 143.17 -
377.98/378.17 c conflict analysis: 0.00 0 0 0.00 -
377.98/378.17 c B&B Tree :
377.98/378.17 c number of runs : 1
377.98/378.17 c nodes : 42041
377.98/378.17 c nodes (total) : 42041
377.98/378.17 c nodes left : 0
377.98/378.17 c max depth : 57
377.98/378.17 c max depth (total): 57
377.98/378.17 c backtracks : 9322 (22.2%)
377.98/378.17 c delayed cutoffs : 22542
377.98/378.17 c repropagations : 12123 (21972 domain reductions, 362 cutoffs)
377.98/378.17 c avg switch length: 9.53
377.98/378.17 c switching time : 12.91
377.98/378.17 c Solution :
377.98/378.17 c Solutions found : 0 (0 improvements)
377.98/378.17 c Primal Bound : infeasible
377.98/378.17 c Dual Bound : -
377.98/378.17 c Gap : 0.00 %
377.98/378.17 c Root Dual Bound : +3.42016121381001e+02
378.08/378.20 c Time complete: 378.08.