0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver SoPlex 1.4.1
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1884277-1245256408.opb>
0.00/0.04 c original problem has 684 variables (684 bin, 0 int, 0 impl, 0 cont) and 2300 constraints
0.04/0.05 c No objective function, only one solution is needed.
0.04/0.05 c start presolving problem
0.04/0.05 c presolving:
0.04/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.04/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.06
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.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 # 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.11 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.11 c lp/pricing = c a
0.09/0.11 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c lp/solvefreq = c 0
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 1620
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 # should enforcement of pseudo solution be disabled?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/disableenfops = c TRUE
0.09/0.11 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c constraints/agelimit = c 1
0.09/0.11 c # should binary conflicts be preferred?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c conflict/preferbinary = c TRUE
0.09/0.11 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c conflict/interconss = c 0
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving problem
0.09/0.11 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 | 121 |4313k| 0 | 28 | 681 |2267 |2267 | 681 |2267 | 0 | 0 | 0 | 1.595238e+01 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 320 |4361k| 0 | 85 | 681 |2267 |2267 | 681 |2268 | 1 | 0 | 0 | 1.644275e+01 | -- | Inf
0.29/0.39 c 0.3s| 1 | 0 | 435 |4555k| 0 | 24 | 681 |2267 |2267 | 681 |2270 | 3 | 0 | 0 | 1.682353e+01 | -- | Inf
0.59/0.61 c 0.6s| 1 | 0 | 709 |5298k| 0 | 54 | 681 |2267 |2267 | 681 |2271 | 4 | 0 | 0 | 1.707258e+01 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 930 |6277k| 0 | 154 | 681 |2267 |2267 | 681 |2273 | 6 | 0 | 0 | 1.724919e+01 | -- | Inf
1.19/1.20 c 1.1s| 1 | 0 | 1058 |6763k| 0 | 45 | 681 |2267 |2267 | 681 |2275 | 8 | 0 | 0 | 1.730426e+01 | -- | Inf
6.49/6.53 c 6.4s| 1 | 2 | 1058 |6763k| 0 | 45 | 681 |2267 |2267 | 681 |2275 | 8 | 0 | 21 | 1.730426e+01 | -- | Inf
18.48/18.58 c 17.9s| 10000 | 69 | 1058 |7195k| 175 | - | 681 |2289 | 616 | 0 | 0 | 8 |7976 | 21 | 1.742747e+01 | -- | Inf
31.78/31.89 c 30.7s| 20000 | 54 | 1058 |7193k| 175 | - | 681 |2281 | 932 | 0 | 0 | 8 | 15k| 21 | 1.742747e+01 | -- | Inf
45.97/46.09 c 44.3s| 30000 | 46 | 1058 |7233k| 175 | - | 681 |2305 | 236 | 0 | 0 | 8 | 22k| 21 | 1.742747e+01 | -- | Inf
60.37/60.40 c 58.1s| 40000 | 45 | 1058 |7241k| 175 | - | 681 |2320 | 311 | 0 | 0 | 8 | 30k| 21 | 1.742747e+01 | -- | Inf
75.07/75.18 c 72.2s| 50000 | 35 | 1058 |7226k| 175 | - | 681 |2302 | 764 | 0 | 0 | 8 | 37k| 21 | 1.742747e+01 | -- | Inf
91.36/91.49 c 87.9s| 60000 | 28 | 1058 |7226k| 175 | - | 681 |2306 | 913 | 0 | 0 | 8 | 44k| 21 | 1.742747e+01 | -- | Inf
107.16/107.23 c 103s| 70000 | 24 | 1058 |7221k| 175 | - | 681 |2313 |1417 | 0 | 0 | 8 | 51k| 21 | 1.742747e+01 | -- | Inf
124.15/124.25 c 120s| 80000 | 13 | 1058 |7229k| 175 | - | 681 |2296 |1052 | 0 | 0 | 8 | 56k| 21 | 1.742747e+01 | -- | Inf
142.55/142.60 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
142.55/142.60 c 137s| 90000 | 12 | 1058 |7235k| 175 | - | 681 |2287 | 762 | 0 | 0 | 8 | 63k| 21 | 2.531169e+01 | -- | Inf
159.44/159.51 c 154s|100000 | 9 | 1058 |7246k| 175 | - | 681 |2320 | 470 | 0 | 0 | 8 | 69k| 21 | 2.531169e+01 | -- | Inf
178.64/178.75 c 172s|110000 | 9 | 1058 |7239k| 175 | - | 681 |2319 | 760 | 0 | 0 | 8 | 76k| 21 | 2.531169e+01 | -- | Inf
187.83/187.91 c
187.83/187.91 c SCIP Status : problem is solved [infeasible]
187.83/187.91 c Solving Time (sec) : 180.90
187.83/187.91 c Solving Nodes : 114373
187.83/187.91 c Primal Bound : +1.00000000000000e+20 (0 solutions)
187.83/187.91 c Dual Bound : +1.00000000000000e+20
187.83/187.91 c Gap : 0.00 %
187.83/187.91 c NODE 114373
187.83/187.91 c DUAL BOUND 1e+20
187.83/187.91 c PRIMAL BOUND 1e+20
187.83/187.91 c GAP 0
187.83/187.91 s UNSATISFIABLE
187.83/187.91 c SCIP Status : problem is solved [infeasible]
187.83/187.91 c Solving Time : 180.90
187.83/187.91 c Original Problem :
187.83/187.91 c Problem name : HOME/instance-1884277-1245256408.opb
187.83/187.91 c Variables : 684 (684 binary, 0 integer, 0 implicit integer, 0 continuous)
187.83/187.91 c Constraints : 2300 initial, 2300 maximal
187.83/187.91 c Presolved Problem :
187.83/187.91 c Problem name : t_HOME/instance-1884277-1245256408.opb
187.83/187.91 c Variables : 681 (681 binary, 0 integer, 0 implicit integer, 0 continuous)
187.83/187.91 c Constraints : 2267 initial, 2374 maximal
187.83/187.91 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
187.83/187.91 c trivial : 0.00 0 0 0 0 0 0 0 0
187.83/187.91 c dualfix : 0.00 0 0 0 0 0 0 0 0
187.83/187.91 c boundshift : 0.00 0 0 0 0 0 0 0 0
187.83/187.91 c inttobinary : 0.00 0 0 0 0 0 0 0 0
187.83/187.91 c implics : 0.00 0 0 0 0 0 0 0 0
187.83/187.91 c probing : 0.00 0 0 0 0 0 0 0 0
187.83/187.91 c linear : 0.03 3 0 0 3 0 33 0 0
187.83/187.91 c logicor : 0.02 0 0 0 0 0 0 0 0
187.83/187.91 c root node : - 681 - - 681 - - - -
187.83/187.91 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
187.83/187.91 c integral : 0 0 0 1 0 0 0 0 0 2
187.83/187.91 c logicor : 2267+ 5 2200218 0 0 75718 12426953 0 0 0
187.83/187.91 c countsols : 0 0 0 0 0 0 0 0 0 0
187.83/187.91 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
187.83/187.91 c integral : 5.30 0.00 0.00 5.30 0.00
187.83/187.91 c logicor : 68.27 0.00 68.27 0.00 0.00
187.83/187.91 c countsols : 0.00 0.00 0.00 0.00 0.00
187.83/187.91 c Propagators : Time Calls Cutoffs DomReds
187.83/187.91 c rootredcost : 0.80 0 0 0
187.83/187.91 c pseudoobj : 64.11 2259053 0 0
187.83/187.91 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
187.83/187.91 c propagation : 31.23 75718 74385 74385 30.0 5443 23.6 -
187.83/187.91 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
187.83/187.91 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
187.83/187.91 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
187.83/187.91 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
187.83/187.91 c applied globally : - - - 76175 27.0 - - -
187.83/187.91 c applied locally : - - - 3265 82.6 - - -
187.83/187.91 c Separators : Time Calls Cutoffs DomReds Cuts Conss
187.83/187.91 c cut pool : 0.00 4 - - 26 - (maximal pool size: 317)
187.83/187.91 c redcost : 0.00 5 0 0 0 0
187.83/187.91 c impliedbounds : 0.00 5 0 0 0 0
187.83/187.91 c intobj : 0.00 0 0 0 0 0
187.83/187.91 c gomory : 0.29 5 0 0 615 0
187.83/187.91 c strongcg : 0.29 5 0 0 604 0
187.83/187.91 c cmir : 0.00 0 0 0 0 0
187.83/187.91 c flowcover : 0.00 0 0 0 0 0
187.83/187.91 c clique : 0.00 1 0 0 0 0
187.83/187.91 c zerohalf : 0.00 0 0 0 0 0
187.83/187.91 c mcf : 0.00 1 0 0 0 0
187.83/187.91 c Pricers : Time Calls Vars
187.83/187.91 c problem variables: 0.00 0 0
187.83/187.91 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
187.83/187.91 c relpscost : 5.30 1 0 0 0 0 2
187.83/187.91 c pscost : 0.00 0 0 0 0 0 0
187.83/187.91 c inference : 4.83 77011 0 0 0 0 154022
187.83/187.91 c mostinf : 0.00 0 0 0 0 0 0
187.83/187.91 c leastinf : 0.00 0 0 0 0 0 0
187.83/187.91 c fullstrong : 0.00 0 0 0 0 0 0
187.83/187.91 c allfullstrong : 0.00 0 0 0 0 0 0
187.83/187.91 c random : 0.00 0 0 0 0 0 0
187.83/187.91 c Primal Heuristics : Time Calls Found
187.83/187.91 c LP solutions : 0.00 - 0
187.83/187.91 c pseudo solutions : 0.00 - 0
187.83/187.91 c simplerounding : 0.00 0 0
187.83/187.91 c rounding : 0.00 0 0
187.83/187.91 c shifting : 0.00 0 0
187.83/187.91 c intshifting : 0.00 0 0
187.83/187.91 c oneopt : 0.00 0 0
187.83/187.91 c fixandinfer : 0.00 0 0
187.83/187.91 c feaspump : 0.00 0 0
187.83/187.91 c coefdiving : 0.00 0 0
187.83/187.91 c pscostdiving : 0.00 0 0
187.83/187.91 c fracdiving : 0.00 0 0
187.83/187.91 c veclendiving : 0.00 0 0
187.83/187.91 c intdiving : 0.00 0 0
187.83/187.91 c actconsdiving : 0.00 0 0
187.83/187.91 c objpscostdiving : 0.00 0 0
187.83/187.91 c rootsoldiving : 0.00 0 0
187.83/187.91 c linesearchdiving : 0.00 0 0
187.83/187.91 c guideddiving : 0.00 0 0
187.83/187.91 c octane : 0.00 0 0
187.83/187.91 c rens : 0.00 0 0
187.83/187.91 c rins : 0.00 0 0
187.83/187.91 c localbranching : 0.00 0 0
187.83/187.91 c mutation : 0.00 0 0
187.83/187.91 c crossover : 0.00 0 0
187.83/187.91 c dins : 0.00 0 0
187.83/187.91 c LP : Time Calls Iterations Iter/call Iter/sec
187.83/187.91 c primal LP : 0.00 0 0 0.00 -
187.83/187.91 c dual LP : 0.47 6 1058 176.33 2251.06
187.83/187.91 c barrier LP : 0.00 0 0 0.00 -
187.83/187.91 c diving/probing LP: 0.00 0 0 0.00 -
187.83/187.91 c strong branching : 5.30 21 9423 448.71 1777.92
187.83/187.91 c (at root node) : - 21 9423 448.71 -
187.83/187.91 c conflict analysis: 0.00 0 0 0.00 -
187.83/187.91 c B&B Tree :
187.83/187.91 c number of runs : 1
187.83/187.91 c nodes : 114373
187.83/187.91 c nodes (total) : 114373
187.83/187.91 c nodes left : 0
187.83/187.91 c max depth : 175
187.83/187.91 c max depth (total): 175
187.83/187.91 c backtracks : 40318 (35.3%)
187.83/187.91 c delayed cutoffs : 39652
187.83/187.91 c repropagations : 100761 (5655845 domain reductions, 38357 cutoffs)
187.83/187.91 c avg switch length: 2.52
187.83/187.91 c switching time : 21.70
187.83/187.91 c Solution :
187.83/187.91 c Solutions found : 0 (0 improvements)
187.83/187.91 c Primal Bound : infeasible
187.83/187.91 c Dual Bound : -
187.83/187.91 c Gap : 0.00 %
187.83/187.91 c Root Dual Bound : +1.73042635658915e+01
187.83/187.93 c Time complete: 187.87.