0.29/0.37 c SCIP version 1.1.0.7
0.29/0.37 c LP-Solver SoPlex 1.4.1
0.29/0.37 c user parameter file <scip.set> not found - using default parameters
0.29/0.37 c read problem <HOME/instance-1868558-1245127761.opb>
0.29/0.37 c original problem has 8937 variables (8937 bin, 0 int, 0 impl, 0 cont) and 26319 constraints
0.39/0.48 c No objective function, only one solution is needed.
0.39/0.48 c start presolving problem
0.39/0.48 c presolving:
0.99/1.04 c (round 1) 502 del vars, 529 del conss, 230 chg bounds, 136 chg sides, 416 chg coeffs, 0 upgd conss, 691346 impls, 0 clqs
1.09/1.11 c (round 2) 615 del vars, 1458 del conss, 317 chg bounds, 136 chg sides, 416 chg coeffs, 0 upgd conss, 692636 impls, 0 clqs
1.09/1.14 c (round 3) 622 del vars, 1569 del conss, 328 chg bounds, 136 chg sides, 420 chg coeffs, 0 upgd conss, 693203 impls, 0 clqs
1.09/1.16 c (round 4) 635 del vars, 1608 del conss, 333 chg bounds, 136 chg sides, 430 chg coeffs, 0 upgd conss, 693365 impls, 0 clqs
1.39/1.40 c (round 5) 635 del vars, 1617 del conss, 333 chg bounds, 136 chg sides, 430 chg coeffs, 24702 upgd conss, 693365 impls, 0 clqs
1.39/1.48 c presolving (6 rounds):
1.39/1.48 c 635 deleted vars, 1617 deleted constraints, 333 tightened bounds, 0 added holes, 136 changed sides, 430 changed coefficients
1.39/1.48 c 693365 implications, 0 cliques
1.39/1.48 c presolved problem has 8302 variables (8302 bin, 0 int, 0 impl, 0 cont) and 24702 constraints
1.39/1.48 c 272 constraints of type <knapsack>
1.39/1.48 c 24430 constraints of type <logicor>
1.39/1.48 c transformed objective value is always integral (scale: 1)
1.39/1.48 c Presolving Time: 0.89
1.39/1.48 c SATUNSAT-LIN
1.39/1.48 c -----------------------------------------------------------------------------------------------
1.39/1.48 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 0]
1.39/1.48 c separating/flowcover/freq = c -1
1.39/1.48 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 0]
1.39/1.48 c separating/cmir/freq = c -1
1.39/1.48 c # additional number of allowed LP iterations
1.39/1.48 c # [type: int, range: [0,2147483647], default: 1000]
1.39/1.48 c heuristics/veclendiving/maxlpiterofs = c 1500
1.39/1.48 c # maximal fraction of diving LP iterations compared to node LP iterations
1.39/1.48 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.39/1.48 c heuristics/veclendiving/maxlpiterquot = c 0.075
1.39/1.48 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 10]
1.39/1.48 c heuristics/veclendiving/freq = c -1
1.39/1.48 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 1]
1.39/1.48 c heuristics/simplerounding/freq = c -1
1.39/1.48 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 10]
1.39/1.48 c heuristics/shifting/freq = c -1
1.39/1.48 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 1]
1.39/1.48 c heuristics/rounding/freq = c -1
1.39/1.48 c # additional number of allowed LP iterations
1.39/1.48 c # [type: int, range: [0,2147483647], default: 1000]
1.39/1.48 c heuristics/rootsoldiving/maxlpiterofs = c 1500
1.39/1.48 c # maximal fraction of diving LP iterations compared to node LP iterations
1.39/1.48 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.39/1.48 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
1.39/1.48 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 20]
1.39/1.48 c heuristics/rootsoldiving/freq = c -1
1.39/1.48 c # number of nodes added to the contingent of the total nodes
1.39/1.48 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.39/1.48 c heuristics/rens/nodesofs = c 2000
1.39/1.48 c # minimum percentage of integer variables that have to be fixable
1.39/1.48 c # [type: real, range: [0,1], default: 0.5]
1.39/1.48 c heuristics/rens/minfixingrate = c 0.3
1.39/1.48 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 0]
1.39/1.48 c heuristics/rens/freq = c -1
1.39/1.48 c # additional number of allowed LP iterations
1.39/1.48 c # [type: int, range: [0,2147483647], default: 1000]
1.39/1.48 c heuristics/pscostdiving/maxlpiterofs = c 1500
1.39/1.48 c # maximal fraction of diving LP iterations compared to node LP iterations
1.39/1.48 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.39/1.48 c heuristics/pscostdiving/maxlpiterquot = c 0.075
1.39/1.48 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 10]
1.39/1.48 c heuristics/pscostdiving/freq = c -1
1.39/1.48 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 1]
1.39/1.48 c heuristics/oneopt/freq = c -1
1.39/1.48 c # additional number of allowed LP iterations
1.39/1.48 c # [type: int, range: [0,2147483647], default: 1000]
1.39/1.48 c heuristics/objpscostdiving/maxlpiterofs = c 1500
1.39/1.48 c # maximal fraction of diving LP iterations compared to total iteration number
1.39/1.48 c # [type: real, range: [0,1], default: 0.01]
1.39/1.48 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
1.39/1.48 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 20]
1.39/1.48 c heuristics/objpscostdiving/freq = c -1
1.39/1.48 c # additional number of allowed LP iterations
1.39/1.48 c # [type: int, range: [0,2147483647], default: 1000]
1.39/1.48 c heuristics/linesearchdiving/maxlpiterofs = c 1500
1.39/1.48 c # maximal fraction of diving LP iterations compared to node LP iterations
1.39/1.48 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.39/1.48 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
1.39/1.48 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 10]
1.39/1.48 c heuristics/linesearchdiving/freq = c -1
1.39/1.48 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 10]
1.39/1.48 c heuristics/intshifting/freq = c -1
1.39/1.48 c # maximal fraction of diving LP iterations compared to node LP iterations
1.39/1.48 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.39/1.48 c heuristics/intdiving/maxlpiterquot = c 0.075
1.39/1.48 c # additional number of allowed LP iterations
1.39/1.48 c # [type: int, range: [0,2147483647], default: 1000]
1.39/1.48 c heuristics/guideddiving/maxlpiterofs = c 1500
1.39/1.48 c # maximal fraction of diving LP iterations compared to node LP iterations
1.39/1.48 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.39/1.48 c heuristics/guideddiving/maxlpiterquot = c 0.075
1.39/1.48 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 10]
1.39/1.48 c heuristics/guideddiving/freq = c -1
1.39/1.48 c # additional number of allowed LP iterations
1.39/1.48 c # [type: int, range: [0,2147483647], default: 1000]
1.39/1.48 c heuristics/fracdiving/maxlpiterofs = c 1500
1.39/1.48 c # maximal fraction of diving LP iterations compared to node LP iterations
1.39/1.48 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.39/1.48 c heuristics/fracdiving/maxlpiterquot = c 0.075
1.39/1.48 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 10]
1.39/1.48 c heuristics/fracdiving/freq = c -1
1.39/1.48 c # additional number of allowed LP iterations
1.39/1.48 c # [type: int, range: [0,2147483647], default: 1000]
1.39/1.48 c heuristics/feaspump/maxlpiterofs = c 2000
1.39/1.48 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 20]
1.39/1.48 c heuristics/feaspump/freq = c -1
1.39/1.48 c # minimum percentage of integer variables that have to be fixed
1.39/1.48 c # [type: real, range: [0,1], default: 0.666]
1.39/1.48 c heuristics/crossover/minfixingrate = c 0.5
1.39/1.48 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.39/1.48 c # [type: real, range: [0,1], default: 0.1]
1.39/1.48 c heuristics/crossover/nodesquot = c 0.15
1.39/1.48 c # number of nodes without incumbent change that heuristic should wait
1.39/1.48 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.39/1.48 c heuristics/crossover/nwaitingnodes = c 100
1.39/1.48 c # number of nodes added to the contingent of the total nodes
1.39/1.48 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.39/1.48 c heuristics/crossover/nodesofs = c 750
1.39/1.48 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 30]
1.39/1.48 c heuristics/crossover/freq = c -1
1.39/1.48 c # additional number of allowed LP iterations
1.39/1.48 c # [type: int, range: [0,2147483647], default: 1000]
1.39/1.48 c heuristics/coefdiving/maxlpiterofs = c 1500
1.39/1.48 c # maximal fraction of diving LP iterations compared to node LP iterations
1.39/1.48 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.39/1.48 c heuristics/coefdiving/maxlpiterquot = c 0.075
1.39/1.48 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: 10]
1.39/1.48 c heuristics/coefdiving/freq = c -1
1.39/1.48 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: -1]
1.39/1.48 c presolving/probing/maxrounds = c 0
1.39/1.48 c # should presolving try to simplify knapsacks
1.39/1.48 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.39/1.48 c constraints/knapsack/simplifyinequalities = c TRUE
1.39/1.48 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.39/1.48 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.39/1.48 c constraints/knapsack/disaggregation = c FALSE
1.39/1.48 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
1.39/1.48 c # [type: int, range: [-1,2147483647], default: -1]
1.39/1.48 c constraints/knapsack/maxnumcardlift = c 0
1.39/1.48 c # should presolving try to simplify inequalities
1.39/1.49 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.39/1.49 c constraints/linear/simplifyinequalities = c TRUE
1.39/1.49 c # maximal number of separation rounds in the root node (-1: unlimited)
1.39/1.49 c # [type: int, range: [-1,2147483647], default: -1]
1.39/1.49 c separating/maxroundsroot = c 5
1.39/1.49 c # maximal number of separation rounds per node (-1: unlimited)
1.39/1.49 c # [type: int, range: [-1,2147483647], default: 5]
1.39/1.49 c separating/maxrounds = c 1
1.39/1.49 c # solving stops, if the given number of solutions were found (-1: no limit)
1.39/1.49 c # [type: int, range: [-1,2147483647], default: -1]
1.39/1.49 c limits/solutions = c 1
1.39/1.49 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.39/1.49 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.39/1.49 c limits/memory = c 1620
1.39/1.49 c # maximal time in seconds to run
1.39/1.49 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.39/1.49 c limits/time = c 1791
1.39/1.49 c # frequency for displaying node information lines
1.39/1.49 c # [type: int, range: [-1,2147483647], default: 100]
1.39/1.49 c display/freq = c 10000
1.39/1.49 c -----------------------------------------------------------------------------------------------
1.39/1.49 c start solving problem
1.39/1.49 c
2.59/2.69 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.59/2.69 c 2.1s| 1 | 0 | 1072 | 65M| 0 | 459 |8302 | 24k| 24k|8302 | 24k| 0 | 0 | 0 | 2.678649e+02 | -- | Inf
5.29/5.39 c 4.7s| 1 | 0 | 1506 | 66M| 0 | 462 |8302 | 24k| 24k|8302 | 24k| 82 | 0 | 0 | 2.871988e+02 | -- | Inf
7.39/7.45 c 6.7s| 1 | 0 | 1974 | 66M| 0 | 483 |8302 | 24k| 24k|8302 | 24k| 139 | 0 | 0 | 2.987472e+02 | -- | Inf
12.29/12.32 c 11.6s| 1 | 0 | 2479 | 67M| 0 | 601 |8302 | 24k| 24k|8302 | 24k| 185 | 0 | 0 | 3.111362e+02 | -- | Inf
15.08/15.13 c 14.4s| 1 | 0 | 2959 | 68M| 0 | 603 |8302 | 24k| 24k|8302 | 24k| 241 | 0 | 0 | 3.155736e+02 | -- | Inf
18.08/18.15 c 17.4s| 1 | 0 | 3718 | 69M| 0 | 512 |8302 | 24k| 24k|8302 | 25k| 303 | 0 | 0 | 3.193900e+02 | -- | Inf
57.36/57.48 c 56.6s| 1 | 0 | 4405 | 62M| 0 | 557 |8302 | 20k| 20k|8302 | 25k| 303 | 0 | 20 | 3.343636e+02 | -- | Inf
100.14/100.27 c 99.3s| 1 | 2 | 4405 | 62M| 0 | 557 |8302 | 20k| 20k|8302 | 25k| 303 | 0 | 56 | 3.343636e+02 | -- | Inf
100.14/100.27 c (run 1, node 1) restarting after 2029 global fixings of integer variables
100.14/100.30 c
100.14/100.30 (restart) converted 196 cuts from the global cut pool into linear constraints
100.24/100.35 c
100.24/100.35 presolving:
100.44/100.52 c (round 1) 3457 del vars, 3270 del conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 0 upgd conss, 742265 impls, 21 clqs
100.44/100.55 c (round 2) 3469 del vars, 3315 del conss, 9 chg bounds, 0 chg sides, 4 chg coeffs, 0 upgd conss, 743178 impls, 21 clqs
100.44/100.58 c (round 3) 3487 del vars, 3370 del conss, 18 chg bounds, 2 chg sides, 4 chg coeffs, 0 upgd conss, 744841 impls, 21 clqs
100.54/100.62 c (round 4) 3496 del vars, 3370 del conss, 18 chg bounds, 2 chg sides, 4 chg coeffs, 191 upgd conss, 744841 impls, 21 clqs
100.54/100.67 c presolving (5 rounds):
100.54/100.67 c 3496 deleted vars, 3370 deleted constraints, 18 tightened bounds, 0 added holes, 2 changed sides, 17 changed coefficients
100.54/100.67 c 744841 implications, 21 cliques
100.54/100.67 c presolved problem has 4806 variables (4806 bin, 0 int, 0 impl, 0 cont) and 17265 constraints
100.54/100.67 c 315 constraints of type <knapsack>
100.54/100.67 c 21 constraints of type <setppc>
100.54/100.67 c 1 constraints of type <linear>
100.54/100.67 c 16928 constraints of type <logicor>
100.54/100.67 c transformed objective value is always integral (scale: 1)
100.54/100.67 c Presolving Time: 1.18
100.54/100.68 c
102.04/102.20 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
102.04/102.20 c 101s| 1 | 0 | 5876 | 52M| 0 | 463 |4806 | 17k| 17k|4806 | 14k| 0 | 0 | 56 | 3.347595e+02 | -- | Inf
103.74/103.89 c 103s| 1 | 0 | 6341 | 53M| 0 | 469 |4806 | 17k| 17k|4806 | 14k| 51 | 0 | 56 | 3.397784e+02 | -- | Inf
117.13/117.30 c 116s| 1 | 2 | 6341 | 53M| 0 | 469 |4806 | 17k| 17k|4806 | 14k| 51 | 0 | 73 | 3.397784e+02 | -- | Inf
178.61/178.72 c
178.61/178.72 c SCIP Status : problem is solved [infeasible]
178.61/178.72 c Solving Time (sec) : 177.48
178.61/178.72 c Solving Nodes : 9 (total of 10 nodes in 2 runs)
178.61/178.72 c Primal Bound : +1.00000000000000e+20 (0 solutions)
178.61/178.72 c Dual Bound : +1.00000000000000e+20
178.61/178.72 c Gap : 0.00 %
178.61/178.72 c NODE 9
178.61/178.72 c DUAL BOUND 1e+20
178.61/178.72 c PRIMAL BOUND 1e+20
178.61/178.72 c GAP 0
178.61/178.72 s UNSATISFIABLE
178.61/178.72 c SCIP Status : problem is solved [infeasible]
178.61/178.72 c Solving Time : 177.48
178.61/178.72 c Original Problem :
178.61/178.72 c Problem name : HOME/instance-1868558-1245127761.opb
178.61/178.72 c Variables : 8937 (8937 binary, 0 integer, 0 implicit integer, 0 continuous)
178.61/178.72 c Constraints : 26319 initial, 26319 maximal
178.61/178.72 c Presolved Problem :
178.61/178.72 c Problem name : t_HOME/instance-1868558-1245127761.opb
178.61/178.72 c Variables : 4806 (4806 binary, 0 integer, 0 implicit integer, 0 continuous)
178.61/178.72 c Constraints : 17265 initial, 17266 maximal
178.61/178.72 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
178.61/178.72 c trivial : 0.03 2083 0 0 0 0 0 0 0
178.61/178.72 c dualfix : 0.02 0 0 0 0 0 0 0 0
178.61/178.72 c boundshift : 0.00 0 0 0 0 0 0 0 0
178.61/178.72 c inttobinary : 0.00 0 0 0 0 0 0 0 0
178.61/178.72 c implics : 0.19 0 1725 0 0 0 0 0 0
178.61/178.72 c probing : 0.00 0 0 0 0 0 0 0 0
178.61/178.72 c knapsack : 0.05 0 0 0 0 0 0 0 13
178.61/178.72 c setppc : 0.00 0 0 0 0 0 0 0 0
178.61/178.72 c linear : 0.59 321 0 0 333 0 1621 138 434
178.61/178.72 c logicor : 0.22 2 0 0 18 0 3366 0 0
178.61/178.72 c root node : - 3727 - - 3727 - - - -
178.61/178.72 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
178.61/178.72 c integral : 0 0 0 12 0 3 12 0 0 10
178.61/178.72 c knapsack : 315 6 270 0 0 0 0 619 0 0
178.61/178.72 c setppc : 21 1 227 0 0 0 44 0 0 0
178.61/178.72 c linear : 1 1 227 0 0 0 0 0 0 0
178.61/178.72 c logicor : 16928+ 6 265 0 0 2 6843 0 0 0
178.61/178.72 c countsols : 0 0 0 0 0 0 0 0 0 0
178.61/178.72 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
178.61/178.72 c integral : 150.10 0.00 0.00 150.10 0.00
178.61/178.72 c knapsack : 0.05 0.03 0.02 0.00 0.00
178.61/178.72 c setppc : 0.00 0.00 0.00 0.00 0.00
178.61/178.72 c linear : 0.00 0.00 0.00 0.00 0.00
178.61/178.72 c logicor : 0.38 0.00 0.38 0.00 0.00
178.61/178.72 c countsols : 0.00 0.00 0.00 0.00 0.00
178.61/178.72 c Propagators : Time Calls Cutoffs DomReds
178.61/178.72 c rootredcost : 0.00 0 0 0
178.61/178.72 c pseudoobj : 0.19 284 0 0
178.61/178.72 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
178.61/178.72 c propagation : 0.00 2 1 1 1.0 0 0.0 -
178.61/178.72 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
178.61/178.72 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
178.61/178.72 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
178.61/178.72 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
178.61/178.72 c applied globally : - - - 1 1.0 - - -
178.61/178.72 c applied locally : - - - 0 0.0 - - -
178.61/178.72 c Separators : Time Calls Cutoffs DomReds Cuts Conss
178.61/178.72 c cut pool : 0.00 0 - - 0 - (maximal pool size: 481)
178.61/178.72 c redcost : 0.01 12 0 0 0 0
178.61/178.72 c impliedbounds : 0.02 6 0 0 0 0
178.61/178.72 c intobj : 0.00 0 0 0 0 0
178.61/178.72 c gomory : 4.69 6 0 0 3000 0
178.61/178.72 c strongcg : 2.13 6 0 0 3000 0
178.61/178.72 c cmir : 0.00 0 0 0 0 0
178.61/178.72 c flowcover : 0.00 0 0 0 0 0
178.61/178.72 c clique : 1.05 6 0 0 38 0
178.61/178.72 c zerohalf : 0.00 0 0 0 0 0
178.61/178.72 c mcf : 0.31 2 0 0 0 0
178.61/178.72 c Pricers : Time Calls Vars
178.61/178.72 c problem variables: 0.00 0 0
178.61/178.72 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
178.61/178.72 c relpscost : 150.10 12 3 12 0 0 10
178.61/178.72 c pscost : 0.00 0 0 0 0 0 0
178.61/178.72 c inference : 0.00 0 0 0 0 0 0
178.61/178.72 c mostinf : 0.00 0 0 0 0 0 0
178.61/178.72 c leastinf : 0.00 0 0 0 0 0 0
178.61/178.72 c fullstrong : 0.00 0 0 0 0 0 0
178.61/178.72 c allfullstrong : 0.00 0 0 0 0 0 0
178.61/178.72 c random : 0.00 0 0 0 0 0 0
178.61/178.72 c Primal Heuristics : Time Calls Found
178.61/178.72 c LP solutions : 0.00 - 0
178.61/178.72 c pseudo solutions : 0.00 - 0
178.61/178.72 c simplerounding : 0.00 0 0
178.61/178.72 c rounding : 0.00 0 0
178.61/178.72 c shifting : 0.00 0 0
178.61/178.72 c intshifting : 0.00 0 0
178.61/178.73 c oneopt : 0.00 0 0
178.61/178.73 c fixandinfer : 0.00 0 0
178.61/178.73 c feaspump : 0.00 0 0
178.61/178.73 c coefdiving : 0.00 0 0
178.61/178.73 c pscostdiving : 0.00 0 0
178.61/178.73 c fracdiving : 0.00 0 0
178.61/178.73 c veclendiving : 0.00 0 0
178.61/178.73 c intdiving : 0.00 0 0
178.61/178.73 c actconsdiving : 0.00 0 0
178.61/178.73 c objpscostdiving : 0.00 0 0
178.61/178.73 c rootsoldiving : 0.00 0 0
178.61/178.73 c linesearchdiving : 0.00 0 0
178.61/178.73 c guideddiving : 0.00 0 0
178.61/178.73 c octane : 0.00 0 0
178.61/178.73 c rens : 0.00 0 0
178.61/178.73 c rins : 0.00 0 0
178.61/178.73 c localbranching : 0.00 0 0
178.61/178.73 c mutation : 0.00 0 0
178.61/178.73 c crossover : 0.00 0 0
178.61/178.73 c dins : 0.00 0 0
178.61/178.73 c LP : Time Calls Iterations Iter/call Iter/sec
178.61/178.73 c primal LP : 0.03 0 0 0.00 0.00
178.61/178.73 c dual LP : 16.79 18 8551 475.06 509.29
178.61/178.73 c barrier LP : 0.00 0 0 0.00 -
178.61/178.73 c diving/probing LP: 0.00 0 0 0.00 -
178.61/178.73 c strong branching : 150.08 208 71736 344.88 477.99
178.61/178.73 c (at root node) : - 73 33127 453.79 -
178.61/178.73 c conflict analysis: 0.00 0 0 0.00 -
178.61/178.73 c B&B Tree :
178.61/178.73 c number of runs : 2
178.61/178.73 c nodes : 9
178.61/178.73 c nodes (total) : 10
178.61/178.73 c nodes left : 0
178.61/178.73 c max depth : 4
178.61/178.73 c max depth (total): 4
178.61/178.73 c backtracks : 0 (0.0%)
178.61/178.73 c delayed cutoffs : 0
178.61/178.73 c repropagations : 4 (726 domain reductions, 0 cutoffs)
178.61/178.73 c avg switch length: 3.11
178.61/178.73 c switching time : 0.04
178.61/178.73 c Solution :
178.61/178.73 c Solutions found : 0 (0 improvements)
178.61/178.73 c Primal Bound : infeasible
178.61/178.73 c Dual Bound : -
178.61/178.73 c Gap : 0.00 %
178.61/178.73 c Root Dual Bound : +3.39778360379669e+02
178.71/178.86 c Time complete: 178.77.