0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver SoPlex 1.4.1
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-3730566-1338682923.opb>
0.00/0.02 c original problem has 1612 variables (1612 bin, 0 int, 0 impl, 0 cont) and 3653 constraints
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c start presolving problem
0.00/0.03 c presolving:
0.00/0.06 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.00/0.06 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.00/0.06 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.06/0.06 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.06/0.06 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.06/0.06 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.06/0.07 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.06/0.07 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.06/0.07 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.06/0.07 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.06/0.07 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.06/0.08 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.06/0.08 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.06/0.08 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.06/0.08 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.06/0.08 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.06/0.08 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.06/0.08 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.06/0.08 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.06/0.08 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.06/0.09 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.06/0.09 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.06/0.09 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.06/0.09 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.06/0.09 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.09/0.11 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.09/0.12 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.09/0.12 c presolving (28 rounds):
0.09/0.12 c 639 deleted vars, 1458 deleted constraints, 287 tightened bounds, 0 added holes, 199 changed sides, 405 changed coefficients
0.09/0.12 c 61641 implications, 0 cliques
0.09/0.12 c presolved problem has 973 variables (973 bin, 0 int, 0 impl, 0 cont) and 2195 constraints
0.09/0.12 c 332 constraints of type <knapsack>
0.09/0.12 c 1863 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.08
0.09/0.12 c SATUNSAT-LIN
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/flowcover/freq = c -1
0.09/0.12 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/cmir/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/veclendiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/simplerounding/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/shifting/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/rounding/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/rootsoldiving/freq = c -1
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/rens/nodesofs = c 2000
0.09/0.12 c # minimum percentage of integer variables that have to be fixable
0.09/0.12 c # [type: real, range: [0,1], default: 0.5]
0.09/0.12 c heuristics/rens/minfixingrate = c 0.3
0.09/0.12 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c heuristics/rens/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/pscostdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/oneopt/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.12 c # [type: real, range: [0,1], default: 0.01]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/objpscostdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/linesearchdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/intshifting/freq = c -1
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/guideddiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/fracdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.12 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/feaspump/freq = c -1
0.09/0.12 c # minimum percentage of integer variables that have to be fixed
0.09/0.12 c # [type: real, range: [0,1], default: 0.666]
0.09/0.12 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.12 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.12 c # [type: real, range: [0,1], default: 0.1]
0.09/0.12 c heuristics/crossover/nodesquot = c 0.15
0.09/0.12 c # number of nodes without incumbent change that heuristic should wait
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.12 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/crossover/nodesofs = c 750
0.09/0.12 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.12 c heuristics/crossover/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/coefdiving/freq = c -1
0.09/0.12 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c presolving/probing/maxrounds = c 0
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.12 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.12 c constraints/knapsack/disaggregation = c FALSE
0.09/0.12 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.13 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.13 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c separating/maxroundsroot = c 5
0.09/0.13 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.13 c separating/maxrounds = c 1
0.09/0.13 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.13 c limits/solutions = c 1
0.09/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/memory = c 13950
0.09/0.13 c # maximal time in seconds to run
0.09/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.13 c limits/time = c 1791
0.09/0.13 c # frequency for displaying node information lines
0.09/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.13 c display/freq = c 10000
0.09/0.13 c -----------------------------------------------------------------------------------------------
0.09/0.13 c start solving problem
0.09/0.13 c
0.09/0.14 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.14 c 0.1s| 1 | 0 | 233 |8048k| 0 | 200 | 973 |2195 |2195 | 973 |2195 | 0 | 0 | 0 | 2.858782e+02 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 357 |8166k| 0 | 166 | 973 |2195 |2195 | 973 |2241 | 46 | 0 | 0 | 3.193792e+02 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 501 |8224k| 0 | 234 | 973 |2195 |2195 | 973 |2284 | 89 | 0 | 0 | 3.330069e+02 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 663 |8350k| 0 | 235 | 973 |2195 |2195 | 973 |2376 | 181 | 0 | 0 | 3.366308e+02 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 835 |8431k| 0 | 261 | 973 |2195 |2195 | 973 |2435 | 240 | 0 | 0 | 3.396752e+02 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 1057 |8477k| 0 | 282 | 973 |2195 |2195 | 973 |2462 | 267 | 0 | 0 | 3.421427e+02 | -- | Inf
0.89/0.97 c 0.9s| 1 | 2 | 1057 |8478k| 0 | 282 | 973 |2195 |2195 | 973 |2462 | 267 | 0 | 36 | 3.421427e+02 | -- | Inf
24.88/24.96 c
24.88/24.96 c SCIP Status : problem is solved [infeasible]
24.88/24.96 c Solving Time (sec) : 24.67
24.88/24.96 c Solving Nodes : 585
24.88/24.96 c Primal Bound : +1.00000000000000e+20 (0 solutions)
24.88/24.96 c Dual Bound : +1.00000000000000e+20
24.88/24.96 c Gap : 0.00 %
24.88/24.96 c NODE 585
24.88/24.96 c DUAL BOUND 1e+20
24.88/24.96 c PRIMAL BOUND 1e+20
24.88/24.96 c GAP 0
24.88/24.96 s UNSATISFIABLE
24.88/24.96 c SCIP Status : problem is solved [infeasible]
24.88/24.96 c Solving Time : 24.67
24.88/24.96 c Original Problem :
24.88/24.96 c Problem name : HOME/instance-3730566-1338682923.opb
24.88/24.96 c Variables : 1612 (1612 binary, 0 integer, 0 implicit integer, 0 continuous)
24.88/24.96 c Constraints : 3653 initial, 3653 maximal
24.88/24.96 c Presolved Problem :
24.88/24.96 c Problem name : t_HOME/instance-3730566-1338682923.opb
24.88/24.96 c Variables : 973 (973 binary, 0 integer, 0 implicit integer, 0 continuous)
24.88/24.96 c Constraints : 2195 initial, 2350 maximal
24.88/24.96 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
24.88/24.96 c trivial : 0.00 1 0 0 0 0 0 0 0
24.88/24.96 c dualfix : 0.00 0 0 0 0 0 0 0 0
24.88/24.96 c boundshift : 0.00 0 0 0 0 0 0 0 0
24.88/24.96 c inttobinary : 0.00 0 0 0 0 0 0 0 0
24.88/24.96 c implics : 0.00 0 270 0 0 0 0 0 0
24.88/24.96 c probing : 0.00 0 0 0 0 0 0 0 0
24.88/24.96 c knapsack : 0.01 0 0 0 0 0 0 0 0
24.88/24.96 c linear : 0.05 286 82 0 287 0 1458 199 405
24.88/24.96 c logicor : 0.01 0 0 0 0 0 0 0 0
24.88/24.96 c root node : - 4 - - 4 - - - -
24.88/24.96 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
24.88/24.96 c integral : 0 0 0 709 0 37 458 0 0 980
24.88/24.96 c knapsack : 332 5 4780 0 0 4 1055 609 0 0
24.88/24.96 c logicor : 1863+ 5 4241 0 0 61 11396 0 0 0
24.88/24.96 c countsols : 0 0 0 0 0 0 0 0 0 0
24.88/24.96 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
24.88/24.96 c integral : 19.00 0.00 0.00 19.00 0.00
24.88/24.96 c knapsack : 0.00 0.00 0.00 0.00 0.00
24.88/24.96 c logicor : 0.04 0.00 0.04 0.00 0.00
24.88/24.96 c countsols : 0.00 0.00 0.00 0.00 0.00
24.88/24.96 c Propagators : Time Calls Cutoffs DomReds
24.88/24.96 c rootredcost : 0.00 0 0 0
24.88/24.96 c pseudoobj : 0.08 4796 0 0
24.88/24.96 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
24.88/24.96 c propagation : 0.00 65 58 115 5.4 35 5.2 -
24.88/24.96 c infeasible LP : 0.00 28 28 68 7.5 7 3.7 0
24.88/24.96 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
24.88/24.96 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
24.88/24.96 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
24.88/24.96 c applied globally : - - - 174 5.1 - - -
24.88/24.96 c applied locally : - - - 0 0.0 - - -
24.88/24.96 c Separators : Time Calls Cutoffs DomReds Cuts Conss
24.88/24.96 c cut pool : 0.00 4 - - 278 - (maximal pool size: 698)
24.88/24.96 c redcost : 0.00 541 0 0 0 0
24.88/24.96 c impliedbounds : 0.00 5 0 0 0 0
24.88/24.96 c intobj : 0.00 0 0 0 0 0
24.88/24.96 c gomory : 0.08 5 0 0 1541 0
24.88/24.96 c strongcg : 0.07 5 0 0 1590 0
24.88/24.96 c cmir : 0.00 0 0 0 0 0
24.88/24.96 c flowcover : 0.00 0 0 0 0 0
24.88/24.96 c clique : 0.01 5 0 0 17 0
24.88/24.96 c zerohalf : 0.00 0 0 0 0 0
24.88/24.96 c mcf : 0.00 1 0 0 0 0
24.88/24.96 c Pricers : Time Calls Vars
24.88/24.96 c problem variables: 0.00 0 0
24.88/24.96 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
24.88/24.96 c relpscost : 19.00 709 37 458 0 0 980
24.88/24.96 c pscost : 0.00 0 0 0 0 0 0
24.88/24.96 c inference : 0.00 0 0 0 0 0 0
24.88/24.96 c mostinf : 0.00 0 0 0 0 0 0
24.88/24.96 c leastinf : 0.00 0 0 0 0 0 0
24.88/24.96 c fullstrong : 0.00 0 0 0 0 0 0
24.88/24.96 c allfullstrong : 0.00 0 0 0 0 0 0
24.88/24.96 c random : 0.00 0 0 0 0 0 0
24.88/24.96 c Primal Heuristics : Time Calls Found
24.88/24.96 c LP solutions : 0.00 - 0
24.88/24.96 c pseudo solutions : 0.00 - 0
24.88/24.96 c simplerounding : 0.00 0 0
24.88/24.96 c rounding : 0.00 0 0
24.88/24.96 c shifting : 0.00 0 0
24.88/24.96 c intshifting : 0.00 0 0
24.88/24.96 c oneopt : 0.00 0 0
24.88/24.96 c fixandinfer : 0.00 0 0
24.88/24.96 c feaspump : 0.00 0 0
24.88/24.96 c coefdiving : 0.00 0 0
24.88/24.96 c pscostdiving : 0.00 0 0
24.88/24.96 c fracdiving : 0.00 0 0
24.88/24.96 c veclendiving : 0.00 0 0
24.88/24.96 c intdiving : 0.00 0 0
24.88/24.96 c actconsdiving : 0.00 0 0
24.88/24.96 c objpscostdiving : 0.00 0 0
24.88/24.96 c rootsoldiving : 0.00 0 0
24.88/24.96 c linesearchdiving : 0.00 0 0
24.88/24.96 c guideddiving : 0.00 0 0
24.88/24.96 c octane : 0.00 0 0
24.88/24.96 c rens : 0.00 0 0
24.88/24.96 c rins : 0.00 0 0
24.88/24.96 c localbranching : 0.00 0 0
24.88/24.96 c mutation : 0.00 0 0
24.88/24.96 c crossover : 0.00 0 0
24.88/24.96 c dins : 0.00 0 0
24.88/24.96 c LP : Time Calls Iterations Iter/call Iter/sec
24.88/24.96 c primal LP : 0.00 0 0 0.00 -
24.88/24.96 c dual LP : 5.05 733 37893 51.70 7503.56
24.88/24.96 c barrier LP : 0.00 0 0 0.00 -
24.88/24.96 c diving/probing LP: 0.00 0 0 0.00 -
24.88/24.96 c strong branching : 18.99 2027 122286 60.33 6439.49
24.88/24.96 c (at root node) : - 36 3469 96.36 -
24.88/24.96 c conflict analysis: 0.00 0 0 0.00 -
24.88/24.96 c B&B Tree :
24.88/24.96 c number of runs : 1
24.88/24.96 c nodes : 585
24.88/24.96 c nodes (total) : 585
24.88/24.96 c nodes left : 0
24.88/24.96 c max depth : 27
24.88/24.96 c max depth (total): 27
24.88/24.96 c backtracks : 105 (17.9%)
24.88/24.96 c delayed cutoffs : 396
24.88/24.96 c repropagations : 339 (2257 domain reductions, 35 cutoffs)
24.88/24.96 c avg switch length: 4.04
24.88/24.96 c switching time : 0.07
24.88/24.96 c Solution :
24.88/24.96 c Solutions found : 0 (0 improvements)
24.88/24.96 c Primal Bound : infeasible
24.88/24.96 c Dual Bound : -
24.88/24.96 c Gap : 0.00 %
24.88/24.96 c Root Dual Bound : +3.42142687200412e+02
24.88/24.97 c Time complete: 24.95.