0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver SoPlex 1.4.1
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1884517-1245259219.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.01 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.01 c presolving (2 rounds):
0.00/0.01 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 0 implications, 0 cliques
0.00/0.01 c presolved problem has 61 variables (61 bin, 0 int, 0 impl, 0 cont) and 132 constraints
0.00/0.01 c 132 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c PURESAT
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/flowcover/freq = c -1
0.00/0.01 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/cmir/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/veclendiving/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/simplerounding/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/shifting/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/rounding/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.01 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/rootsoldiving/freq = c -1
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/rens/nodesofs = c 2000
0.00/0.01 c # minimum percentage of integer variables that have to be fixable
0.00/0.01 c # [type: real, range: [0,1], default: 0.5]
0.00/0.01 c heuristics/rens/minfixingrate = c 0.3
0.00/0.01 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/rens/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/pscostdiving/freq = c -1
0.00/0.01 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 | 62 | 372k| 0 | 61 | 61 | 132 | 132 | 61 | 132 | 0 | 0 | 0 | 2.033333e+01 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 109 | 379k| 0 | 14 | 61 | 132 | 132 | 61 | 147 | 15 | 0 | 0 | 3.000000e+01 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 115 | 380k| 0 | 18 | 61 | 132 | 132 | 61 | 149 | 17 | 0 | 0 | 3.000000e+01 | -- | Inf
0.00/0.03 c 0.0s| 1 | 0 | 133 | 382k| 0 | 33 | 61 | 132 | 132 | 61 | 151 | 19 | 0 | 0 | 3.014286e+01 | -- | Inf
0.00/0.03 c 0.0s| 1 | 0 | 146 | 397k| 0 | 33 | 61 | 132 | 132 | 61 | 153 | 21 | 0 | 0 | 3.100000e+01 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 154 | 425k| 0 | 32 | 61 | 132 | 132 | 61 | 154 | 22 | 0 | 0 | 3.100000e+01 | -- | Inf
0.06/0.07 c 0.1s| 1 | 2 | 154 | 425k| 0 | 32 | 61 | 132 | 132 | 61 | 154 | 22 | 0 | 32 | 3.100000e+01 | -- | Inf
1.59/1.68 c 1.5s| 10000 | 15 | 154 | 484k| 28 | - | 61 | 163 | 47 | 0 | 0 | 22 |5862 | 32 | 3.100000e+01 | -- | Inf
3.30/3.37 c 2.9s| 20000 | 11 | 154 | 496k| 28 | - | 61 | 198 | 29 | 0 | 0 | 22 | 12k| 32 | 3.100000e+01 | -- | Inf
4.99/5.05 c 4.3s| 30000 | 15 | 154 | 491k| 28 | - | 61 | 164 | 27 | 0 | 0 | 22 | 19k| 32 | 3.100000e+01 | -- | Inf
6.49/6.52 c 5.6s| 40000 | 15 | 154 | 491k| 28 | - | 61 | 164 | 39 | 0 | 0 | 22 | 24k| 32 | 3.100000e+01 | -- | Inf
8.09/8.10 c 7.0s| 50000 | 17 | 154 | 495k| 28 | - | 61 | 171 | 34 | 0 | 0 | 22 | 30k| 32 | 3.100000e+01 | -- | Inf
9.49/9.59 c 8.2s| 60000 | 9 | 154 | 489k| 28 | - | 61 | 154 | 55 | 0 | 0 | 22 | 36k| 32 | 3.100000e+01 | -- | Inf
11.09/11.11 c 9.5s| 70000 | 9 | 154 | 488k| 28 | - | 61 | 152 | 96 | 0 | 0 | 22 | 42k| 32 | 3.100000e+01 | -- | Inf
12.49/12.55 c 10.8s| 80000 | 15 | 154 | 491k| 29 | - | 61 | 153 | 55 | 0 | 0 | 22 | 48k| 32 | 3.100000e+01 | -- | Inf
13.89/13.99 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
13.89/13.99 c 12.1s| 90000 | 10 | 154 | 497k| 30 | - | 61 | 175 | 58 | 0 | 0 | 22 | 53k| 32 | 3.100000e+01 | -- | Inf
15.39/15.48 c 13.3s|100000 | 16 | 154 | 493k| 30 | - | 61 | 153 | 51 | 0 | 0 | 22 | 59k| 32 | 3.100000e+01 | -- | Inf
16.89/16.99 c 14.6s|110000 | 7 | 154 | 485k| 30 | - | 61 | 138 | 111 | 0 | 0 | 22 | 64k| 32 | 3.100000e+01 | -- | Inf
18.48/18.52 c 16.0s|120000 | 12 | 154 | 490k| 30 | - | 61 | 148 | 78 | 0 | 0 | 22 | 68k| 32 | 3.100000e+01 | -- | Inf
19.99/20.08 c 17.3s|130000 | 9 | 154 | 494k| 30 | - | 61 | 160 | 62 | 0 | 0 | 22 | 73k| 32 | 3.100000e+01 | -- | Inf
21.58/21.61 c 18.6s|140000 | 9 | 154 | 493k| 30 | - | 61 | 155 | 47 | 0 | 0 | 22 | 78k| 32 | 3.100000e+01 | -- | Inf
23.09/23.11 c 19.8s|150000 | 9 | 154 | 497k| 30 | - | 61 | 171 | 79 | 0 | 0 | 22 | 83k| 32 | 3.100000e+01 | -- | Inf
24.58/24.64 c 21.2s|160000 | 11 | 154 | 498k| 30 | - | 61 | 163 | 45 | 0 | 0 | 22 | 89k| 32 | 3.100000e+01 | -- | Inf
26.08/26.12 c 22.4s|170000 | 10 | 154 | 495k| 30 | - | 61 | 158 | 75 | 0 | 0 | 22 | 94k| 32 | 3.100000e+01 | -- | Inf
27.58/27.66 c 23.7s|180000 | 14 | 154 | 497k| 30 | - | 61 | 156 | 42 | 0 | 0 | 22 | 100k| 32 | 3.100000e+01 | -- | Inf
29.18/29.21 c 25.1s|190000 | 12 | 154 | 498k| 30 | - | 61 | 157 | 29 | 0 | 0 | 22 | 106k| 32 | 3.100000e+01 | -- | Inf
30.69/30.70 c 26.3s|200000 | 10 | 154 | 503k| 30 | - | 61 | 177 | 72 | 0 | 0 | 22 | 112k| 32 | 3.100000e+01 | -- | Inf
32.18/32.27 c 27.7s|210000 | 6 | 154 | 505k| 30 | - | 61 | 184 | 60 | 0 | 0 | 22 | 117k| 32 | 3.100000e+01 | -- | Inf
33.68/33.79 c 29.0s|220000 | 14 | 154 | 498k| 30 | - | 61 | 151 | 17 | 0 | 0 | 22 | 122k| 32 | 3.100000e+01 | -- | Inf
35.28/35.31 c 30.3s|230000 | 10 | 154 | 495k| 30 | - | 61 | 146 | 75 | 0 | 0 | 22 | 127k| 32 | 3.100000e+01 | -- | Inf
36.78/36.81 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
36.78/36.81 c 31.6s|240000 | 13 | 154 | 502k| 30 | - | 61 | 164 | 29 | 0 | 0 | 22 | 132k| 32 | 3.100000e+01 | -- | Inf
38.28/38.40 c 32.9s|250000 | 14 | 154 | 508k| 30 | - | 61 | 185 | 44 | 0 | 0 | 22 | 137k| 32 | 3.100000e+01 | -- | Inf
39.98/40.01 c 34.3s|260000 | 9 | 154 | 504k| 30 | - | 61 | 175 | 58 | 0 | 0 | 22 | 142k| 32 | 3.100000e+01 | -- | Inf
41.58/41.61 c 35.7s|270000 | 11 | 154 | 502k| 30 | - | 61 | 166 | 40 | 0 | 0 | 22 | 148k| 32 | 3.100000e+01 | -- | Inf
43.07/43.19 c 37.0s|280000 | 11 | 154 | 499k| 30 | - | 61 | 157 | 68 | 0 | 0 | 22 | 153k| 32 | 3.100000e+01 | -- | Inf
44.68/44.70 c 38.3s|290000 | 10 | 154 | 506k| 30 | - | 61 | 180 | 68 | 0 | 0 | 22 | 159k| 32 | 3.100000e+01 | -- | Inf
46.28/46.33 c 39.7s|300000 | 16 | 154 | 509k| 30 | - | 61 | 182 | 73 | 0 | 0 | 22 | 166k| 32 | 3.100000e+01 | -- | Inf
47.98/48.05 c 41.2s|310000 | 12 | 154 | 519k| 30 | - | 61 | 208 | 18 | 0 | 0 | 22 | 173k| 32 | 3.100000e+01 | -- | Inf
49.67/49.74 c 42.6s|320000 | 15 | 154 | 507k| 30 | - | 61 | 176 | 70 | 0 | 0 | 22 | 179k| 32 | 3.100000e+01 | -- | Inf
51.28/51.38 c 44.0s|330000 | 11 | 154 | 515k| 30 | - | 61 | 202 | 63 | 0 | 0 | 22 | 186k| 32 | 3.100000e+01 | -- | Inf
52.97/53.03 c 45.4s|340000 | 15 | 154 | 509k| 30 | - | 61 | 179 | 59 | 0 | 0 | 22 | 193k| 32 | 3.100000e+01 | -- | Inf
54.67/54.72 c 46.8s|350000 | 11 | 154 | 506k| 30 | - | 61 | 174 | 102 | 0 | 0 | 22 | 200k| 32 | 3.100000e+01 | -- | Inf
56.37/56.42 c 48.3s|360000 | 11 | 154 | 508k| 30 | - | 61 | 179 | 69 | 0 | 0 | 22 | 207k| 32 | 3.100000e+01 | -- | Inf
58.07/58.10 c 49.7s|370000 | 15 | 154 | 507k| 30 | - | 61 | 167 | 47 | 0 | 0 | 22 | 214k| 32 | 3.100000e+01 | -- | Inf
59.77/59.88 c 51.2s|380000 | 13 | 154 | 512k| 30 | - | 61 | 185 | 41 | 0 | 0 | 22 | 221k| 32 | 3.100000e+01 | -- | Inf
61.38/61.50 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
61.38/61.50 c 52.6s|390000 | 7 | 154 | 514k| 30 | - | 61 | 197 | 39 | 0 | 0 | 22 | 227k| 32 | 3.100000e+01 | -- | Inf
62.97/63.07 c 53.9s|400000 | 9 | 154 | 516k| 30 | - | 61 | 204 | 60 | 0 | 0 | 22 | 234k| 32 | 3.100000e+01 | -- | Inf
64.67/64.74 c 55.4s|410000 | 13 | 154 | 513k| 30 | - | 61 | 190 | 49 | 0 | 0 | 22 | 241k| 32 | 3.100000e+01 | -- | Inf
66.37/66.41 c 56.8s|420000 | 14 | 154 | 518k| 30 | - | 61 | 204 | 48 | 0 | 0 | 22 | 248k| 32 | 3.100000e+01 | -- | Inf
68.08/68.15 c 58.3s|430000 | 11 | 154 | 515k| 30 | - | 61 | 200 | 68 | 0 | 0 | 22 | 255k| 32 | 3.100000e+01 | -- | Inf
69.77/69.84 c 59.7s|440000 | 6 | 154 | 524k| 30 | - | 61 | 230 | 46 | 0 | 0 | 22 | 262k| 32 | 3.100000e+01 | -- | Inf
71.47/71.53 c 61.2s|450000 | 10 | 154 | 515k| 30 | - | 61 | 198 | 78 | 0 | 0 | 22 | 268k| 32 | 3.100000e+01 | -- | Inf
73.17/73.25 c 62.6s|460000 | 15 | 154 | 515k| 30 | - | 61 | 193 | 52 | 0 | 0 | 22 | 275k| 32 | 3.100000e+01 | -- | Inf
74.87/74.98 c 64.1s|470000 | 11 | 154 | 517k| 30 | - | 61 | 206 | 69 | 0 | 0 | 22 | 282k| 32 | 3.100000e+01 | -- | Inf
76.57/76.65 c 65.5s|480000 | 11 | 154 | 509k| 30 | - | 61 | 178 | 96 | 0 | 0 | 22 | 289k| 32 | 3.100000e+01 | -- | Inf
78.37/78.43 c 67.0s|490000 | 8 | 154 | 509k| 30 | - | 61 | 185 | 93 | 0 | 0 | 22 | 296k| 32 | 3.100000e+01 | -- | Inf
80.27/80.32 c 68.7s|500000 | 8 | 154 | 518k| 30 | - | 61 | 213 | 72 | 0 | 0 | 22 | 302k| 32 | 3.100000e+01 | -- | Inf
82.06/82.12 c 70.2s|510000 | 12 | 154 | 516k| 30 | - | 61 | 205 | 70 | 0 | 0 | 22 | 309k| 32 | 3.100000e+01 | -- | Inf
83.76/83.86 c 71.7s|520000 | 12 | 154 | 517k| 30 | - | 61 | 207 | 55 | 0 | 0 | 22 | 316k| 32 | 3.100000e+01 | -- | Inf
85.57/85.64 c 73.2s|530000 | 6 | 154 | 519k| 30 | - | 61 | 221 | 55 | 0 | 0 | 22 | 322k| 32 | 3.100000e+01 | -- | Inf
86.37/86.41 c
86.37/86.41 c SCIP Status : problem is solved [infeasible]
86.37/86.41 c Solving Time (sec) : 73.89
86.37/86.41 c Solving Nodes : 534221
86.37/86.41 c Primal Bound : +1.00000000000000e+20 (0 solutions)
86.37/86.41 c Dual Bound : +1.00000000000000e+20
86.37/86.41 c Gap : 0.00 %
86.37/86.41 c NODE 534221
86.37/86.41 c DUAL BOUND 1e+20
86.37/86.41 c PRIMAL BOUND 1e+20
86.37/86.41 c GAP 0
86.37/86.41 s UNSATISFIABLE
86.37/86.41 c SCIP Status : problem is solved [infeasible]
86.37/86.41 c Solving Time : 73.89
86.37/86.41 c Original Problem :
86.37/86.41 c Problem name : HOME/instance-1884517-1245259219.opb
86.37/86.41 c Variables : 61 (61 binary, 0 integer, 0 implicit integer, 0 continuous)
86.37/86.41 c Constraints : 132 initial, 132 maximal
86.37/86.41 c Presolved Problem :
86.37/86.41 c Problem name : t_HOME/instance-1884517-1245259219.opb
86.37/86.41 c Variables : 61 (61 binary, 0 integer, 0 implicit integer, 0 continuous)
86.37/86.41 c Constraints : 132 initial, 273 maximal
86.37/86.41 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
86.37/86.41 c trivial : 0.00 0 0 0 0 0 0 0 0
86.37/86.41 c dualfix : 0.00 0 0 0 0 0 0 0 0
86.37/86.41 c boundshift : 0.00 0 0 0 0 0 0 0 0
86.37/86.41 c inttobinary : 0.00 0 0 0 0 0 0 0 0
86.37/86.41 c implics : 0.00 0 0 0 0 0 0 0 0
86.37/86.41 c probing : 0.00 0 0 0 0 0 0 0 0
86.37/86.41 c logicor : 0.00 0 0 0 0 0 0 0 0
86.37/86.41 c root node : - 61 - - 61 - - - -
86.37/86.41 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
86.37/86.41 c integral : 0 0 0 1 0 0 0 0 0 2
86.37/86.41 c logicor : 132+ 5 3794027 0 0 330515 7228562 0 0 0
86.37/86.41 c countsols : 0 0 0 0 0 0 0 0 0 0
86.37/86.41 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
86.37/86.41 c integral : 0.03 0.00 0.00 0.03 0.00
86.37/86.41 c logicor : 26.61 0.00 26.61 0.00 0.00
86.37/86.41 c countsols : 0.00 0.00 0.00 0.00 0.00
86.37/86.41 c Propagators : Time Calls Cutoffs DomReds
86.37/86.41 c rootredcost : 0.95 0 0 0
86.37/86.41 c pseudoobj : 16.59 4160965 0 2
86.37/86.41 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
86.37/86.41 c propagation : 8.38 330515 297082 297082 13.1 28676 9.9 -
86.37/86.41 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
86.37/86.41 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
86.37/86.41 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
86.37/86.41 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
86.37/86.41 c applied globally : - - - 325758 12.8 - - -
86.37/86.41 c applied locally : - - - 0 0.0 - - -
86.37/86.41 c Separators : Time Calls Cutoffs DomReds Cuts Conss
86.37/86.41 c cut pool : 0.00 4 - - 0 - (maximal pool size: 76)
86.37/86.41 c redcost : 0.00 5 0 0 0 0
86.37/86.41 c impliedbounds : 0.00 5 0 0 0 0
86.37/86.41 c intobj : 0.00 0 0 0 0 0
86.37/86.41 c gomory : 0.01 5 0 0 355 0
86.37/86.41 c strongcg : 0.00 5 0 0 355 0
86.37/86.41 c cmir : 0.00 0 0 0 0 0
86.37/86.41 c flowcover : 0.00 0 0 0 0 0
86.37/86.41 c clique : 0.00 1 0 0 0 0
86.37/86.41 c zerohalf : 0.00 0 0 0 0 0
86.37/86.41 c mcf : 0.00 1 0 0 0 0
86.37/86.41 c Pricers : Time Calls Vars
86.37/86.41 c problem variables: 0.00 0 0
86.37/86.41 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
86.37/86.41 c relpscost : 0.03 1 0 0 0 0 2
86.37/86.41 c pscost : 0.00 0 0 0 0 0 0
86.37/86.41 c inference : 2.78 348008 0 0 0 0 696016
86.37/86.41 c mostinf : 0.00 0 0 0 0 0 0
86.37/86.41 c leastinf : 0.00 0 0 0 0 0 0
86.37/86.41 c fullstrong : 0.00 0 0 0 0 0 0
86.37/86.41 c allfullstrong : 0.00 0 0 0 0 0 0
86.37/86.41 c random : 0.00 0 0 0 0 0 0
86.37/86.41 c Primal Heuristics : Time Calls Found
86.37/86.41 c LP solutions : 0.00 - 0
86.37/86.41 c pseudo solutions : 0.00 - 0
86.37/86.41 c simplerounding : 0.00 0 0
86.37/86.41 c rounding : 0.00 0 0
86.37/86.41 c shifting : 0.00 0 0
86.37/86.41 c intshifting : 0.00 0 0
86.37/86.41 c oneopt : 0.00 0 0
86.37/86.41 c fixandinfer : 0.00 0 0
86.37/86.41 c feaspump : 0.00 0 0
86.37/86.41 c coefdiving : 0.00 0 0
86.37/86.41 c pscostdiving : 0.00 0 0
86.37/86.41 c fracdiving : 0.00 0 0
86.37/86.41 c veclendiving : 0.00 0 0
86.37/86.41 c intdiving : 0.00 0 0
86.37/86.41 c actconsdiving : 0.00 0 0
86.37/86.41 c objpscostdiving : 0.00 0 0
86.37/86.41 c rootsoldiving : 0.00 0 0
86.37/86.41 c linesearchdiving : 0.00 0 0
86.37/86.41 c guideddiving : 0.00 0 0
86.37/86.41 c octane : 0.00 0 0
86.37/86.41 c rens : 0.00 0 0
86.37/86.41 c rins : 0.00 0 0
86.37/86.41 c localbranching : 0.00 0 0
86.37/86.41 c mutation : 0.00 0 0
86.37/86.41 c crossover : 0.00 0 0
86.37/86.41 c dins : 0.00 0 0
86.37/86.41 c LP : Time Calls Iterations Iter/call Iter/sec
86.37/86.41 c primal LP : 0.00 0 0 0.00 -
86.37/86.41 c dual LP : 0.01 6 154 25.67 15400.00
86.37/86.41 c barrier LP : 0.00 0 0 0.00 -
86.37/86.42 c diving/probing LP: 0.00 0 0 0.00 -
86.37/86.42 c strong branching : 0.03 32 431 13.47 14366.67
86.37/86.42 c (at root node) : - 32 431 13.47 -
86.37/86.42 c conflict analysis: 0.00 0 0 0.00 -
86.37/86.42 c B&B Tree :
86.37/86.42 c number of runs : 1
86.37/86.42 c nodes : 534221
86.37/86.42 c nodes (total) : 534221
86.37/86.42 c nodes left : 0
86.37/86.42 c max depth : 30
86.37/86.42 c max depth (total): 30
86.37/86.42 c backtracks : 164481 (30.8%)
86.37/86.42 c delayed cutoffs : 161798
86.37/86.42 c repropagations : 422918 (3233275 domain reductions, 144303 cutoffs)
86.37/86.42 c avg switch length: 2.55
86.37/86.42 c switching time : 10.59
86.37/86.42 c Solution :
86.37/86.42 c Solutions found : 0 (0 improvements)
86.37/86.42 c Primal Bound : infeasible
86.37/86.42 c Dual Bound : -
86.37/86.42 c Gap : 0.00 %
86.37/86.42 c Root Dual Bound : +3.10000000000000e+01
86.37/86.42 c Time complete: 86.39.