0.09/0.18 c SCIP version 1.1.0.7
0.09/0.18 c LP-Solver SoPlex 1.4.1
0.09/0.18 c user parameter file <scip.set> not found - using default parameters
0.09/0.18 c read problem <HOME/instance-1884687-1245260079.opb>
0.09/0.18 c original problem has 1960 variables (1960 bin, 0 int, 0 impl, 0 cont) and 11270 constraints
0.19/0.22 c No objective function, only one solution is needed.
0.19/0.22 c start presolving problem
0.19/0.22 c presolving:
0.19/0.28 c (round 1) 412 del vars, 97 del conss, 40 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 11832 impls, 0 clqs
0.29/0.31 c (round 2) 412 del vars, 1254 del conss, 40 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 11832 impls, 0 clqs
0.39/0.41 c (round 3) 412 del vars, 1559 del conss, 40 chg bounds, 0 chg sides, 30 chg coeffs, 9711 upgd conss, 11832 impls, 0 clqs
0.39/0.43 c presolving (4 rounds):
0.39/0.43 c 412 deleted vars, 1559 deleted constraints, 40 tightened bounds, 0 added holes, 0 changed sides, 30 changed coefficients
0.39/0.43 c 11832 implications, 0 cliques
0.39/0.43 c presolved problem has 1548 variables (1548 bin, 0 int, 0 impl, 0 cont) and 9711 constraints
0.39/0.43 c 9711 constraints of type <logicor>
0.39/0.43 c transformed objective value is always integral (scale: 1)
0.39/0.43 c Presolving Time: 0.17
0.39/0.43 c PURESAT
0.39/0.43 c -----------------------------------------------------------------------------------------------
0.39/0.43 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/flowcover/freq = c -1
0.39/0.43 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/cmir/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/veclendiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/veclendiving/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/simplerounding/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/shifting/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/rounding/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.43 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.39/0.43 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/rootsoldiving/freq = c -1
0.39/0.43 c # number of nodes added to the contingent of the total nodes
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.43 c heuristics/rens/nodesofs = c 2000
0.39/0.43 c # minimum percentage of integer variables that have to be fixable
0.39/0.43 c # [type: real, range: [0,1], default: 0.5]
0.39/0.43 c heuristics/rens/minfixingrate = c 0.3
0.39/0.43 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c heuristics/rens/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/pscostdiving/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/oneopt/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.43 c # [type: real, range: [0,1], default: 0.01]
0.39/0.43 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.39/0.43 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/objpscostdiving/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/linesearchdiving/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/intshifting/freq = c -1
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/intdiving/maxlpiterquot = c 0.075
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/guideddiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/guideddiving/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/fracdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/fracdiving/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/feaspump/maxlpiterofs = c 2000
0.39/0.43 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/feaspump/freq = c -1
0.39/0.43 c # minimum percentage of integer variables that have to be fixed
0.39/0.43 c # [type: real, range: [0,1], default: 0.666]
0.39/0.43 c heuristics/crossover/minfixingrate = c 0.5
0.39/0.43 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.43 c # [type: real, range: [0,1], default: 0.1]
0.39/0.43 c heuristics/crossover/nodesquot = c 0.15
0.39/0.43 c # number of nodes without incumbent change that heuristic should wait
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.43 c heuristics/crossover/nwaitingnodes = c 100
0.39/0.43 c # number of nodes added to the contingent of the total nodes
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.43 c heuristics/crossover/nodesofs = c 750
0.39/0.43 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.43 c heuristics/crossover/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/coefdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/coefdiving/freq = c -1
0.39/0.43 c # priority of node selection rule <dfs> in standard mode
0.39/0.43 c # [type: int, range: [-536870912,536870911], default: 0]
0.39/0.43 c nodeselection/dfs/stdpriority = c 1000000
0.39/0.43 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c presolving/probing/maxrounds = c 0
0.39/0.43 c # should presolving try to simplify knapsacks
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/knapsack/simplifyinequalities = c TRUE
0.39/0.43 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.43 c constraints/knapsack/disaggregation = c FALSE
0.39/0.43 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c constraints/knapsack/maxnumcardlift = c 0
0.39/0.43 c # should presolving try to simplify inequalities
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/linear/simplifyinequalities = c TRUE
0.39/0.43 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c separating/maxroundsroot = c 5
0.39/0.43 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.43 c separating/maxrounds = c 1
0.39/0.43 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.39/0.43 c # [type: char, range: {lafpsqd}, default: l]
0.39/0.43 c lp/pricing = c a
0.39/0.43 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c lp/solvefreq = c 0
0.39/0.43 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c limits/solutions = c 1
0.39/0.43 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.43 c limits/memory = c 1620
0.39/0.43 c # maximal time in seconds to run
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.43 c limits/time = c 1791
0.39/0.43 c # frequency for displaying node information lines
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.43 c display/freq = c 10000
0.39/0.43 c # should enforcement of pseudo solution be disabled?
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/disableenfops = c TRUE
0.39/0.43 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c constraints/agelimit = c 1
0.39/0.43 c # should binary conflicts be preferred?
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c conflict/preferbinary = c TRUE
0.39/0.43 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c conflict/interconss = c 0
0.39/0.43 c -----------------------------------------------------------------------------------------------
0.39/0.43 c start solving problem
0.39/0.43 c
2.00/2.01 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.00/2.01 c 1.8s| 1 | 0 | 1675 | 16M| 0 | 586 |1548 |9711 |9711 |1548 |9711 | 0 | 0 | 0 | 1.887917e+02 | -- | Inf
2.69/2.79 c 2.5s| 1 | 0 | 1999 | 16M| 0 | 624 |1548 |9711 |9711 |1548 |9726 | 15 | 0 | 0 | 1.921288e+02 | -- | Inf
3.59/3.67 c 3.4s| 1 | 0 | 2365 | 17M| 0 | 656 |1548 |9711 |9711 |1548 |9742 | 31 | 0 | 0 | 1.960782e+02 | -- | Inf
4.49/4.50 c 4.2s| 1 | 0 | 2668 | 18M| 0 | 652 |1548 |9711 |9711 |1548 |9759 | 48 | 0 | 0 | 1.974554e+02 | -- | Inf
5.59/5.62 c 5.3s| 1 | 0 | 3080 | 18M| 0 | 673 |1548 |9711 |9711 |1548 |9778 | 67 | 0 | 0 | 1.997049e+02 | -- | Inf
6.79/6.87 c 6.6s| 1 | 0 | 3549 | 19M| 0 | 710 |1548 |9711 |9711 |1548 |9798 | 87 | 0 | 0 | 2.022350e+02 | -- | Inf
34.78/34.82 c 34.5s| 1 | 2 | 3549 | 19M| 0 | 710 |1548 |9711 |9711 |1548 |9798 | 87 | 0 | 18 | 2.022350e+02 | -- | Inf
55.27/55.31 c 54.6s| 10000 | 20 | 3549 | 20M| 72 | - |1548 | 10k|6276 | 0 | 0 | 87 |8615 | 18 | 2.117711e+02 | -- | Inf
75.87/75.96 c 74.9s| 20000 | 17 | 3549 | 20M| 72 | - |1548 |9776 |8285 | 0 | 0 | 87 | 17k| 18 | 2.117711e+02 | -- | Inf
97.25/97.32 c 95.9s| 30000 | 13 | 3549 | 20M| 72 | - |1548 | 10k|6034 | 0 | 0 | 87 | 25k| 18 | 2.117711e+02 | -- | Inf
119.15/119.21 c 117s| 40000 | 14 | 3549 | 20M| 72 | - |1548 | 11k|5179 | 0 | 0 | 87 | 34k| 18 | 2.117711e+02 | -- | Inf
139.35/139.40 c 137s| 50000 | 19 | 3549 | 21M| 72 | - |1548 | 12k|6753 | 0 | 0 | 87 | 43k| 18 | 2.117711e+02 | -- | Inf
160.84/160.98 c 158s| 60000 | 29 | 3549 | 21M| 72 | - |1548 | 14k|5437 | 0 | 0 | 87 | 52k| 18 | 2.117711e+02 | -- | Inf
180.53/180.69 c 178s| 70000 | 17 | 3549 | 21M| 72 | - |1548 | 14k|6641 | 0 | 0 | 87 | 60k| 18 | 2.117711e+02 | -- | Inf
200.82/200.99 c 198s| 80000 | 14 | 3549 | 21M| 72 | - |1548 | 14k|8089 | 0 | 0 | 87 | 67k| 18 | 2.117711e+02 | -- | Inf
214.12/214.28 c
214.12/214.28 c SCIP Status : problem is solved [infeasible]
214.12/214.28 c Solving Time (sec) : 210.83
214.12/214.28 c Solving Nodes : 86118
214.12/214.28 c Primal Bound : +1.00000000000000e+20 (0 solutions)
214.12/214.28 c Dual Bound : +1.00000000000000e+20
214.12/214.28 c Gap : 0.00 %
214.12/214.28 c NODE 86118
214.12/214.28 c DUAL BOUND 1e+20
214.12/214.28 c PRIMAL BOUND 1e+20
214.12/214.28 c GAP 0
214.12/214.28 s UNSATISFIABLE
214.12/214.28 c SCIP Status : problem is solved [infeasible]
214.12/214.28 c Solving Time : 210.83
214.12/214.28 c Original Problem :
214.12/214.28 c Problem name : HOME/instance-1884687-1245260079.opb
214.12/214.28 c Variables : 1960 (1960 binary, 0 integer, 0 implicit integer, 0 continuous)
214.12/214.28 c Constraints : 11270 initial, 11270 maximal
214.12/214.28 c Presolved Problem :
214.12/214.28 c Problem name : t_HOME/instance-1884687-1245260079.opb
214.12/214.28 c Variables : 1548 (1548 binary, 0 integer, 0 implicit integer, 0 continuous)
214.12/214.28 c Constraints : 9711 initial, 14255 maximal
214.12/214.28 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
214.12/214.28 c trivial : 0.00 0 0 0 0 0 0 0 0
214.12/214.28 c dualfix : 0.00 0 0 0 0 0 0 0 0
214.12/214.28 c boundshift : 0.00 0 0 0 0 0 0 0 0
214.12/214.28 c inttobinary : 0.00 0 0 0 0 0 0 0 0
214.12/214.28 c implics : 0.01 0 351 0 0 0 0 0 0
214.12/214.28 c probing : 0.00 0 0 0 0 0 0 0 0
214.12/214.28 c linear : 0.11 40 21 0 40 0 1559 0 30
214.12/214.28 c logicor : 0.04 0 0 0 0 0 0 0 0
214.12/214.28 c root node : - 641 - - 641 - - - -
214.12/214.28 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
214.12/214.28 c integral : 0 0 0 1 0 0 0 0 0 2
214.12/214.28 c logicor : 9711+ 5 828863 0 0 44105 6608229 0 0 0
214.12/214.28 c countsols : 0 0 0 0 0 0 0 0 0 0
214.12/214.28 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
214.12/214.28 c integral : 27.87 0.00 0.00 27.87 0.00
214.12/214.28 c logicor : 53.05 0.01 53.04 0.00 0.00
214.12/214.28 c countsols : 0.00 0.00 0.00 0.00 0.00
214.12/214.28 c Propagators : Time Calls Cutoffs DomReds
214.12/214.28 c rootredcost : 0.41 0 0 0
214.12/214.28 c pseudoobj : 59.66 889190 0 0
214.12/214.28 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
214.12/214.28 c propagation : 4.58 44105 43961 43961 9.6 27875 6.9 -
214.12/214.28 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
214.12/214.28 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
214.12/214.28 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
214.12/214.28 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
214.12/214.28 c applied globally : - - - 71836 8.5 - - -
214.12/214.28 c applied locally : - - - 0 0.0 - - -
214.12/214.28 c Separators : Time Calls Cutoffs DomReds Cuts Conss
214.12/214.28 c cut pool : 0.01 4 - - 123 - (maximal pool size: 1138)
214.12/214.28 c redcost : 0.00 5 0 0 0 0
214.12/214.28 c impliedbounds : 0.00 5 0 0 0 0
214.12/214.28 c intobj : 0.00 0 0 0 0 0
214.12/214.28 c gomory : 0.82 5 0 0 2500 0
214.12/214.28 c strongcg : 0.79 5 0 0 2500 0
214.12/214.28 c cmir : 0.00 0 0 0 0 0
214.12/214.28 c flowcover : 0.00 0 0 0 0 0
214.12/214.28 c clique : 0.01 5 0 0 32 0
214.12/214.28 c zerohalf : 0.00 0 0 0 0 0
214.12/214.28 c mcf : 0.03 1 0 0 0 0
214.12/214.28 c Pricers : Time Calls Vars
214.12/214.28 c problem variables: 0.00 0 0
214.12/214.28 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
214.12/214.28 c relpscost : 27.87 1 0 0 0 0 2
214.12/214.28 c pscost : 0.00 0 0 0 0 0 0
214.12/214.28 c inference : 20.71 61608 0 0 0 0 123216
214.12/214.28 c mostinf : 0.00 0 0 0 0 0 0
214.12/214.28 c leastinf : 0.00 0 0 0 0 0 0
214.12/214.28 c fullstrong : 0.00 0 0 0 0 0 0
214.12/214.28 c allfullstrong : 0.00 0 0 0 0 0 0
214.12/214.28 c random : 0.00 0 0 0 0 0 0
214.12/214.28 c Primal Heuristics : Time Calls Found
214.12/214.28 c LP solutions : 0.00 - 0
214.12/214.28 c pseudo solutions : 0.00 - 0
214.12/214.28 c simplerounding : 0.00 0 0
214.12/214.28 c rounding : 0.00 0 0
214.12/214.28 c shifting : 0.00 0 0
214.12/214.28 c intshifting : 0.00 0 0
214.12/214.28 c oneopt : 0.00 0 0
214.12/214.28 c fixandinfer : 0.00 0 0
214.12/214.28 c feaspump : 0.00 0 0
214.12/214.28 c coefdiving : 0.00 0 0
214.12/214.28 c pscostdiving : 0.00 0 0
214.12/214.28 c fracdiving : 0.00 0 0
214.12/214.28 c veclendiving : 0.00 0 0
214.12/214.28 c intdiving : 0.00 0 0
214.12/214.28 c actconsdiving : 0.00 0 0
214.12/214.28 c objpscostdiving : 0.00 0 0
214.12/214.28 c rootsoldiving : 0.00 0 0
214.12/214.28 c linesearchdiving : 0.00 0 0
214.12/214.28 c guideddiving : 0.00 0 0
214.12/214.28 c octane : 0.00 0 0
214.12/214.28 c rens : 0.00 0 0
214.12/214.28 c rins : 0.00 0 0
214.12/214.28 c localbranching : 0.00 0 0
214.12/214.28 c mutation : 0.00 0 0
214.12/214.28 c crossover : 0.00 0 0
214.12/214.28 c dins : 0.00 0 0
214.12/214.28 c LP : Time Calls Iterations Iter/call Iter/sec
214.12/214.28 c primal LP : 0.01 0 0 0.00 0.00
214.12/214.28 c dual LP : 4.61 6 3549 591.50 769.85
214.12/214.28 c barrier LP : 0.00 0 0 0.00 -
214.12/214.28 c diving/probing LP: 0.00 0 0 0.00 -
214.12/214.28 c strong branching : 27.87 18 15811 878.39 567.31
214.12/214.28 c (at root node) : - 18 15811 878.39 -
214.12/214.28 c conflict analysis: 0.00 0 0 0.00 -
214.12/214.28 c B&B Tree :
214.12/214.28 c number of runs : 1
214.12/214.28 c nodes : 86118
214.12/214.28 c nodes (total) : 86118
214.12/214.28 c nodes left : 0
214.12/214.28 c max depth : 72
214.12/214.28 c max depth (total): 72
214.12/214.28 c backtracks : 22787 (26.5%)
214.12/214.28 c delayed cutoffs : 37101
214.12/214.28 c repropagations : 97810 (3372814 domain reductions, 19596 cutoffs)
214.12/214.28 c avg switch length: 3.33
214.12/214.28 c switching time : 29.20
214.12/214.28 c Solution :
214.12/214.28 c Solutions found : 0 (0 improvements)
214.12/214.28 c Primal Bound : infeasible
214.12/214.28 c Dual Bound : -
214.12/214.28 c Gap : 0.00 %
214.12/214.28 c Root Dual Bound : +2.02235027423979e+02
214.22/214.35 c Time complete: 214.28.