0.09/0.18 c SCIP version 1.1.0.7
0.09/0.18 c LP-Solver Clp 1.8.2
0.09/0.18 c user parameter file <scip.set> not found - using default parameters
0.09/0.18 c read problem <HOME/instance-1884688-1245260084.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.23 c No objective function, only one solution is needed.
0.19/0.23 c start presolving problem
0.19/0.23 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
0.89/0.92 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.92 c 0.7s| 1 | 0 | 1061 | 16M| 0 | 590 |1548 |9711 |9711 |1548 |9711 | 0 | 0 | 0 | 1.887917e+02 | -- | Inf
1.48/1.57 c 1.3s| 1 | 0 | 1373 | 16M| 0 | 607 |1548 |9711 |9711 |1548 |9727 | 16 | 0 | 0 | 1.931051e+02 | -- | Inf
2.29/2.31 c 2.1s| 1 | 0 | 1764 | 17M| 0 | 617 |1548 |9711 |9711 |1548 |9747 | 36 | 0 | 0 | 1.961458e+02 | -- | Inf
3.09/3.17 c 2.9s| 1 | 0 | 2208 | 17M| 0 | 683 |1548 |9711 |9711 |1548 |9765 | 54 | 0 | 0 | 1.974800e+02 | -- | Inf
4.09/4.15 c 3.9s| 1 | 0 | 2614 | 18M| 0 | 685 |1548 |9711 |9711 |1548 |9782 | 71 | 0 | 0 | 1.996928e+02 | -- | Inf
4.99/5.09 c 4.8s| 1 | 0 | 3055 | 19M| 0 | 667 |1548 |9711 |9711 |1548 |9796 | 85 | 0 | 0 | 2.018588e+02 | -- | Inf
17.98/18.09 c 17.8s| 1 | 2 | 3055 | 19M| 0 | 667 |1548 |9711 |9711 |1548 |9796 | 85 | 0 | 18 | 2.018588e+02 | -- | Inf
37.08/37.13 c 36.5s| 10000 | 31 | 3055 | 21M| 68 | - |1548 | 10k|6931 | 0 | 0 | 85 |8304 | 18 | 2.085430e+02 | -- | Inf
56.68/56.77 c 55.8s| 20000 | 13 | 3055 | 21M| 68 | - |1548 | 11k|8988 | 0 | 0 | 85 | 17k| 18 | 2.085430e+02 | -- | Inf
75.97/76.03 c 74.7s| 30000 | 14 | 3055 | 21M| 68 | - |1548 | 12k|6785 | 0 | 0 | 85 | 26k| 18 | 2.085430e+02 | -- | Inf
95.26/95.31 c 93.7s| 40000 | 13 | 3055 | 21M| 68 | - |1548 | 14k|6112 | 0 | 0 | 85 | 35k| 18 | 2.085430e+02 | -- | Inf
113.46/113.51 c 112s| 50000 | 23 | 3055 | 22M| 68 | - |1548 | 15k|5309 | 0 | 0 | 85 | 45k| 18 | 2.085430e+02 | -- | Inf
132.56/132.64 c 130s| 60000 | 10 | 3055 | 22M| 68 | - |1548 | 16k|6178 | 0 | 0 | 85 | 53k| 18 | 2.085430e+02 | -- | Inf
151.35/151.49 c 149s| 70000 | 14 | 3055 | 22M| 68 | - |1548 | 17k|5861 | 0 | 0 | 85 | 63k| 18 | 2.085430e+02 | -- | Inf
170.45/170.56 c 168s| 80000 | 15 | 3055 | 22M| 68 | - |1548 | 18k|6113 | 0 | 0 | 85 | 71k| 18 | 2.085430e+02 | -- | Inf
190.54/190.63 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
190.54/190.63 c 187s| 90000 | 22 | 3055 | 23M| 68 | - |1548 | 18k|4550 | 0 | 0 | 85 | 78k| 18 | 2.085430e+02 | -- | Inf
210.13/210.27 c 207s|100000 | 13 | 3055 | 23M| 68 | - |1548 | 18k|4423 | 0 | 0 | 85 | 86k| 18 | 2.085430e+02 | -- | Inf
229.23/229.35 c 225s|110000 | 16 | 3055 | 23M| 68 | - |1548 | 18k|6783 | 0 | 0 | 85 | 93k| 18 | 2.085430e+02 | -- | Inf
245.93/246.01 c
245.93/246.01 c SCIP Status : problem is solved [infeasible]
245.93/246.01 c Solving Time (sec) : 241.62
245.93/246.01 c Solving Nodes : 118552
245.93/246.01 c Primal Bound : +1.00000000000000e+20 (0 solutions)
245.93/246.01 c Dual Bound : +1.00000000000000e+20
245.93/246.01 c Gap : 0.00 %
245.93/246.01 c NODE 118552
245.93/246.01 c DUAL BOUND 1e+20
245.93/246.01 c PRIMAL BOUND 1e+20
245.93/246.01 c GAP 0
245.93/246.01 s UNSATISFIABLE
245.93/246.01 c SCIP Status : problem is solved [infeasible]
245.93/246.01 c Solving Time : 241.62
245.93/246.01 c Original Problem :
245.93/246.01 c Problem name : HOME/instance-1884688-1245260084.opb
245.93/246.01 c Variables : 1960 (1960 binary, 0 integer, 0 implicit integer, 0 continuous)
245.93/246.01 c Constraints : 11270 initial, 11270 maximal
245.93/246.01 c Presolved Problem :
245.93/246.01 c Problem name : t_HOME/instance-1884688-1245260084.opb
245.93/246.01 c Variables : 1548 (1548 binary, 0 integer, 0 implicit integer, 0 continuous)
245.93/246.01 c Constraints : 9711 initial, 18553 maximal
245.93/246.01 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
245.93/246.01 c trivial : 0.00 0 0 0 0 0 0 0 0
245.93/246.01 c dualfix : 0.00 0 0 0 0 0 0 0 0
245.93/246.01 c boundshift : 0.00 0 0 0 0 0 0 0 0
245.93/246.01 c inttobinary : 0.00 0 0 0 0 0 0 0 0
245.93/246.01 c implics : 0.02 0 351 0 0 0 0 0 0
245.93/246.01 c probing : 0.00 0 0 0 0 0 0 0 0
245.93/246.01 c linear : 0.11 40 21 0 40 0 1559 0 30
245.93/246.01 c logicor : 0.03 0 0 0 0 0 0 0 0
245.93/246.01 c root node : - 585 - - 585 - - - -
245.93/246.01 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
245.93/246.01 c integral : 0 0 0 1 0 0 0 0 0 2
245.93/246.01 c logicor : 9711+ 5 1079738 0 0 60763 8247045 0 0 0
245.93/246.01 c countsols : 0 0 0 0 0 0 0 0 0 0
245.93/246.01 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
245.93/246.01 c integral : 12.97 0.00 0.00 12.97 0.00
245.93/246.01 c logicor : 66.49 0.00 66.49 0.00 0.00
245.93/246.01 c countsols : 0.00 0.00 0.00 0.00 0.00
245.93/246.01 c Propagators : Time Calls Cutoffs DomReds
245.93/246.01 c rootredcost : 0.36 0 0 0
245.93/246.01 c pseudoobj : 76.04 1160726 0 0
245.93/246.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
245.93/246.01 c propagation : 6.53 60763 60691 60691 9.3 39154 6.6 -
245.93/246.01 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
245.93/246.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
245.93/246.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
245.93/246.01 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
245.93/246.01 c applied globally : - - - 99845 8.3 - - -
245.93/246.01 c applied locally : - - - 0 0.0 - - -
245.93/246.01 c Separators : Time Calls Cutoffs DomReds Cuts Conss
245.93/246.01 c cut pool : 0.00 4 - - 119 - (maximal pool size: 1158)
245.93/246.01 c redcost : 0.00 5 0 0 0 0
245.93/246.01 c impliedbounds : 0.00 5 0 0 0 0
245.93/246.01 c intobj : 0.00 0 0 0 0 0
245.93/246.01 c gomory : 0.86 5 0 0 2500 0
245.93/246.01 c strongcg : 0.77 5 0 0 2500 0
245.93/246.01 c cmir : 0.00 0 0 0 0 0
245.93/246.01 c flowcover : 0.00 0 0 0 0 0
245.93/246.01 c clique : 0.01 5 0 0 32 0
245.93/246.01 c zerohalf : 0.00 0 0 0 0 0
245.93/246.01 c mcf : 0.01 1 0 0 0 0
245.93/246.01 c Pricers : Time Calls Vars
245.93/246.01 c problem variables: 0.00 0 0
245.93/246.01 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
245.93/246.01 c relpscost : 12.97 1 0 0 0 0 2
245.93/246.01 c pscost : 0.00 0 0 0 0 0 0
245.93/246.01 c inference : 27.18 84532 0 0 0 0 169064
245.93/246.01 c mostinf : 0.00 0 0 0 0 0 0
245.93/246.01 c leastinf : 0.00 0 0 0 0 0 0
245.93/246.01 c fullstrong : 0.00 0 0 0 0 0 0
245.93/246.01 c allfullstrong : 0.00 0 0 0 0 0 0
245.93/246.01 c random : 0.00 0 0 0 0 0 0
245.93/246.01 c Primal Heuristics : Time Calls Found
245.93/246.01 c LP solutions : 0.00 - 0
245.93/246.01 c pseudo solutions : 0.00 - 0
245.93/246.01 c simplerounding : 0.00 0 0
245.93/246.01 c rounding : 0.00 0 0
245.93/246.01 c shifting : 0.00 0 0
245.93/246.01 c intshifting : 0.00 0 0
245.93/246.01 c oneopt : 0.00 0 0
245.93/246.01 c fixandinfer : 0.00 0 0
245.93/246.01 c feaspump : 0.00 0 0
245.93/246.01 c coefdiving : 0.00 0 0
245.93/246.01 c pscostdiving : 0.00 0 0
245.93/246.01 c fracdiving : 0.00 0 0
245.93/246.01 c veclendiving : 0.00 0 0
245.93/246.01 c intdiving : 0.00 0 0
245.93/246.01 c actconsdiving : 0.00 0 0
245.93/246.01 c objpscostdiving : 0.00 0 0
245.93/246.01 c rootsoldiving : 0.00 0 0
245.93/246.01 c linesearchdiving : 0.00 0 0
245.93/246.01 c guideddiving : 0.00 0 0
245.93/246.01 c octane : 0.00 0 0
245.93/246.01 c rens : 0.00 0 0
245.93/246.01 c rins : 0.00 0 0
245.93/246.01 c localbranching : 0.00 0 0
245.93/246.01 c mutation : 0.00 0 0
245.93/246.01 c crossover : 0.00 0 0
245.93/246.01 c dins : 0.00 0 0
245.93/246.01 c LP : Time Calls Iterations Iter/call Iter/sec
245.93/246.01 c primal LP : 0.02 0 0 0.00 0.00
245.93/246.01 c dual LP : 2.86 6 3055 509.17 1068.18
245.93/246.01 c barrier LP : 0.00 0 0 0.00 -
245.93/246.01 c diving/probing LP: 0.00 0 0 0.00 -
245.93/246.01 c strong branching : 12.97 18 9458 525.44 729.22
245.93/246.01 c (at root node) : - 18 9458 525.44 -
245.93/246.01 c conflict analysis: 0.00 0 0 0.00 -
245.93/246.01 c B&B Tree :
245.93/246.01 c number of runs : 1
245.93/246.01 c nodes : 118552
245.93/246.01 c nodes (total) : 118552
245.93/246.01 c nodes left : 0
245.93/246.01 c max depth : 68
245.93/246.01 c max depth (total): 68
245.93/246.01 c backtracks : 31712 (26.7%)
245.93/246.01 c delayed cutoffs : 50515
245.93/246.01 c repropagations : 132580 (4283007 domain reductions, 26744 cutoffs)
245.93/246.01 c avg switch length: 3.30
245.93/246.01 c switching time : 37.13
245.93/246.01 c Solution :
245.93/246.01 c Solutions found : 0 (0 improvements)
245.93/246.01 c Primal Bound : infeasible
245.93/246.01 c Dual Bound : -
245.93/246.01 c Gap : 0.00 %
245.93/246.01 c Root Dual Bound : +2.01858772219884e+02
245.93/246.08 c Time complete: 246.