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-3730631-1338682990.opb>
0.00/0.02 c original problem has 1190 variables (1190 bin, 0 int, 0 impl, 0 cont) and 3183 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.05 c (round 1) 123 del vars, 17 del conss, 5 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60694 impls, 0 clqs
0.00/0.05 c (round 2) 124 del vars, 251 del conss, 6 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60694 impls, 0 clqs
0.00/0.05 c (round 3) 126 del vars, 256 del conss, 8 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60720 impls, 0 clqs
0.00/0.06 c (round 4) 128 del vars, 259 del conss, 10 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60720 impls, 0 clqs
0.00/0.06 c (round 5) 132 del vars, 265 del conss, 14 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60720 impls, 0 clqs
0.00/0.06 c (round 6) 139 del vars, 275 del conss, 18 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60744 impls, 0 clqs
0.00/0.06 c (round 7) 147 del vars, 293 del conss, 22 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60810 impls, 0 clqs
0.00/0.06 c (round 8) 154 del vars, 312 del conss, 26 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60850 impls, 0 clqs
0.00/0.06 c (round 9) 161 del vars, 329 del conss, 30 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60882 impls, 0 clqs
0.05/0.06 c (round 10) 173 del vars, 355 del conss, 38 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60996 impls, 0 clqs
0.05/0.06 c (round 11) 182 del vars, 379 del conss, 44 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61072 impls, 0 clqs
0.05/0.06 c (round 12) 186 del vars, 397 del conss, 48 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61076 impls, 0 clqs
0.05/0.07 c (round 13) 190 del vars, 405 del conss, 52 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61076 impls, 0 clqs
0.05/0.07 c (round 14) 196 del vars, 413 del conss, 55 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61112 impls, 0 clqs
0.05/0.07 c (round 15) 201 del vars, 425 del conss, 57 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61182 impls, 0 clqs
0.05/0.07 c (round 16) 206 del vars, 437 del conss, 59 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61340 impls, 0 clqs
0.05/0.07 c (round 17) 208 del vars, 449 del conss, 61 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61350 impls, 0 clqs
0.05/0.07 c (round 18) 211 del vars, 453 del conss, 61 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61522 impls, 0 clqs
0.05/0.07 c (round 19) 211 del vars, 460 del conss, 61 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61522 impls, 0 clqs
0.05/0.09 c (round 20) 211 del vars, 468 del conss, 61 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 61522 impls, 0 clqs
0.09/0.10 c (round 21) 231 del vars, 472 del conss, 61 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 61522 impls, 0 clqs
0.09/0.11 c presolving (22 rounds):
0.09/0.11 c 231 deleted vars, 472 deleted constraints, 61 tightened bounds, 0 added holes, 64 changed sides, 136 changed coefficients
0.09/0.11 c 61522 implications, 0 cliques
0.09/0.11 c presolved problem has 959 variables (959 bin, 0 int, 0 impl, 0 cont) and 2711 constraints
0.09/0.11 c 112 constraints of type <knapsack>
0.09/0.11 c 2599 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.06
0.09/0.11 c SATUNSAT-LIN
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c separating/flowcover/freq = c -1
0.09/0.11 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c separating/cmir/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/veclendiving/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/simplerounding/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/shifting/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/rounding/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.11 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.11 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.11 c heuristics/rootsoldiving/freq = c -1
0.09/0.11 c # number of nodes added to the contingent of the total nodes
0.09/0.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.11 c heuristics/rens/nodesofs = c 2000
0.09/0.11 c # minimum percentage of integer variables that have to be fixable
0.09/0.11 c # [type: real, range: [0,1], default: 0.5]
0.09/0.11 c heuristics/rens/minfixingrate = c 0.3
0.09/0.11 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c heuristics/rens/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/pscostdiving/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/oneopt/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.11 c # [type: real, range: [0,1], default: 0.01]
0.09/0.11 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.11 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.11 c heuristics/objpscostdiving/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/linesearchdiving/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/intshifting/freq = c -1
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/guideddiving/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/fracdiving/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.11 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.11 c heuristics/feaspump/freq = c -1
0.09/0.11 c # minimum percentage of integer variables that have to be fixed
0.09/0.11 c # [type: real, range: [0,1], default: 0.666]
0.09/0.11 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.11 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.11 c # [type: real, range: [0,1], default: 0.1]
0.09/0.11 c heuristics/crossover/nodesquot = c 0.15
0.09/0.11 c # number of nodes without incumbent change that heuristic should wait
0.09/0.11 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.11 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.11 c # number of nodes added to the contingent of the total nodes
0.09/0.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.11 c heuristics/crossover/nodesofs = c 750
0.09/0.11 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.11 c heuristics/crossover/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/coefdiving/freq = c -1
0.09/0.11 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c presolving/probing/maxrounds = c 0
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.11 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.11 c constraints/knapsack/disaggregation = c FALSE
0.09/0.11 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.11 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c separating/maxroundsroot = c 5
0.09/0.11 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.11 c separating/maxrounds = c 1
0.09/0.11 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c limits/solutions = c 1
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = c 13950
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = c 1791
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = c 10000
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving problem
0.09/0.11 c
0.09/0.13 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.13 c 0.1s| 1 | 0 | 341 |7432k| 0 | 151 | 959 |2711 |2711 | 959 |2711 | 0 | 0 | 0 | 1.962453e+02 | -- | Inf
0.09/0.19 c 0.1s| 1 | 0 | 451 |7531k| 0 | 169 | 959 |2711 |2711 | 959 |2747 | 36 | 0 | 0 | 2.080783e+02 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 625 |7589k| 0 | 166 | 959 |2711 |2711 | 959 |2700 | 475 | 0 | 0 | 2.357838e+02 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 740 |7688k| 0 | 194 | 959 |2711 |2711 | 959 |2735 | 510 | 0 | 0 | 2.421825e+02 | -- | Inf
0.39/0.40 c 0.3s| 1 | 0 | 780 |7855k| 0 | 210 | 959 |2711 |2711 | 959 |2747 | 522 | 0 | 0 | 2.427957e+02 | -- | Inf
0.39/0.47 c 0.4s| 1 | 0 | 864 |7978k| 0 | 214 | 959 |2711 |2711 | 959 |2763 | 538 | 0 | 0 | 2.443646e+02 | -- | Inf
0.59/0.60 c 0.6s| 1 | 0 | 874 |7976k| 0 | 218 | 959 |2709 |2709 | 959 |2763 | 538 | 0 | 19 | 2.446979e+02 | -- | Inf
1.10/1.17 c 1.1s| 1 | 0 | 876 |7971k| 0 | 215 | 959 |2702 |2702 | 959 |2763 | 538 | 0 | 57 | 2.448646e+02 | -- | Inf
1.39/1.44 c 1.4s| 1 | 0 | 884 |7971k| 0 | 220 | 959 |2702 |2702 | 959 |2763 | 538 | 0 | 74 | 2.456979e+02 | -- | Inf
1.69/1.78 c 1.7s| 1 | 2 | 884 |7971k| 0 | 220 | 959 |2702 |2702 | 959 |2763 | 538 | 0 | 89 | 2.456979e+02 | -- | Inf
23.19/23.22 c
23.19/23.22 c SCIP Status : problem is solved [infeasible]
23.19/23.22 c Solving Time (sec) : 22.97
23.19/23.22 c Solving Nodes : 372
23.19/23.22 c Primal Bound : +1.00000000000000e+20 (0 solutions)
23.19/23.22 c Dual Bound : +1.00000000000000e+20
23.19/23.22 c Gap : 0.00 %
23.19/23.22 c NODE 372
23.19/23.22 c DUAL BOUND 1e+20
23.19/23.22 c PRIMAL BOUND 1e+20
23.19/23.22 c GAP 0
23.19/23.22 s UNSATISFIABLE
23.19/23.22 c SCIP Status : problem is solved [infeasible]
23.19/23.22 c Solving Time : 22.97
23.19/23.22 c Original Problem :
23.19/23.22 c Problem name : HOME/instance-3730631-1338682990.opb
23.19/23.22 c Variables : 1190 (1190 binary, 0 integer, 0 implicit integer, 0 continuous)
23.19/23.22 c Constraints : 3183 initial, 3183 maximal
23.19/23.22 c Presolved Problem :
23.19/23.22 c Problem name : t_HOME/instance-3730631-1338682990.opb
23.19/23.22 c Variables : 959 (959 binary, 0 integer, 0 implicit integer, 0 continuous)
23.19/23.22 c Constraints : 2711 initial, 3155 maximal
23.19/23.22 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
23.19/23.22 c trivial : 0.00 0 0 0 0 0 0 0 0
23.19/23.22 c dualfix : 0.00 0 0 0 0 0 0 0 0
23.19/23.22 c boundshift : 0.00 0 0 0 0 0 0 0 0
23.19/23.22 c inttobinary : 0.00 0 0 0 0 0 0 0 0
23.19/23.22 c implics : 0.01 0 146 0 0 0 0 0 0
23.19/23.22 c probing : 0.00 0 0 0 0 0 0 0 0
23.19/23.22 c knapsack : 0.00 0 0 0 0 0 0 0 0
23.19/23.22 c linear : 0.02 61 24 0 61 0 472 64 136
23.19/23.22 c logicor : 0.02 0 0 0 0 0 0 0 0
23.19/23.22 c root node : - 15 - - 15 - - - -
23.19/23.22 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
23.19/23.22 c integral : 0 0 0 355 0 12 303 0 0 508
23.19/23.22 c knapsack : 112 5 7921 0 0 0 59 148 0 0
23.19/23.22 c logicor : 2599+ 5 7752 0 0 152 39606 0 0 0
23.19/23.22 c countsols : 0 0 0 0 0 0 0 0 0 0
23.19/23.22 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
23.19/23.22 c integral : 19.27 0.00 0.00 19.27 0.00
23.19/23.22 c knapsack : 0.01 0.00 0.01 0.00 0.00
23.19/23.22 c logicor : 0.09 0.00 0.09 0.00 0.00
23.19/23.22 c countsols : 0.00 0.00 0.00 0.00 0.00
23.19/23.22 c Propagators : Time Calls Cutoffs DomReds
23.19/23.22 c rootredcost : 0.00 0 0 0
23.19/23.22 c pseudoobj : 0.08 7936 0 0
23.19/23.22 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
23.19/23.22 c propagation : 0.02 152 150 583 13.7 167 6.5 -
23.19/23.22 c infeasible LP : 0.00 5 5 12 17.4 2 3.0 0
23.19/23.22 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
23.19/23.22 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
23.19/23.22 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
23.19/23.22 c applied globally : - - - 521 10.1 - - -
23.19/23.22 c applied locally : - - - 0 0.0 - - -
23.19/23.22 c Separators : Time Calls Cutoffs DomReds Cuts Conss
23.19/23.22 c cut pool : 0.00 4 - - 71 - (maximal pool size: 679)
23.19/23.22 c redcost : 0.00 281 0 0 0 0
23.19/23.22 c impliedbounds : 0.00 5 0 0 0 0
23.19/23.22 c intobj : 0.00 0 0 0 0 0
23.19/23.22 c gomory : 0.12 5 0 0 2127 0
23.19/23.22 c strongcg : 0.10 5 0 0 2500 0
23.19/23.22 c cmir : 0.00 0 0 0 0 0
23.19/23.22 c flowcover : 0.00 0 0 0 0 0
23.19/23.22 c clique : 0.01 5 0 0 29 0
23.19/23.22 c zerohalf : 0.00 0 0 0 0 0
23.19/23.22 c mcf : 0.00 1 0 0 0 0
23.19/23.22 c Pricers : Time Calls Vars
23.19/23.22 c problem variables: 0.00 0 0
23.19/23.22 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
23.19/23.22 c relpscost : 19.27 355 12 303 0 0 508
23.19/23.22 c pscost : 0.00 0 0 0 0 0 0
23.19/23.22 c inference : 0.00 0 0 0 0 0 0
23.19/23.22 c mostinf : 0.00 0 0 0 0 0 0
23.19/23.22 c leastinf : 0.00 0 0 0 0 0 0
23.19/23.22 c fullstrong : 0.00 0 0 0 0 0 0
23.19/23.22 c allfullstrong : 0.00 0 0 0 0 0 0
23.19/23.22 c random : 0.00 0 0 0 0 0 0
23.19/23.22 c Primal Heuristics : Time Calls Found
23.19/23.22 c LP solutions : 0.00 - 0
23.19/23.22 c pseudo solutions : 0.00 - 0
23.19/23.22 c simplerounding : 0.00 0 0
23.19/23.22 c rounding : 0.00 0 0
23.19/23.22 c shifting : 0.00 0 0
23.19/23.22 c intshifting : 0.00 0 0
23.19/23.22 c oneopt : 0.00 0 0
23.19/23.22 c fixandinfer : 0.00 0 0
23.19/23.22 c feaspump : 0.00 0 0
23.19/23.22 c coefdiving : 0.00 0 0
23.19/23.22 c pscostdiving : 0.00 0 0
23.19/23.22 c fracdiving : 0.00 0 0
23.19/23.22 c veclendiving : 0.00 0 0
23.19/23.22 c intdiving : 0.00 0 0
23.19/23.22 c actconsdiving : 0.00 0 0
23.19/23.22 c objpscostdiving : 0.00 0 0
23.19/23.22 c rootsoldiving : 0.00 0 0
23.19/23.22 c linesearchdiving : 0.00 0 0
23.19/23.22 c guideddiving : 0.00 0 0
23.19/23.22 c octane : 0.00 0 0
23.19/23.22 c rens : 0.00 0 0
23.19/23.22 c rins : 0.00 0 0
23.19/23.22 c localbranching : 0.00 0 0
23.19/23.22 c mutation : 0.00 0 0
23.19/23.22 c crossover : 0.00 0 0
23.19/23.22 c dins : 0.00 0 0
23.19/23.22 c LP : Time Calls Iterations Iter/call Iter/sec
23.19/23.22 c primal LP : 0.00 0 0 0.00 -
23.19/23.22 c dual LP : 3.02 364 17305 47.54 5730.13
23.19/23.22 c barrier LP : 0.00 0 0 0.00 -
23.19/23.22 c diving/probing LP: 0.00 0 0 0.00 -
23.19/23.22 c strong branching : 19.24 1643 117046 71.24 6083.47
23.19/23.22 c (at root node) : - 89 7260 81.57 -
23.19/23.22 c conflict analysis: 0.00 0 0 0.00 -
23.19/23.22 c B&B Tree :
23.19/23.22 c number of runs : 1
23.19/23.22 c nodes : 372
23.19/23.22 c nodes (total) : 372
23.19/23.22 c nodes left : 0
23.19/23.22 c max depth : 24
23.19/23.22 c max depth (total): 24
23.19/23.22 c backtracks : 75 (20.2%)
23.19/23.22 c delayed cutoffs : 137
23.19/23.22 c repropagations : 266 (6817 domain reductions, 51 cutoffs)
23.19/23.22 c avg switch length: 3.76
23.19/23.22 c switching time : 0.06
23.19/23.22 c Solution :
23.19/23.22 c Solutions found : 0 (0 improvements)
23.19/23.22 c Primal Bound : infeasible
23.19/23.22 c Dual Bound : -
23.19/23.22 c Gap : 0.00 %
23.19/23.22 c Root Dual Bound : +2.45697906998043e+02
23.19/23.23 c Time complete: 23.22.