0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver Clp 1.8.2
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1884518-1245259224.opb>
0.00/0.01 c original problem has 61 variables (61 bin, 0 int, 0 impl, 0 cont) and 132 constraints
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 132 upgd conss, 0 impls, 0 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 0 cliques
0.00/0.02 c presolved problem has 61 variables (61 bin, 0 int, 0 impl, 0 cont) and 132 constraints
0.00/0.02 c 132 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c PURESAT
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = c -1
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = c -1
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = c 2000
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = c 0.3
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = c -1
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = c -1
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = c 0.15
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/crossover/nodesofs = c 750
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/coefdiving/freq = c -1
0.00/0.02 c # priority of node selection rule <dfs> in standard mode
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.02 c nodeselection/dfs/stdpriority = c 1000000
0.00/0.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c presolving/probing/maxrounds = c 0
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = c FALSE
0.00/0.02 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = c 5
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = c 1
0.00/0.02 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.00/0.02 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.02 c lp/pricing = c a
0.00/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = c 0
0.00/0.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = c 1
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = c 1620
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = c 1791
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = c 10000
0.00/0.02 c # should enforcement of pseudo solution be disabled?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/disableenfops = c TRUE
0.00/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c constraints/agelimit = c 1
0.00/0.02 c # should binary conflicts be preferred?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c conflict/preferbinary = c TRUE
0.00/0.02 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c conflict/interconss = c 0
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving problem
0.00/0.02 c
0.00/0.02 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.02 c 0.0s| 1 | 0 | 61 | 372k| 0 | 61 | 61 | 132 | 132 | 61 | 132 | 0 | 0 | 0 | 2.033333e+01 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 108 | 379k| 0 | 26 | 61 | 132 | 132 | 61 | 147 | 15 | 0 | 0 | 3.000000e+01 | -- | Inf
0.00/0.03 c 0.0s| 1 | 0 | 121 | 382k| 0 | 28 | 61 | 132 | 132 | 61 | 150 | 18 | 0 | 0 | 3.000000e+01 | -- | Inf
0.00/0.03 c 0.0s| 1 | 0 | 133 | 417k| 0 | 34 | 61 | 132 | 132 | 61 | 153 | 21 | 0 | 0 | 3.000000e+01 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 156 | 463k| 0 | 35 | 61 | 132 | 132 | 61 | 156 | 24 | 0 | 0 | 3.014286e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 168 | 510k| 0 | 26 | 61 | 132 | 132 | 61 | 161 | 29 | 0 | 0 | 3.100000e+01 | -- | Inf
0.05/0.07 c 0.1s| 1 | 2 | 168 | 511k| 0 | 26 | 61 | 132 | 132 | 61 | 161 | 29 | 0 | 26 | 3.100000e+01 | -- | Inf
1.79/1.82 c 1.6s| 10000 | 15 | 168 | 572k| 29 | - | 61 | 176 | 63 | 0 | 0 | 29 |6044 | 26 | 3.100000e+01 | -- | Inf
3.59/3.64 c 3.1s| 20000 | 8 | 168 | 580k| 29 | - | 61 | 194 | 38 | 0 | 0 | 29 | 12k| 26 | 3.100000e+01 | -- | Inf
5.39/5.49 c 4.7s| 30000 | 11 | 168 | 587k| 29 | - | 61 | 207 | 72 | 0 | 0 | 29 | 19k| 26 | 3.100000e+01 | -- | Inf
7.29/7.31 c 6.3s| 40000 | 10 | 168 | 588k| 29 | - | 61 | 207 | 74 | 0 | 0 | 29 | 26k| 26 | 3.100000e+01 | -- | Inf
8.99/9.01 c 7.7s| 50000 | 13 | 168 | 574k| 29 | - | 61 | 152 | 86 | 0 | 0 | 29 | 32k| 26 | 3.100000e+01 | -- | Inf
10.68/10.70 c 9.2s| 60000 | 15 | 168 | 580k| 29 | - | 61 | 163 | 35 | 0 | 0 | 29 | 37k| 26 | 3.100000e+01 | -- | Inf
12.29/12.37 c 10.6s| 70000 | 10 | 168 | 584k| 29 | - | 61 | 174 | 35 | 0 | 0 | 29 | 41k| 26 | 3.100000e+01 | -- | Inf
13.99/14.04 c 12.1s| 80000 | 12 | 168 | 588k| 29 | - | 61 | 187 | 39 | 0 | 0 | 29 | 47k| 26 | 3.100000e+01 | -- | Inf
15.68/15.78 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
15.68/15.78 c 13.6s| 90000 | 11 | 168 | 586k| 29 | - | 61 | 181 | 41 | 0 | 0 | 29 | 52k| 26 | 3.100000e+01 | -- | Inf
17.38/17.49 c 15.0s|100000 | 9 | 168 | 585k| 29 | - | 61 | 183 | 90 | 0 | 0 | 29 | 57k| 26 | 3.100000e+01 | -- | Inf
19.09/19.16 c 16.5s|110000 | 10 | 168 | 579k| 29 | - | 61 | 151 | 35 | 0 | 0 | 29 | 63k| 26 | 3.100000e+01 | -- | Inf
20.59/20.60 c 17.7s|120000 | 11 | 168 | 586k| 29 | - | 61 | 181 | 70 | 0 | 0 | 29 | 68k| 26 | 3.100000e+01 | -- | Inf
22.08/22.15 c 19.0s|130000 | 13 | 168 | 581k| 29 | - | 61 | 153 | 32 | 0 | 0 | 29 | 73k| 26 | 3.100000e+01 | -- | Inf
23.79/23.86 c 20.5s|140000 | 9 | 168 | 583k| 29 | - | 61 | 159 | 36 | 0 | 0 | 29 | 78k| 26 | 3.100000e+01 | -- | Inf
25.48/25.55 c 21.9s|150000 | 15 | 168 | 581k| 29 | - | 61 | 150 | 29 | 0 | 0 | 29 | 83k| 26 | 3.100000e+01 | -- | Inf
27.08/27.18 c 23.4s|160000 | 9 | 168 | 586k| 29 | - | 61 | 167 | 23 | 0 | 0 | 29 | 88k| 26 | 3.100000e+01 | -- | Inf
28.79/28.81 c 24.7s|170000 | 16 | 168 | 580k| 29 | - | 61 | 147 | 61 | 0 | 0 | 29 | 93k| 26 | 3.100000e+01 | -- | Inf
30.38/30.49 c 26.2s|180000 | 15 | 168 | 581k| 29 | - | 61 | 149 | 62 | 0 | 0 | 29 | 97k| 26 | 3.100000e+01 | -- | Inf
32.19/32.22 c 27.6s|190000 | 9 | 168 | 585k| 29 | - | 61 | 170 | 84 | 0 | 0 | 29 | 102k| 26 | 3.100000e+01 | -- | Inf
33.89/33.92 c 29.1s|200000 | 10 | 168 | 581k| 29 | - | 61 | 154 | 74 | 0 | 0 | 29 | 107k| 26 | 3.100000e+01 | -- | Inf
35.58/35.63 c 30.6s|210000 | 8 | 168 | 578k| 29 | - | 61 | 145 | 92 | 0 | 0 | 29 | 112k| 26 | 3.100000e+01 | -- | Inf
37.29/37.35 c 32.0s|220000 | 14 | 168 | 583k| 29 | - | 61 | 151 | 20 | 0 | 0 | 29 | 116k| 26 | 3.100000e+01 | -- | Inf
38.98/39.09 c 33.5s|230000 | 13 | 168 | 585k| 29 | - | 61 | 158 | 24 | 0 | 0 | 29 | 121k| 26 | 3.100000e+01 | -- | Inf
40.78/40.80 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
40.78/40.80 c 35.0s|240000 | 12 | 168 | 585k| 29 | - | 61 | 160 | 63 | 0 | 0 | 29 | 125k| 26 | 3.100000e+01 | -- | Inf
42.49/42.52 c 36.5s|250000 | 14 | 168 | 586k| 29 | - | 61 | 162 | 46 | 0 | 0 | 29 | 130k| 26 | 3.100000e+01 | -- | Inf
44.18/44.21 c 37.9s|260000 | 7 | 168 | 583k| 29 | - | 61 | 157 | 76 | 0 | 0 | 29 | 135k| 26 | 3.100000e+01 | -- | Inf
45.78/45.89 c 39.4s|270000 | 11 | 168 | 589k| 29 | - | 61 | 170 | 39 | 0 | 0 | 29 | 138k| 26 | 3.100000e+01 | -- | Inf
47.48/47.58 c 40.8s|280000 | 14 | 168 | 590k| 29 | - | 61 | 174 | 46 | 0 | 0 | 29 | 143k| 26 | 3.100000e+01 | -- | Inf
49.18/49.24 c 42.3s|290000 | 12 | 168 | 592k| 29 | - | 61 | 177 | 35 | 0 | 0 | 29 | 149k| 26 | 3.100000e+01 | -- | Inf
50.88/51.00 c 43.8s|300000 | 14 | 168 | 589k| 29 | - | 61 | 165 | 29 | 0 | 0 | 29 | 155k| 26 | 3.100000e+01 | -- | Inf
52.58/52.66 c 45.2s|310000 | 11 | 168 | 596k| 29 | - | 61 | 191 | 73 | 0 | 0 | 29 | 162k| 26 | 3.100000e+01 | -- | Inf
54.17/54.26 c 46.6s|320000 | 9 | 168 | 598k| 29 | - | 61 | 194 | 27 | 0 | 0 | 29 | 168k| 26 | 3.100000e+01 | -- | Inf
55.98/56.03 c 48.1s|330000 | 12 | 168 | 595k| 29 | - | 61 | 185 | 35 | 0 | 0 | 29 | 175k| 26 | 3.100000e+01 | -- | Inf
57.78/57.89 c 49.7s|340000 | 10 | 168 | 599k| 29 | - | 61 | 195 | 23 | 0 | 0 | 29 | 182k| 26 | 3.100000e+01 | -- | Inf
59.58/59.64 c 51.2s|350000 | 11 | 168 | 595k| 29 | - | 61 | 182 | 27 | 0 | 0 | 29 | 188k| 26 | 3.100000e+01 | -- | Inf
61.38/61.40 c 52.7s|360000 | 13 | 168 | 592k| 29 | - | 61 | 168 | 35 | 0 | 0 | 29 | 195k| 26 | 3.100000e+01 | -- | Inf
63.08/63.12 c 54.1s|370000 | 8 | 168 | 598k| 29 | - | 61 | 194 | 46 | 0 | 0 | 29 | 202k| 26 | 3.100000e+01 | -- | Inf
64.88/64.95 c 55.7s|380000 | 12 | 168 | 600k| 29 | - | 61 | 200 | 51 | 0 | 0 | 29 | 209k| 26 | 3.100000e+01 | -- | Inf
66.77/66.87 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
66.77/66.87 c 57.4s|390000 | 13 | 168 | 600k| 29 | - | 61 | 192 | 33 | 0 | 0 | 29 | 216k| 26 | 3.100000e+01 | -- | Inf
68.67/68.78 c 59.0s|400000 | 11 | 168 | 605k| 29 | - | 61 | 211 | 43 | 0 | 0 | 29 | 222k| 26 | 3.100000e+01 | -- | Inf
70.57/70.68 c 60.6s|410000 | 10 | 168 | 601k| 29 | - | 61 | 201 | 60 | 0 | 0 | 29 | 229k| 26 | 3.100000e+01 | -- | Inf
72.37/72.48 c 62.2s|420000 | 7 | 168 | 599k| 29 | - | 61 | 197 | 84 | 0 | 0 | 29 | 236k| 26 | 3.100000e+01 | -- | Inf
74.27/74.32 c 63.8s|430000 | 12 | 168 | 608k| 29 | - | 61 | 218 | 29 | 0 | 0 | 29 | 243k| 26 | 3.100000e+01 | -- | Inf
76.17/76.23 c 65.4s|440000 | 14 | 168 | 604k| 29 | - | 61 | 202 | 47 | 0 | 0 | 29 | 249k| 26 | 3.100000e+01 | -- | Inf
77.98/78.07 c 66.9s|450000 | 14 | 168 | 596k| 29 | - | 61 | 173 | 27 | 0 | 0 | 29 | 256k| 26 | 3.100000e+01 | -- | Inf
79.67/79.76 c 68.4s|460000 | 12 | 168 | 599k| 29 | - | 61 | 186 | 38 | 0 | 0 | 29 | 263k| 26 | 3.100000e+01 | -- | Inf
81.17/81.29 c 69.7s|470000 | 17 | 168 | 594k| 29 | - | 61 | 166 | 47 | 0 | 0 | 29 | 269k| 26 | 3.100000e+01 | -- | Inf
82.87/82.96 c 71.1s|480000 | 9 | 168 | 603k| 29 | - | 61 | 203 | 60 | 0 | 0 | 29 | 276k| 26 | 3.100000e+01 | -- | Inf
84.37/84.46 c 72.4s|490000 | 13 | 168 | 605k| 29 | - | 61 | 206 | 43 | 0 | 0 | 29 | 283k| 26 | 3.100000e+01 | -- | Inf
85.97/86.07 c 73.8s|500000 | 10 | 168 | 608k| 29 | - | 61 | 212 | 17 | 0 | 0 | 29 | 289k| 26 | 3.100000e+01 | -- | Inf
87.67/87.78 c 75.3s|510000 | 13 | 168 | 598k| 29 | - | 61 | 176 | 44 | 0 | 0 | 29 | 296k| 26 | 3.100000e+01 | -- | Inf
89.47/89.54 c 76.8s|520000 | 10 | 168 | 601k| 29 | - | 61 | 193 | 80 | 0 | 0 | 29 | 303k| 26 | 3.100000e+01 | -- | Inf
91.17/91.26 c 78.2s|530000 | 7 | 168 | 601k| 29 | - | 61 | 195 | 53 | 0 | 0 | 29 | 310k| 26 | 3.100000e+01 | -- | Inf
92.96/93.06 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
92.96/93.06 c 79.8s|540000 | 11 | 168 | 601k| 29 | - | 61 | 192 | 53 | 0 | 0 | 29 | 317k| 26 | 3.100000e+01 | -- | Inf
94.76/94.82 c 81.3s|550000 | 9 | 168 | 604k| 29 | - | 61 | 209 | 64 | 0 | 0 | 29 | 323k| 26 | 3.100000e+01 | -- | Inf
94.97/95.01 c
94.97/95.01 c SCIP Status : problem is solved [infeasible]
94.97/95.01 c Solving Time (sec) : 81.42
94.97/95.01 c Solving Nodes : 551078
94.97/95.01 c Primal Bound : +1.00000000000000e+20 (0 solutions)
94.97/95.01 c Dual Bound : +1.00000000000000e+20
94.97/95.01 c Gap : 0.00 %
94.97/95.01 c NODE 551078
94.97/95.01 c DUAL BOUND 1e+20
94.97/95.01 c PRIMAL BOUND 1e+20
94.97/95.01 c GAP 0
94.97/95.01 s UNSATISFIABLE
94.97/95.01 c SCIP Status : problem is solved [infeasible]
94.97/95.01 c Solving Time : 81.42
94.97/95.01 c Original Problem :
94.97/95.01 c Problem name : HOME/instance-1884518-1245259224.opb
94.97/95.01 c Variables : 61 (61 binary, 0 integer, 0 implicit integer, 0 continuous)
94.97/95.01 c Constraints : 132 initial, 132 maximal
94.97/95.01 c Presolved Problem :
94.97/95.01 c Problem name : t_HOME/instance-1884518-1245259224.opb
94.97/95.01 c Variables : 61 (61 binary, 0 integer, 0 implicit integer, 0 continuous)
94.97/95.01 c Constraints : 132 initial, 265 maximal
94.97/95.01 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
94.97/95.01 c trivial : 0.00 0 0 0 0 0 0 0 0
94.97/95.01 c dualfix : 0.00 0 0 0 0 0 0 0 0
94.97/95.01 c boundshift : 0.00 0 0 0 0 0 0 0 0
94.97/95.01 c inttobinary : 0.00 0 0 0 0 0 0 0 0
94.97/95.01 c implics : 0.00 0 0 0 0 0 0 0 0
94.97/95.01 c probing : 0.00 0 0 0 0 0 0 0 0
94.97/95.01 c logicor : 0.00 0 0 0 0 0 0 0 0
94.97/95.01 c root node : - 60 - - 60 - - - -
94.97/95.01 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
94.97/95.01 c integral : 0 0 0 1 0 0 0 0 0 2
94.97/95.01 c logicor : 132+ 5 3866806 0 0 338718 7406306 0 0 0
94.97/95.01 c countsols : 0 0 0 0 0 0 0 0 0 0
94.97/95.01 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
94.97/95.01 c integral : 0.02 0.00 0.00 0.02 0.00
94.97/95.01 c logicor : 27.97 0.00 27.97 0.00 0.00
94.97/95.01 c countsols : 0.00 0.00 0.00 0.00 0.00
94.97/95.01 c Propagators : Time Calls Cutoffs DomReds
94.97/95.01 c rootredcost : 1.24 0 0 0
94.97/95.01 c pseudoobj : 18.65 4245012 0 0
94.97/95.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
94.97/95.01 c propagation : 8.54 338718 300632 300632 13.5 23904 10.1 -
94.97/95.01 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
94.97/95.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
94.97/95.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
94.97/95.01 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
94.97/95.01 c applied globally : - - - 324536 13.3 - - -
94.97/95.01 c applied locally : - - - 0 0.0 - - -
94.97/95.01 c Separators : Time Calls Cutoffs DomReds Cuts Conss
94.97/95.01 c cut pool : 0.00 4 - - 4 - (maximal pool size: 140)
94.97/95.01 c redcost : 0.00 5 0 0 0 0
94.97/95.01 c impliedbounds : 0.00 5 0 0 0 0
94.97/95.01 c intobj : 0.00 0 0 0 0 0
94.97/95.01 c gomory : 0.02 5 0 0 402 0
94.97/95.01 c strongcg : 0.01 5 0 0 402 0
94.97/95.01 c cmir : 0.00 0 0 0 0 0
94.97/95.01 c flowcover : 0.00 0 0 0 0 0
94.97/95.01 c clique : 0.00 1 0 0 0 0
94.97/95.01 c zerohalf : 0.00 0 0 0 0 0
94.97/95.01 c mcf : 0.00 1 0 0 0 0
94.97/95.01 c Pricers : Time Calls Vars
94.97/95.01 c problem variables: 0.00 0 0
94.97/95.01 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
94.97/95.01 c relpscost : 0.02 1 0 0 0 0 2
94.97/95.01 c pscost : 0.00 0 0 0 0 0 0
94.97/95.01 c inference : 3.12 358824 0 0 0 0 717648
94.97/95.01 c mostinf : 0.00 0 0 0 0 0 0
94.97/95.01 c leastinf : 0.00 0 0 0 0 0 0
94.97/95.01 c fullstrong : 0.00 0 0 0 0 0 0
94.97/95.01 c allfullstrong : 0.00 0 0 0 0 0 0
94.97/95.01 c random : 0.00 0 0 0 0 0 0
94.97/95.01 c Primal Heuristics : Time Calls Found
94.97/95.01 c LP solutions : 0.00 - 0
94.97/95.01 c pseudo solutions : 0.00 - 0
94.97/95.01 c simplerounding : 0.00 0 0
94.97/95.01 c rounding : 0.00 0 0
94.97/95.01 c shifting : 0.00 0 0
94.97/95.01 c intshifting : 0.00 0 0
94.97/95.01 c oneopt : 0.00 0 0
94.97/95.01 c fixandinfer : 0.00 0 0
94.97/95.01 c feaspump : 0.00 0 0
94.97/95.01 c coefdiving : 0.00 0 0
94.97/95.01 c pscostdiving : 0.00 0 0
94.97/95.01 c fracdiving : 0.00 0 0
94.97/95.01 c veclendiving : 0.00 0 0
94.97/95.01 c intdiving : 0.00 0 0
94.97/95.01 c actconsdiving : 0.00 0 0
94.97/95.01 c objpscostdiving : 0.00 0 0
94.97/95.01 c rootsoldiving : 0.00 0 0
94.97/95.01 c linesearchdiving : 0.00 0 0
94.97/95.01 c guideddiving : 0.00 0 0
94.97/95.01 c octane : 0.00 0 0
94.97/95.01 c rens : 0.00 0 0
94.97/95.01 c rins : 0.00 0 0
94.97/95.01 c localbranching : 0.00 0 0
94.97/95.01 c mutation : 0.00 0 0
94.97/95.01 c crossover : 0.00 0 0
94.97/95.01 c dins : 0.00 0 0
94.97/95.01 c LP : Time Calls Iterations Iter/call Iter/sec
94.97/95.01 c primal LP : 0.00 0 0 0.00 -
94.97/95.01 c dual LP : 0.00 6 168 28.00 -
94.97/95.01 c barrier LP : 0.00 0 0 0.00 -
94.97/95.01 c diving/probing LP: 0.00 0 0 0.00 -
94.97/95.01 c strong branching : 0.02 26 314 12.08 15700.00
94.97/95.01 c (at root node) : - 26 314 12.08 -
94.97/95.01 c conflict analysis: 0.00 0 0 0.00 -
94.97/95.01 c B&B Tree :
94.97/95.01 c number of runs : 1
94.97/95.01 c nodes : 551078
94.97/95.01 c nodes (total) : 551078
94.97/95.01 c nodes left : 0
94.97/95.01 c max depth : 29
94.97/95.01 c max depth (total): 29
94.97/95.01 c backtracks : 166321 (30.2%)
94.97/95.01 c delayed cutoffs : 166573
94.97/95.01 c repropagations : 432165 (3238890 domain reductions, 146465 cutoffs)
94.97/95.01 c avg switch length: 2.54
94.97/95.01 c switching time : 11.37
94.97/95.01 c Solution :
94.97/95.01 c Solutions found : 0 (0 improvements)
94.97/95.01 c Primal Bound : infeasible
94.97/95.01 c Dual Bound : -
94.97/95.01 c Gap : 0.00 %
94.97/95.01 c Root Dual Bound : +3.10000000000000e+01
94.97/95.01 c Time complete: 94.98.