0.04/0.06 c SCIP version 1.1.0.7
0.04/0.06 c LP-Solver Clp 1.8.2
0.04/0.06 c user parameter file <scip.set> not found - using default parameters
0.04/0.06 c read problem <HOME/instance-1868583-1245128626.opb>
0.04/0.06 c original problem has 1190 variables (1190 bin, 0 int, 0 impl, 0 cont) and 3183 constraints
0.04/0.07 c No objective function, only one solution is needed.
0.04/0.07 c start presolving problem
0.04/0.07 c presolving:
0.09/0.12 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.09/0.13 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.09/0.14 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.09/0.14 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.09/0.14 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.09/0.15 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.09/0.15 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.09/0.15 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.09/0.16 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.09/0.16 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.09/0.17 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.09/0.17 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.09/0.17 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.09/0.18 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.09/0.18 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.09/0.18 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.09/0.19 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.09/0.19 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.09/0.19 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.19/0.24 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.19/0.26 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.19/0.27 c presolving (22 rounds):
0.19/0.27 c 231 deleted vars, 472 deleted constraints, 61 tightened bounds, 0 added holes, 64 changed sides, 136 changed coefficients
0.19/0.27 c 61522 implications, 0 cliques
0.19/0.27 c presolved problem has 959 variables (959 bin, 0 int, 0 impl, 0 cont) and 2711 constraints
0.19/0.27 c 112 constraints of type <knapsack>
0.19/0.27 c 2599 constraints of type <logicor>
0.19/0.27 c transformed objective value is always integral (scale: 1)
0.19/0.27 c Presolving Time: 0.17
0.19/0.27 c SATUNSAT-LIN
0.19/0.27 c -----------------------------------------------------------------------------------------------
0.19/0.27 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.27 c separating/flowcover/freq = c -1
0.19/0.27 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.27 c separating/cmir/freq = c -1
0.19/0.27 c # additional number of allowed LP iterations
0.19/0.27 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.27 c heuristics/veclendiving/maxlpiterofs = c 1500
0.19/0.27 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.27 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.19/0.27 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.27 c heuristics/veclendiving/freq = c -1
0.19/0.27 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.27 c heuristics/simplerounding/freq = c -1
0.19/0.27 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.27 c heuristics/shifting/freq = c -1
0.19/0.27 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.27 c heuristics/rounding/freq = c -1
0.19/0.27 c # additional number of allowed LP iterations
0.19/0.27 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.27 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.19/0.27 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.27 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.19/0.27 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.27 c heuristics/rootsoldiving/freq = c -1
0.19/0.27 c # number of nodes added to the contingent of the total nodes
0.19/0.27 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.27 c heuristics/rens/nodesofs = c 2000
0.19/0.27 c # minimum percentage of integer variables that have to be fixable
0.19/0.27 c # [type: real, range: [0,1], default: 0.5]
0.19/0.27 c heuristics/rens/minfixingrate = c 0.3
0.19/0.27 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.27 c heuristics/rens/freq = c -1
0.19/0.27 c # additional number of allowed LP iterations
0.19/0.27 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.27 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.19/0.27 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.27 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.19/0.27 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.27 c heuristics/pscostdiving/freq = c -1
0.19/0.27 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.27 c heuristics/oneopt/freq = c -1
0.19/0.27 c # additional number of allowed LP iterations
0.19/0.27 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.27 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.19/0.27 c # maximal fraction of diving LP iterations compared to total iteration number
0.19/0.27 c # [type: real, range: [0,1], default: 0.01]
0.19/0.27 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.19/0.27 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.27 c heuristics/objpscostdiving/freq = c -1
0.19/0.27 c # additional number of allowed LP iterations
0.19/0.27 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.27 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.19/0.27 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.27 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.19/0.27 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.27 c heuristics/linesearchdiving/freq = c -1
0.19/0.27 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.27 c heuristics/intshifting/freq = c -1
0.19/0.27 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.27 c heuristics/intdiving/maxlpiterquot = c 0.075
0.19/0.27 c # additional number of allowed LP iterations
0.19/0.27 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.27 c heuristics/guideddiving/maxlpiterofs = c 1500
0.19/0.27 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.27 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.19/0.27 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.27 c heuristics/guideddiving/freq = c -1
0.19/0.27 c # additional number of allowed LP iterations
0.19/0.27 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.27 c heuristics/fracdiving/maxlpiterofs = c 1500
0.19/0.27 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.27 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.19/0.27 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.27 c heuristics/fracdiving/freq = c -1
0.19/0.27 c # additional number of allowed LP iterations
0.19/0.27 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.27 c heuristics/feaspump/maxlpiterofs = c 2000
0.19/0.27 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.27 c heuristics/feaspump/freq = c -1
0.19/0.27 c # minimum percentage of integer variables that have to be fixed
0.19/0.27 c # [type: real, range: [0,1], default: 0.666]
0.19/0.27 c heuristics/crossover/minfixingrate = c 0.5
0.19/0.27 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.19/0.27 c # [type: real, range: [0,1], default: 0.1]
0.19/0.27 c heuristics/crossover/nodesquot = c 0.15
0.19/0.27 c # number of nodes without incumbent change that heuristic should wait
0.19/0.27 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.19/0.27 c heuristics/crossover/nwaitingnodes = c 100
0.19/0.27 c # number of nodes added to the contingent of the total nodes
0.19/0.27 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.27 c heuristics/crossover/nodesofs = c 750
0.19/0.27 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 30]
0.19/0.27 c heuristics/crossover/freq = c -1
0.19/0.27 c # additional number of allowed LP iterations
0.19/0.27 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.27 c heuristics/coefdiving/maxlpiterofs = c 1500
0.19/0.27 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.27 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.19/0.27 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.27 c heuristics/coefdiving/freq = c -1
0.19/0.27 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.27 c presolving/probing/maxrounds = c 0
0.19/0.27 c # should presolving try to simplify knapsacks
0.19/0.27 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.27 c constraints/knapsack/simplifyinequalities = c TRUE
0.19/0.27 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.19/0.27 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.19/0.27 c constraints/knapsack/disaggregation = c FALSE
0.19/0.27 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.27 c constraints/knapsack/maxnumcardlift = c 0
0.19/0.27 c # should presolving try to simplify inequalities
0.19/0.27 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.27 c constraints/linear/simplifyinequalities = c TRUE
0.19/0.27 c # maximal number of separation rounds in the root node (-1: unlimited)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.27 c separating/maxroundsroot = c 5
0.19/0.27 c # maximal number of separation rounds per node (-1: unlimited)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 5]
0.19/0.27 c separating/maxrounds = c 1
0.19/0.27 c # solving stops, if the given number of solutions were found (-1: no limit)
0.19/0.27 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.27 c limits/solutions = c 1
0.19/0.27 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.27 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.27 c limits/memory = c 1620
0.19/0.27 c # maximal time in seconds to run
0.19/0.27 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.27 c limits/time = c 1791
0.19/0.27 c # frequency for displaying node information lines
0.19/0.27 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.27 c display/freq = c 10000
0.19/0.27 c -----------------------------------------------------------------------------------------------
0.19/0.27 c start solving problem
0.19/0.27 c
0.29/0.31 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.31 c 0.2s| 1 | 0 | 297 |7432k| 0 | 152 | 959 |2711 |2711 | 959 |2711 | 0 | 0 | 0 | 1.962453e+02 | -- | Inf
0.39/0.44 c 0.3s| 1 | 0 | 370 |7525k| 0 | 156 | 959 |2711 |2711 | 959 |2747 | 36 | 0 | 0 | 2.076786e+02 | -- | Inf
0.49/0.55 c 0.4s| 1 | 0 | 514 |7609k| 0 | 204 | 959 |2711 |2711 | 959 |2783 | 72 | 0 | 0 | 2.165352e+02 | -- | Inf
0.59/0.68 c 0.6s| 1 | 0 | 646 |7703k| 0 | 180 | 959 |2711 |2711 | 959 |2719 | 290 | 0 | 0 | 2.402838e+02 | -- | Inf
0.79/0.86 c 0.7s| 1 | 0 | 801 |7813k| 0 | 202 | 959 |2711 |2711 | 959 |2745 | 316 | 0 | 0 | 2.458818e+02 | -- | Inf
1.00/1.08 c 0.9s| 1 | 0 | 910 |7973k| 0 | 201 | 959 |2711 |2711 | 959 |2764 | 335 | 0 | 0 | 2.466103e+02 | -- | Inf
1.10/1.17 c 1.0s| 1 | 0 | 911 |7971k| 0 | 197 | 959 |2709 |2709 | 959 |2764 | 335 | 0 | 19 | 2.466103e+02 | -- | Inf
1.99/2.09 c 1.9s| 1 | 0 | 916 |7967k| 0 | 203 | 959 |2702 |2702 | 959 |2764 | 335 | 0 | 47 | 2.468103e+02 | -- | Inf
2.69/2.73 c 2.6s| 1 | 2 | 916 |7967k| 0 | 203 | 959 |2702 |2702 | 959 |2764 | 335 | 0 | 63 | 2.468103e+02 | -- | Inf
39.67/39.76 c
39.67/39.76 c SCIP Status : problem is solved [infeasible]
39.67/39.76 c Solving Time (sec) : 39.18
39.67/39.76 c Solving Nodes : 987
39.67/39.76 c Primal Bound : +1.00000000000000e+20 (0 solutions)
39.67/39.76 c Dual Bound : +1.00000000000000e+20
39.67/39.76 c Gap : 0.00 %
39.67/39.76 c NODE 987
39.67/39.76 c DUAL BOUND 1e+20
39.67/39.76 c PRIMAL BOUND 1e+20
39.67/39.76 c GAP 0
39.67/39.76 s UNSATISFIABLE
39.67/39.76 c SCIP Status : problem is solved [infeasible]
39.67/39.76 c Solving Time : 39.18
39.67/39.76 c Original Problem :
39.67/39.76 c Problem name : HOME/instance-1868583-1245128626.opb
39.67/39.76 c Variables : 1190 (1190 binary, 0 integer, 0 implicit integer, 0 continuous)
39.67/39.76 c Constraints : 3183 initial, 3183 maximal
39.67/39.76 c Presolved Problem :
39.67/39.76 c Problem name : t_HOME/instance-1868583-1245128626.opb
39.67/39.76 c Variables : 959 (959 binary, 0 integer, 0 implicit integer, 0 continuous)
39.67/39.76 c Constraints : 2711 initial, 2973 maximal
39.67/39.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
39.67/39.76 c trivial : 0.00 0 0 0 0 0 0 0 0
39.67/39.76 c dualfix : 0.00 0 0 0 0 0 0 0 0
39.67/39.76 c boundshift : 0.00 0 0 0 0 0 0 0 0
39.67/39.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0
39.67/39.76 c implics : 0.01 0 146 0 0 0 0 0 0
39.67/39.76 c probing : 0.00 0 0 0 0 0 0 0 0
39.67/39.76 c knapsack : 0.00 0 0 0 0 0 0 0 0
39.67/39.76 c linear : 0.11 61 24 0 61 0 472 64 136
39.67/39.76 c logicor : 0.04 0 0 0 0 0 0 0 0
39.67/39.76 c root node : - 7 - - 7 - - - -
39.67/39.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
39.67/39.76 c integral : 0 0 0 638 0 16 311 0 0 1066
39.67/39.77 c knapsack : 112 5 18103 0 0 4 174 146 0 0
39.67/39.77 c logicor : 2599+ 5 17863 0 0 130 107815 0 0 0
39.67/39.77 c countsols : 0 0 0 0 0 0 0 0 0 0
39.67/39.77 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
39.67/39.77 c integral : 25.94 0.00 0.00 25.94 0.00
39.67/39.77 c knapsack : 0.06 0.00 0.06 0.00 0.00
39.67/39.77 c logicor : 0.54 0.00 0.54 0.00 0.00
39.67/39.77 c countsols : 0.00 0.00 0.00 0.00 0.00
39.67/39.77 c Propagators : Time Calls Cutoffs DomReds
39.67/39.77 c rootredcost : 0.00 0 0 0
39.67/39.77 c pseudoobj : 0.61 18133 0 0
39.67/39.77 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
39.67/39.77 c propagation : 0.04 134 134 344 8.8 111 6.1 -
39.67/39.77 c infeasible LP : 0.07 346 0 0 0.0 0 0.0 0
39.67/39.77 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
39.67/39.77 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
39.67/39.77 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
39.67/39.77 c applied globally : - - - 348 7.2 - - -
39.67/39.77 c applied locally : - - - 0 0.0 - - -
39.67/39.77 c Separators : Time Calls Cutoffs DomReds Cuts Conss
39.67/39.77 c cut pool : 0.00 4 - - 76 - (maximal pool size: 747)
39.67/39.77 c redcost : 0.02 561 0 0 0 0
39.67/39.77 c impliedbounds : 0.00 5 0 0 0 0
39.67/39.77 c intobj : 0.00 0 0 0 0 0
39.67/39.77 c gomory : 0.32 5 0 0 2407 0
39.67/39.77 c strongcg : 0.20 5 0 0 2500 0
39.67/39.77 c cmir : 0.00 0 0 0 0 0
39.67/39.77 c flowcover : 0.00 0 0 0 0 0
39.67/39.77 c clique : 0.03 5 0 0 31 0
39.67/39.77 c zerohalf : 0.00 0 0 0 0 0
39.67/39.77 c mcf : 0.00 1 0 0 0 0
39.67/39.77 c Pricers : Time Calls Vars
39.67/39.77 c problem variables: 0.00 0 0
39.67/39.77 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
39.67/39.77 c relpscost : 25.94 638 16 311 0 0 1066
39.67/39.77 c pscost : 0.00 0 0 0 0 0 0
39.67/39.77 c inference : 0.00 0 0 0 0 0 0
39.67/39.77 c mostinf : 0.00 0 0 0 0 0 0
39.67/39.77 c leastinf : 0.00 0 0 0 0 0 0
39.67/39.77 c fullstrong : 0.00 0 0 0 0 0 0
39.67/39.77 c allfullstrong : 0.00 0 0 0 0 0 0
39.67/39.77 c random : 0.00 0 0 0 0 0 0
39.67/39.77 c Primal Heuristics : Time Calls Found
39.67/39.77 c LP solutions : 0.00 - 0
39.67/39.77 c pseudo solutions : 0.00 - 0
39.67/39.77 c simplerounding : 0.00 0 0
39.67/39.77 c rounding : 0.00 0 0
39.67/39.77 c shifting : 0.00 0 0
39.67/39.77 c intshifting : 0.00 0 0
39.67/39.77 c oneopt : 0.00 0 0
39.67/39.77 c fixandinfer : 0.00 0 0
39.67/39.77 c feaspump : 0.00 0 0
39.67/39.77 c coefdiving : 0.00 0 0
39.67/39.77 c pscostdiving : 0.00 0 0
39.67/39.77 c fracdiving : 0.00 0 0
39.67/39.77 c veclendiving : 0.00 0 0
39.67/39.77 c intdiving : 0.00 0 0
39.67/39.77 c actconsdiving : 0.00 0 0
39.67/39.77 c objpscostdiving : 0.00 0 0
39.67/39.77 c rootsoldiving : 0.00 0 0
39.67/39.77 c linesearchdiving : 0.00 0 0
39.67/39.77 c guideddiving : 0.00 0 0
39.67/39.77 c octane : 0.00 0 0
39.67/39.77 c rens : 0.00 0 0
39.67/39.77 c rins : 0.00 0 0
39.67/39.77 c localbranching : 0.00 0 0
39.67/39.77 c mutation : 0.00 0 0
39.67/39.77 c crossover : 0.00 0 0
39.67/39.77 c dins : 0.00 0 0
39.67/39.77 c LP : Time Calls Iterations Iter/call Iter/sec
39.67/39.77 c primal LP : 0.02 0 0 0.00 0.00
39.67/39.77 c dual LP : 9.78 890 37225 41.83 3806.24
39.67/39.77 c barrier LP : 0.00 0 0 0.00 -
39.67/39.77 c diving/probing LP: 0.00 0 0 0.00 -
39.67/39.77 c strong branching : 25.92 1573 124351 79.05 4797.49
39.67/39.77 c (at root node) : - 63 5668 89.97 -
39.67/39.77 c conflict analysis: 0.00 0 0 0.00 -
39.67/39.77 c B&B Tree :
39.67/39.77 c number of runs : 1
39.67/39.77 c nodes : 987
39.67/39.77 c nodes (total) : 987
39.67/39.77 c nodes left : 0
39.67/39.77 c max depth : 24
39.67/39.77 c max depth (total): 24
39.67/39.77 c backtracks : 221 (22.4%)
39.67/39.77 c delayed cutoffs : 80
39.67/39.77 c repropagations : 381 (9546 domain reductions, 42 cutoffs)
39.67/39.77 c avg switch length: 4.46
39.67/39.77 c switching time : 0.57
39.67/39.77 c Solution :
39.67/39.77 c Solutions found : 0 (0 improvements)
39.67/39.77 c Primal Bound : infeasible
39.67/39.77 c Dual Bound : -
39.67/39.77 c Gap : 0.00 %
39.67/39.77 c Root Dual Bound : +2.46810271301363e+02
39.67/39.79 c Time complete: 39.76.