0.02/0.04 c SCIP version 1.1.0.7
0.02/0.04 c LP-Solver Clp 1.8.2
0.02/0.04 c user parameter file <scip.set> not found - using default parameters
0.02/0.04 c read problem <HOME/instance-1884278-1245256409.opb>
0.02/0.04 c original problem has 684 variables (684 bin, 0 int, 0 impl, 0 cont) and 2300 constraints
0.02/0.05 c No objective function, only one solution is needed.
0.02/0.05 c start presolving problem
0.02/0.05 c presolving:
0.02/0.06 c (round 1) 3 del vars, 3 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 3716 impls, 0 clqs
0.02/0.07 c (round 2) 3 del vars, 33 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 3716 impls, 0 clqs
0.09/0.10 c (round 3) 3 del vars, 33 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 2267 upgd conss, 3716 impls, 0 clqs
0.09/0.11 c presolving (4 rounds):
0.09/0.11 c 3 deleted vars, 33 deleted constraints, 3 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.11 c 3716 implications, 0 cliques
0.09/0.11 c presolved problem has 681 variables (681 bin, 0 int, 0 impl, 0 cont) and 2267 constraints
0.09/0.11 c 2267 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.05
0.09/0.11 c PURESAT
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 # priority of node selection rule <dfs> in standard mode
0.09/0.11 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.11 c nodeselection/dfs/stdpriority = c 1000000
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.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.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.12 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c separating/maxroundsroot = c 5
0.09/0.12 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.12 c separating/maxrounds = c 1
0.09/0.12 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.09/0.12 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.12 c lp/pricing = c a
0.09/0.12 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c lp/solvefreq = c 0
0.09/0.12 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c limits/solutions = c 1
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = c 1620
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = c 1791
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = c 10000
0.09/0.12 c # should enforcement of pseudo solution be disabled?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/disableenfops = c TRUE
0.09/0.12 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c constraints/agelimit = c 1
0.09/0.12 c # should binary conflicts be preferred?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c conflict/preferbinary = c TRUE
0.09/0.12 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c conflict/interconss = c 0
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving problem
0.09/0.12 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 | 132 |4313k| 0 | 28 | 681 |2267 |2267 | 681 |2267 | 0 | 0 | 0 | 1.595238e+01 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 307 |4375k| 0 | 73 | 681 |2267 |2267 | 681 |2268 | 1 | 0 | 0 | 1.644828e+01 | -- | Inf
0.39/0.40 c 0.3s| 1 | 0 | 490 |4517k| 0 | 25 | 681 |2267 |2267 | 681 |2270 | 3 | 0 | 0 | 1.700000e+01 | -- | Inf
0.49/0.57 c 0.5s| 1 | 0 | 759 |5018k| 0 | 26 | 681 |2267 |2267 | 681 |2272 | 5 | 0 | 0 | 1.714286e+01 | -- | Inf
0.69/0.72 c 0.6s| 1 | 0 | 828 |6144k| 0 | 50 | 681 |2267 |2267 | 681 |2274 | 7 | 0 | 0 | 1.722272e+01 | -- | Inf
0.89/0.90 c 0.8s| 1 | 0 | 946 |6537k| 0 | 54 | 681 |2267 |2267 | 681 |2275 | 8 | 0 | 0 | 1.728723e+01 | -- | Inf
2.10/2.20 c 2.1s| 1 | 2 | 946 |6538k| 0 | 54 | 681 |2267 |2267 | 681 |2275 | 8 | 0 | 19 | 1.728723e+01 | -- | Inf
15.47/15.54 c 14.9s| 10000 | 61 | 946 |6991k| 167 | - | 681 |2312 | 386 | 0 | 0 | 8 |7417 | 19 | 1.739874e+01 | -- | Inf
30.18/30.27 c 29.0s| 20000 | 48 | 946 |7000k| 167 | - | 681 |2323 | 713 | 0 | 0 | 8 | 14k| 19 | 1.739874e+01 | -- | Inf
44.56/44.69 c 42.8s| 30000 | 38 | 946 |7000k| 167 | - | 681 |2324 |1013 | 0 | 0 | 8 | 21k| 19 | 1.739874e+01 | -- | Inf
61.34/61.40 c 58.8s| 40000 | 26 | 946 |6986k| 167 | - | 681 |2296 |1339 | 0 | 0 | 8 | 28k| 19 | 1.739874e+01 | -- | Inf
78.64/78.74 c 75.6s| 50000 | 23 | 946 |7004k| 167 | - | 681 |2294 | 708 | 0 | 0 | 8 | 35k| 19 | 1.739874e+01 | -- | Inf
95.93/96.08 c 92.3s| 60000 | 9 | 946 |7011k| 167 | - | 681 |2311 | 640 | 0 | 0 | 8 | 41k| 19 | 1.739874e+01 | -- | Inf
110.63/110.76 c 106s| 70000 | 16 | 946 |7019k| 167 | - | 681 |2285 | 136 | 0 | 0 | 8 | 45k| 19 | 1.739874e+01 | -- | Inf
127.12/127.25 c 122s| 80000 | 11 | 946 |7020k| 167 | - | 681 |2297 | 287 | 0 | 0 | 8 | 52k| 19 | 1.739874e+01 | -- | Inf
143.31/143.44 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
143.31/143.44 c 138s| 90000 | 10 | 946 |7020k| 167 | - | 681 |2302 | 426 | 0 | 0 | 8 | 59k| 19 | 1.739874e+01 | -- | Inf
158.91/159.04 c 153s|100000 | 10 | 946 |7029k| 167 | - | 681 |2327 | 438 | 0 | 0 | 8 | 66k| 19 | 1.739874e+01 | -- | Inf
176.70/176.87 c 170s|110000 | 7 | 946 |7015k| 167 | - | 681 |2328 |1122 | 0 | 0 | 8 | 73k| 19 | 1.739874e+01 | -- | Inf
194.49/194.61 c
194.49/194.61 c SCIP Status : problem is solved [infeasible]
194.49/194.61 c Solving Time (sec) : 187.20
194.49/194.61 c Solving Nodes : 119343
194.49/194.61 c Primal Bound : +1.00000000000000e+20 (0 solutions)
194.49/194.61 c Dual Bound : +1.00000000000000e+20
194.49/194.61 c Gap : 0.00 %
194.49/194.61 c NODE 119343
194.49/194.61 c DUAL BOUND 1e+20
194.49/194.61 c PRIMAL BOUND 1e+20
194.49/194.61 c GAP 0
194.49/194.61 s UNSATISFIABLE
194.49/194.61 c SCIP Status : problem is solved [infeasible]
194.49/194.61 c Solving Time : 187.20
194.49/194.61 c Original Problem :
194.49/194.61 c Problem name : HOME/instance-1884278-1245256409.opb
194.49/194.61 c Variables : 684 (684 binary, 0 integer, 0 implicit integer, 0 continuous)
194.49/194.61 c Constraints : 2300 initial, 2300 maximal
194.49/194.61 c Presolved Problem :
194.49/194.61 c Problem name : t_HOME/instance-1884278-1245256409.opb
194.49/194.61 c Variables : 681 (681 binary, 0 integer, 0 implicit integer, 0 continuous)
194.49/194.61 c Constraints : 2267 initial, 2381 maximal
194.49/194.61 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
194.49/194.61 c trivial : 0.00 0 0 0 0 0 0 0 0
194.49/194.61 c dualfix : 0.00 0 0 0 0 0 0 0 0
194.49/194.61 c boundshift : 0.00 0 0 0 0 0 0 0 0
194.49/194.61 c inttobinary : 0.00 0 0 0 0 0 0 0 0
194.49/194.61 c implics : 0.00 0 0 0 0 0 0 0 0
194.49/194.61 c probing : 0.00 0 0 0 0 0 0 0 0
194.49/194.61 c linear : 0.03 3 0 0 3 0 33 0 0
194.49/194.61 c logicor : 0.02 0 0 0 0 0 0 0 0
194.49/194.61 c root node : - 681 - - 681 - - - -
194.49/194.61 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
194.49/194.61 c integral : 0 0 0 1 0 0 0 0 0 2
194.49/194.61 c logicor : 2267+ 5 2312679 0 0 77962 13833264 0 0 0
194.49/194.61 c countsols : 0 0 0 0 0 0 0 0 0 0
194.49/194.61 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
194.49/194.61 c integral : 1.30 0.00 0.00 1.30 0.00
194.49/194.61 c logicor : 69.01 0.00 69.01 0.00 0.00
194.49/194.61 c countsols : 0.00 0.00 0.00 0.00 0.00
194.49/194.61 c Propagators : Time Calls Cutoffs DomReds
194.49/194.61 c rootredcost : 0.72 0 0 0
194.49/194.61 c pseudoobj : 69.93 2372195 0 0
194.49/194.61 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
194.49/194.61 c propagation : 29.49 77962 74894 74894 24.4 5328 20.4 -
194.49/194.61 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
194.49/194.61 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
194.49/194.61 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
194.49/194.61 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
194.49/194.61 c applied globally : - - - 77703 22.2 - - -
194.49/194.61 c applied locally : - - - 2226 83.0 - - -
194.49/194.61 c Separators : Time Calls Cutoffs DomReds Cuts Conss
194.49/194.61 c cut pool : 0.01 4 - - 93 - (maximal pool size: 306)
194.49/194.61 c redcost : 0.00 5 0 0 0 0
194.49/194.61 c impliedbounds : 0.00 5 0 0 0 0
194.49/194.61 c intobj : 0.00 0 0 0 0 0
194.49/194.61 c gomory : 0.23 5 0 0 638 0
194.49/194.61 c strongcg : 0.23 5 0 0 754 0
194.49/194.61 c cmir : 0.00 0 0 0 0 0
194.49/194.61 c flowcover : 0.00 0 0 0 0 0
194.49/194.61 c clique : 0.00 1 0 0 0 0
194.49/194.61 c zerohalf : 0.00 0 0 0 0 0
194.49/194.61 c mcf : 0.01 1 0 0 0 0
194.49/194.61 c Pricers : Time Calls Vars
194.49/194.61 c problem variables: 0.00 0 0
194.49/194.61 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
194.49/194.61 c relpscost : 1.30 1 0 0 0 0 2
194.49/194.61 c pscost : 0.00 0 0 0 0 0 0
194.49/194.61 c inference : 4.82 79438 0 0 0 0 158876
194.49/194.61 c mostinf : 0.00 0 0 0 0 0 0
194.49/194.61 c leastinf : 0.00 0 0 0 0 0 0
194.49/194.61 c fullstrong : 0.00 0 0 0 0 0 0
194.49/194.61 c allfullstrong : 0.00 0 0 0 0 0 0
194.49/194.61 c random : 0.00 0 0 0 0 0 0
194.49/194.61 c Primal Heuristics : Time Calls Found
194.49/194.61 c LP solutions : 0.00 - 0
194.49/194.61 c pseudo solutions : 0.00 - 0
194.49/194.61 c simplerounding : 0.00 0 0
194.49/194.61 c rounding : 0.00 0 0
194.49/194.61 c shifting : 0.00 0 0
194.49/194.61 c intshifting : 0.00 0 0
194.49/194.61 c oneopt : 0.00 0 0
194.49/194.61 c fixandinfer : 0.00 0 0
194.49/194.61 c feaspump : 0.00 0 0
194.49/194.61 c coefdiving : 0.00 0 0
194.49/194.61 c pscostdiving : 0.00 0 0
194.49/194.61 c fracdiving : 0.00 0 0
194.49/194.61 c veclendiving : 0.00 0 0
194.49/194.61 c intdiving : 0.00 0 0
194.49/194.61 c actconsdiving : 0.00 0 0
194.49/194.61 c objpscostdiving : 0.00 0 0
194.49/194.61 c rootsoldiving : 0.00 0 0
194.49/194.61 c linesearchdiving : 0.00 0 0
194.49/194.61 c guideddiving : 0.00 0 0
194.49/194.61 c octane : 0.00 0 0
194.49/194.61 c rens : 0.00 0 0
194.49/194.61 c rins : 0.00 0 0
194.49/194.61 c localbranching : 0.00 0 0
194.49/194.61 c mutation : 0.00 0 0
194.49/194.61 c crossover : 0.00 0 0
194.49/194.61 c dins : 0.00 0 0
194.49/194.61 c LP : Time Calls Iterations Iter/call Iter/sec
194.49/194.61 c primal LP : 0.00 0 0 0.00 -
194.49/194.61 c dual LP : 0.26 6 946 157.67 3638.46
194.49/194.61 c barrier LP : 0.00 0 0 0.00 -
194.49/194.61 c diving/probing LP: 0.00 0 0 0.00 -
194.49/194.61 c strong branching : 1.30 19 3724 196.00 2864.62
194.49/194.61 c (at root node) : - 19 3724 196.00 -
194.49/194.61 c conflict analysis: 0.00 0 0 0.00 -
194.49/194.61 c B&B Tree :
194.49/194.61 c number of runs : 1
194.49/194.61 c nodes : 119343
194.49/194.61 c nodes (total) : 119343
194.49/194.61 c nodes left : 0
194.49/194.61 c max depth : 167
194.49/194.61 c max depth (total): 167
194.49/194.61 c backtracks : 40713 (34.1%)
194.49/194.61 c delayed cutoffs : 39536
194.49/194.61 c repropagations : 100893 (6090414 domain reductions, 38058 cutoffs)
194.49/194.61 c avg switch length: 2.50
194.49/194.61 c switching time : 24.02
194.49/194.61 c Solution :
194.49/194.61 c Solutions found : 0 (0 improvements)
194.49/194.61 c Primal Bound : infeasible
194.49/194.61 c Dual Bound : -
194.49/194.61 c Gap : 0.00 %
194.49/194.61 c Root Dual Bound : +1.72872340425532e+01
194.49/194.63 c Time complete: 194.53.