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-1884537-1245259430.opb>
0.00/0.01 c original problem has 140 variables (140 bin, 0 int, 0 impl, 0 cont) and 336 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, 336 upgd conss, 560 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 560 implications, 0 cliques
0.00/0.02 c presolved problem has 140 variables (140 bin, 0 int, 0 impl, 0 cont) and 336 constraints
0.00/0.02 c 336 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.03 c heuristics/guideddiving/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = c -1
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = c 0.15
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = c 750
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = c -1
0.00/0.03 c # priority of node selection rule <dfs> in standard mode
0.00/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.03 c nodeselection/dfs/stdpriority = c 1000000
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = c 0
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = c FALSE
0.00/0.03 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = c 5
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = c 1
0.00/0.03 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.03 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.03 c lp/pricing = c a
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = c 0
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = c 1
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = c 1620
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = c 1791
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = c 10000
0.00/0.03 c # should enforcement of pseudo solution be disabled?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/disableenfops = c TRUE
0.00/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c constraints/agelimit = c 1
0.00/0.03 c # should binary conflicts be preferred?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c conflict/preferbinary = c TRUE
0.00/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c conflict/interconss = c 0
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving problem
0.00/0.03 c
0.00/0.03 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c 0.0s| 1 | 0 | 113 | 804k| 0 | 80 | 140 | 336 | 336 | 140 | 336 | 0 | 0 | 0 | 2.800000e+01 | -- | Inf
0.00/0.09 c 0.1s| 1 | 0 | 208 |1476k| 0 | 81 | 140 | 336 | 336 | 140 | 344 | 8 | 0 | 0 | 2.800000e+01 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 330 |1677k| 0 | 84 | 140 | 336 | 336 | 140 | 351 | 15 | 0 | 0 | 2.800000e+01 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 420 |2156k| 0 | 84 | 140 | 336 | 336 | 140 | 360 | 24 | 0 | 0 | 2.800000e+01 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 464 |2345k| 0 | 84 | 140 | 336 | 336 | 140 | 365 | 29 | 0 | 0 | 2.800000e+01 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 517 |2575k| 0 | 79 | 140 | 336 | 336 | 140 | 368 | 32 | 0 | 0 | 2.800000e+01 | -- | Inf
0.79/0.83 c 0.8s| 1 | 2 | 517 |2576k| 0 | 79 | 140 | 336 | 336 | 140 | 368 | 32 | 0 | 33 | 2.800000e+01 | -- | Inf
3.09/3.10 c 2.8s| 10000 | 27 | 517 |2683k| 44 | - | 140 | 367 | 236 | 0 | 0 | 32 |6198 | 33 | 2.800000e+01 | -- | Inf
5.39/5.46 c 5.0s| 20000 | 26 | 517 |2684k| 44 | - | 140 | 359 | 222 | 0 | 0 | 32 | 12k| 33 | 2.800000e+01 | -- | Inf
7.69/7.75 c 7.1s| 30000 | 21 | 517 |2690k| 44 | - | 140 | 363 | 233 | 0 | 0 | 32 | 18k| 33 | 2.800000e+01 | -- | Inf
10.08/10.10 c 9.2s| 40000 | 22 | 517 |2699k| 44 | - | 140 | 380 | 249 | 0 | 0 | 32 | 24k| 33 | 2.800000e+01 | -- | Inf
12.38/12.46 c 11.3s| 50000 | 26 | 517 |2699k| 44 | - | 140 | 370 | 232 | 0 | 0 | 32 | 31k| 33 | 2.800000e+01 | -- | Inf
14.78/14.82 c 13.5s| 60000 | 21 | 517 |2708k| 44 | - | 140 | 387 | 184 | 0 | 0 | 32 | 37k| 33 | 2.800000e+01 | -- | Inf
17.08/17.15 c 15.6s| 70000 | 20 | 517 |2707k| 44 | - | 140 | 386 | 214 | 0 | 0 | 32 | 43k| 33 | 2.800000e+01 | -- | Inf
19.38/19.48 c 17.7s| 80000 | 24 | 517 |2706k| 44 | - | 140 | 371 | 224 | 0 | 0 | 32 | 49k| 33 | 2.800000e+01 | -- | Inf
21.78/21.85 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
21.78/21.85 c 19.9s| 90000 | 21 | 517 |2706k| 47 | - | 140 | 375 | 247 | 0 | 0 | 32 | 56k| 33 | 2.800000e+01 | -- | Inf
24.18/24.23 c 22.0s|100000 | 23 | 517 |2710k| 47 | - | 140 | 373 | 175 | 0 | 0 | 32 | 62k| 33 | 2.800000e+01 | -- | Inf
26.48/26.57 c 24.1s|110000 | 28 | 517 |2703k| 47 | - | 140 | 353 | 251 | 0 | 0 | 32 | 68k| 33 | 2.800000e+01 | -- | Inf
28.88/28.93 c 26.3s|120000 | 19 | 517 |2709k| 47 | - | 140 | 370 | 204 | 0 | 0 | 32 | 74k| 33 | 2.800000e+01 | -- | Inf
31.18/31.24 c 28.4s|130000 | 17 | 517 |2712k| 47 | - | 140 | 370 | 184 | 0 | 0 | 32 | 81k| 33 | 2.800000e+01 | -- | Inf
33.57/33.60 c 30.5s|140000 | 23 | 517 |2714k| 47 | - | 140 | 375 | 187 | 0 | 0 | 32 | 87k| 33 | 2.800000e+01 | -- | Inf
35.87/35.92 c 32.6s|150000 | 19 | 517 |2714k| 47 | - | 140 | 379 | 243 | 0 | 0 | 32 | 93k| 33 | 2.800000e+01 | -- | Inf
38.17/38.26 c 34.7s|160000 | 25 | 517 |2716k| 47 | - | 140 | 371 | 209 | 0 | 0 | 32 | 99k| 33 | 2.800000e+01 | -- | Inf
40.57/40.64 c 36.9s|170000 | 20 | 517 |2711k| 47 | - | 140 | 361 | 221 | 0 | 0 | 32 | 105k| 33 | 2.800000e+01 | -- | Inf
42.77/42.88 c 38.9s|180000 | 27 | 517 |2711k| 47 | - | 140 | 357 | 221 | 0 | 0 | 32 | 112k| 33 | 2.800000e+01 | -- | Inf
45.07/45.17 c 41.0s|190000 | 14 | 517 |2713k| 47 | - | 140 | 372 | 262 | 0 | 0 | 32 | 118k| 33 | 2.800000e+01 | -- | Inf
47.37/47.47 c 43.1s|200000 | 18 | 517 |2721k| 47 | - | 140 | 378 | 178 | 0 | 0 | 32 | 124k| 33 | 2.800000e+01 | -- | Inf
49.77/49.82 c 45.2s|210000 | 24 | 517 |2715k| 47 | - | 140 | 363 | 186 | 0 | 0 | 32 | 130k| 33 | 2.800000e+01 | -- | Inf
52.06/52.14 c 47.3s|220000 | 15 | 517 |2714k| 47 | - | 140 | 367 | 246 | 0 | 0 | 32 | 136k| 33 | 2.800000e+01 | -- | Inf
54.56/54.64 c 49.6s|230000 | 23 | 517 |2719k| 47 | - | 140 | 370 | 205 | 0 | 0 | 32 | 143k| 33 | 2.800000e+01 | -- | Inf
57.07/57.14 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
57.07/57.14 c 51.8s|240000 | 22 | 517 |2724k| 47 | - | 140 | 385 | 219 | 0 | 0 | 32 | 149k| 33 | 2.800000e+01 | -- | Inf
59.57/59.64 c 54.1s|250000 | 21 | 517 |2723k| 47 | - | 140 | 381 | 209 | 0 | 0 | 32 | 156k| 33 | 2.800000e+01 | -- | Inf
61.96/62.04 c 56.3s|260000 | 20 | 517 |2727k| 47 | - | 140 | 384 | 144 | 0 | 0 | 32 | 162k| 33 | 2.800000e+01 | -- | Inf
64.37/64.46 c 58.4s|270000 | 22 | 517 |2723k| 47 | - | 140 | 379 | 231 | 0 | 0 | 32 | 168k| 33 | 2.800000e+01 | -- | Inf
66.77/66.83 c 60.6s|280000 | 24 | 517 |2726k| 47 | - | 140 | 385 | 201 | 0 | 0 | 32 | 175k| 33 | 2.800000e+01 | -- | Inf
69.16/69.25 c 62.7s|290000 | 23 | 517 |2721k| 47 | - | 140 | 372 | 208 | 0 | 0 | 32 | 181k| 33 | 2.800000e+01 | -- | Inf
71.56/71.60 c 64.9s|300000 | 22 | 517 |2727k| 47 | - | 140 | 384 | 191 | 0 | 0 | 32 | 187k| 33 | 2.800000e+01 | -- | Inf
73.86/73.90 c 66.9s|310000 | 19 | 517 |2725k| 47 | - | 140 | 379 | 172 | 0 | 0 | 32 | 194k| 33 | 2.800000e+01 | -- | Inf
76.06/76.19 c 69.0s|320000 | 27 | 517 |2727k| 47 | - | 140 | 379 | 198 | 0 | 0 | 32 | 200k| 33 | 2.800000e+01 | -- | Inf
78.46/78.57 c 71.1s|330000 | 19 | 517 |2722k| 47 | - | 140 | 369 | 206 | 0 | 0 | 32 | 206k| 33 | 2.800000e+01 | -- | Inf
80.86/80.90 c 73.3s|340000 | 15 | 517 |2727k| 47 | - | 140 | 384 | 183 | 0 | 0 | 32 | 212k| 33 | 2.800000e+01 | -- | Inf
83.15/83.21 c 75.3s|350000 | 26 | 517 |2728k| 47 | - | 140 | 381 | 204 | 0 | 0 | 32 | 219k| 33 | 2.800000e+01 | -- | Inf
85.46/85.53 c 77.5s|360000 | 23 | 517 |2726k| 47 | - | 140 | 377 | 219 | 0 | 0 | 32 | 225k| 33 | 2.800000e+01 | -- | Inf
87.75/87.83 c 79.5s|370000 | 19 | 517 |2723k| 47 | - | 140 | 371 | 228 | 0 | 0 | 32 | 231k| 33 | 2.800000e+01 | -- | Inf
90.06/90.18 c 81.7s|380000 | 17 | 517 |2729k| 47 | - | 140 | 388 | 182 | 0 | 0 | 32 | 238k| 33 | 2.800000e+01 | -- | Inf
92.45/92.51 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
92.45/92.51 c 83.8s|390000 | 16 | 517 |2731k| 47 | - | 140 | 393 | 198 | 0 | 0 | 32 | 244k| 33 | 2.800000e+01 | -- | Inf
94.75/94.88 c 85.9s|400000 | 18 | 517 |2728k| 47 | - | 140 | 384 | 218 | 0 | 0 | 32 | 250k| 33 | 2.800000e+01 | -- | Inf
97.15/97.28 c 88.0s|410000 | 22 | 517 |2722k| 47 | - | 140 | 364 | 243 | 0 | 0 | 32 | 257k| 33 | 2.800000e+01 | -- | Inf
99.55/99.62 c 90.2s|420000 | 22 | 517 |2723k| 47 | - | 140 | 364 | 214 | 0 | 0 | 32 | 263k| 33 | 2.800000e+01 | -- | Inf
101.95/102.02 c 92.4s|430000 | 29 | 517 |2724k| 47 | - | 140 | 361 | 193 | 0 | 0 | 32 | 269k| 33 | 2.800000e+01 | -- | Inf
104.25/104.37 c 94.5s|440000 | 22 | 517 |2723k| 47 | - | 140 | 363 | 224 | 0 | 0 | 32 | 275k| 33 | 2.800000e+01 | -- | Inf
106.66/106.71 c 96.6s|450000 | 23 | 517 |2726k| 47 | - | 140 | 368 | 205 | 0 | 0 | 32 | 282k| 33 | 2.800000e+01 | -- | Inf
109.05/109.17 c 98.8s|460000 | 26 | 517 |2725k| 47 | - | 140 | 361 | 212 | 0 | 0 | 32 | 288k| 33 | 2.800000e+01 | -- | Inf
111.45/111.51 c 101s|470000 | 20 | 517 |2734k| 47 | - | 140 | 390 | 193 | 0 | 0 | 32 | 294k| 33 | 2.800000e+01 | -- | Inf
113.75/113.85 c 103s|480000 | 21 | 517 |2730k| 47 | - | 140 | 374 | 187 | 0 | 0 | 32 | 300k| 33 | 2.800000e+01 | -- | Inf
116.15/116.25 c 105s|490000 | 20 | 517 |2733k| 47 | - | 140 | 379 | 142 | 0 | 0 | 32 | 307k| 33 | 2.800000e+01 | -- | Inf
118.55/118.61 c 107s|500000 | 20 | 517 |2732k| 47 | - | 140 | 378 | 178 | 0 | 0 | 32 | 313k| 33 | 2.800000e+01 | -- | Inf
120.96/121.03 c 110s|510000 | 27 | 517 |2726k| 47 | - | 140 | 365 | 235 | 0 | 0 | 32 | 319k| 33 | 2.800000e+01 | -- | Inf
123.25/123.37 c 112s|520000 | 22 | 517 |2734k| 47 | - | 140 | 386 | 211 | 0 | 0 | 32 | 326k| 33 | 2.800000e+01 | -- | Inf
125.64/125.75 c 114s|530000 | 19 | 517 |2734k| 47 | - | 140 | 389 | 207 | 0 | 0 | 32 | 332k| 33 | 2.800000e+01 | -- | Inf
128.04/128.10 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
128.04/128.10 c 116s|540000 | 26 | 517 |2733k| 47 | - | 140 | 372 | 155 | 0 | 0 | 32 | 338k| 33 | 2.800000e+01 | -- | Inf
130.34/130.45 c 118s|550000 | 16 | 517 |2735k| 47 | - | 140 | 394 | 232 | 0 | 0 | 32 | 344k| 33 | 2.800000e+01 | -- | Inf
132.64/132.77 c 120s|560000 | 21 | 517 |2730k| 47 | - | 140 | 376 | 242 | 0 | 0 | 32 | 351k| 33 | 2.800000e+01 | -- | Inf
135.04/135.13 c 122s|570000 | 26 | 517 |2734k| 47 | - | 140 | 375 | 151 | 0 | 0 | 32 | 357k| 33 | 2.800000e+01 | -- | Inf
137.45/137.55 c 124s|580000 | 25 | 517 |2737k| 47 | - | 140 | 382 | 128 | 0 | 0 | 32 | 363k| 33 | 2.800000e+01 | -- | Inf
139.85/139.94 c 127s|590000 | 20 | 517 |2737k| 47 | - | 140 | 389 | 163 | 0 | 0 | 32 | 370k| 33 | 2.800000e+01 | -- | Inf
142.14/142.25 c 129s|600000 | 24 | 517 |2731k| 47 | - | 140 | 373 | 193 | 0 | 0 | 32 | 376k| 33 | 2.800000e+01 | -- | Inf
144.44/144.57 c 131s|610000 | 18 | 517 |2733k| 47 | - | 140 | 384 | 208 | 0 | 0 | 32 | 382k| 33 | 2.800000e+01 | -- | Inf
146.73/146.87 c 133s|620000 | 14 | 517 |2740k| 47 | - | 140 | 400 | 157 | 0 | 0 | 32 | 388k| 33 | 2.800000e+01 | -- | Inf
149.24/149.30 c 135s|630000 | 12 | 517 |2735k| 47 | - | 140 | 386 | 157 | 0 | 0 | 32 | 395k| 33 | 2.800000e+01 | -- | Inf
151.44/151.60 c 137s|640000 | 24 | 517 |2728k| 47 | - | 140 | 362 | 199 | 0 | 0 | 32 | 401k| 33 | 2.800000e+01 | -- | Inf
153.94/154.03 c 139s|650000 | 17 | 517 |2727k| 47 | - | 140 | 362 | 209 | 0 | 0 | 32 | 407k| 33 | 2.800000e+01 | -- | Inf
156.34/156.43 c 142s|660000 | 20 | 517 |2727k| 47 | - | 140 | 361 | 218 | 0 | 0 | 32 | 413k| 33 | 2.800000e+01 | -- | Inf
158.64/158.75 c 144s|670000 | 12 | 517 |2730k| 47 | - | 140 | 371 | 190 | 0 | 0 | 32 | 419k| 33 | 2.800000e+01 | -- | Inf
160.93/161.05 c 146s|680000 | 28 | 517 |2729k| 47 | - | 140 | 353 | 148 | 0 | 0 | 32 | 425k| 33 | 2.800000e+01 | -- | Inf
163.34/163.42 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
163.34/163.42 c 148s|690000 | 20 | 517 |2736k| 47 | - | 140 | 380 | 159 | 0 | 0 | 32 | 432k| 33 | 2.800000e+01 | -- | Inf
165.74/165.86 c 150s|700000 | 20 | 517 |2732k| 47 | - | 140 | 376 | 222 | 0 | 0 | 32 | 438k| 33 | 2.800000e+01 | -- | Inf
168.13/168.30 c 152s|710000 | 20 | 517 |2738k| 47 | - | 140 | 389 | 185 | 0 | 0 | 32 | 444k| 33 | 2.800000e+01 | -- | Inf
170.63/170.71 c 154s|720000 | 25 | 517 |2732k| 47 | - | 140 | 364 | 133 | 0 | 0 | 32 | 450k| 33 | 2.800000e+01 | -- | Inf
173.03/173.18 c 157s|730000 | 20 | 517 |2732k| 47 | - | 140 | 376 | 191 | 0 | 0 | 32 | 457k| 33 | 2.800000e+01 | -- | Inf
175.43/175.56 c 159s|740000 | 25 | 517 |2729k| 47 | - | 140 | 364 | 255 | 0 | 0 | 32 | 463k| 33 | 2.800000e+01 | -- | Inf
177.83/177.98 c 161s|750000 | 25 | 517 |2732k| 47 | - | 140 | 367 | 183 | 0 | 0 | 32 | 469k| 33 | 2.800000e+01 | -- | Inf
180.33/180.41 c 163s|760000 | 22 | 517 |2732k| 47 | - | 140 | 372 | 235 | 0 | 0 | 32 | 476k| 33 | 2.800000e+01 | -- | Inf
181.63/181.78 c * 164s|766054 | 0 | 517 |2741k| 47 | - | 140 | 392 | 101 | 0 | 0 | 32 | 479k| 33 | 2.800000e+01 | 2.800000e+01 | 0.00%
181.63/181.78 c
181.63/181.78 c SCIP Status : problem is solved [optimal solution found]
181.63/181.78 c Solving Time (sec) : 164.49
181.63/181.78 c Solving Nodes : 766054
181.63/181.78 c Primal Bound : +2.80000000000000e+01 (1 solutions)
181.63/181.78 c Dual Bound : +2.80000000000000e+01
181.63/181.78 c Gap : 0.00 %
181.63/181.78 c NODE 766054
181.63/181.78 c DUAL BOUND 28
181.63/181.78 c PRIMAL BOUND 28
181.63/181.78 c GAP 0
181.63/181.78 s SATISFIABLE
181.63/181.78 v -x140 -x139 -x138 -x137 x136 -x135 -x134 x133 -x132 -x131 -x130 -x129 x128 -x127 -x126 -x125 x124 -x123 -x122 -x121 -x120 -x119
181.63/181.78 v -x118 -x117 x116 -x115 -x114 x113 -x112 -x111 -x110 -x109 -x108 x107 -x106 -x105 x104 -x103 -x102 -x101 -x100 x99 -x98 -x97
181.63/181.78 v -x96 -x95 x94 -x93 -x92 -x91 -x90 -x89 -x88 x87 -x86 -x85 x84 -x83 -x82 -x81 -x80 -x79 x78 -x77 -x76 -x75 -x74 -x73 -x72 x71
181.63/181.78 v -x70 -x69 x68 -x67 -x66 -x65 -x64 -x63 -x62 x61 -x60 x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 x51 -x50 x49 -x48 -x47 -x46 -x45
181.63/181.78 v -x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 x32 -x31 -x30 -x29 -x28 x27 -x26 -x25 -x24 x23 -x22 -x21 -x20 -x19
181.63/181.78 v x18 -x17 -x16 -x15 -x14 -x13 x12 -x11 -x10 -x9 -x8 -x7 x6 -x5 -x4 x3 -x2 -x1
181.63/181.78 c SCIP Status : problem is solved [optimal solution found]
181.63/181.78 c Solving Time : 164.49
181.63/181.78 c Original Problem :
181.63/181.78 c Problem name : HOME/instance-1884537-1245259430.opb
181.63/181.78 c Variables : 140 (140 binary, 0 integer, 0 implicit integer, 0 continuous)
181.63/181.78 c Constraints : 336 initial, 336 maximal
181.63/181.78 c Presolved Problem :
181.63/181.78 c Problem name : t_HOME/instance-1884537-1245259430.opb
181.63/181.78 c Variables : 140 (140 binary, 0 integer, 0 implicit integer, 0 continuous)
181.63/181.78 c Constraints : 336 initial, 419 maximal
181.63/181.78 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
181.63/181.78 c trivial : 0.00 0 0 0 0 0 0 0 0
181.63/181.78 c dualfix : 0.00 0 0 0 0 0 0 0 0
181.63/181.78 c boundshift : 0.00 0 0 0 0 0 0 0 0
181.63/181.78 c inttobinary : 0.00 0 0 0 0 0 0 0 0
181.63/181.78 c implics : 0.00 0 0 0 0 0 0 0 0
181.63/181.78 c probing : 0.00 0 0 0 0 0 0 0 0
181.63/181.78 c logicor : 0.00 0 0 0 0 0 0 0 0
181.63/181.78 c root node : - 0 - - 0 - - - -
181.63/181.78 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
181.63/181.78 c integral : 0 0 0 1 0 0 0 0 0 2
181.63/181.78 c logicor : 336+ 5 5187855 0 1 461595 18604699 0 0 0
181.63/181.78 c countsols : 0 0 0 0 1 0 0 0 0 0
181.63/181.78 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
181.63/181.78 c integral : 0.48 0.00 0.00 0.48 0.00
181.63/181.78 c logicor : 57.61 0.00 57.61 0.00 0.00
181.63/181.78 c countsols : 0.00 0.00 0.00 0.00 0.00
181.63/181.78 c Propagators : Time Calls Cutoffs DomReds
181.63/181.78 c rootredcost : 1.55 0 0 0
181.63/181.78 c pseudoobj : 44.29 5645305 0 0
181.63/181.78 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
181.63/181.78 c propagation : 16.50 461595 457769 457769 20.0 23104 16.4 -
181.63/181.78 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
181.63/181.78 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
181.63/181.78 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
181.63/181.78 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
181.63/181.78 c applied globally : - - - 477917 19.8 - - -
181.63/181.78 c applied locally : - - - 1927 31.7 - - -
181.63/181.78 c Separators : Time Calls Cutoffs DomReds Cuts Conss
181.63/181.78 c cut pool : 0.00 4 - - 2 - (maximal pool size: 544)
181.63/181.78 c redcost : 0.00 5 0 0 0 0
181.63/181.78 c impliedbounds : 0.00 5 0 0 0 0
181.63/181.78 c intobj : 0.00 0 0 0 0 0
181.63/181.78 c gomory : 0.13 5 0 0 565 0
181.63/181.78 c strongcg : 0.13 5 0 0 950 0
181.63/181.78 c cmir : 0.00 0 0 0 0 0
181.63/181.78 c flowcover : 0.00 0 0 0 0 0
181.63/181.78 c clique : 0.00 5 0 0 24 0
181.63/181.78 c zerohalf : 0.00 0 0 0 0 0
181.63/181.78 c mcf : 0.00 1 0 0 0 0
181.63/181.78 c Pricers : Time Calls Vars
181.63/181.78 c problem variables: 0.00 0 0
181.63/181.78 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
181.63/181.78 c relpscost : 0.48 1 0 0 0 0 2
181.63/181.78 c pscost : 0.00 0 0 0 0 0 0
181.63/181.78 c inference : 8.28 549986 0 0 0 0 1099972
181.63/181.78 c mostinf : 0.00 0 0 0 0 0 0
181.63/181.78 c leastinf : 0.00 0 0 0 0 0 0
181.63/181.78 c fullstrong : 0.00 0 0 0 0 0 0
181.63/181.78 c allfullstrong : 0.00 0 0 0 0 0 0
181.63/181.78 c random : 0.00 0 0 0 0 0 0
181.63/181.78 c Primal Heuristics : Time Calls Found
181.63/181.78 c LP solutions : 0.00 - 0
181.63/181.78 c pseudo solutions : 0.00 - 1
181.63/181.78 c simplerounding : 0.00 0 0
181.63/181.78 c rounding : 0.00 0 0
181.63/181.78 c shifting : 0.00 0 0
181.63/181.78 c intshifting : 0.00 0 0
181.63/181.78 c oneopt : 0.00 0 0
181.63/181.78 c fixandinfer : 0.00 0 0
181.63/181.78 c feaspump : 0.00 0 0
181.63/181.78 c coefdiving : 0.00 0 0
181.63/181.78 c pscostdiving : 0.00 0 0
181.63/181.78 c fracdiving : 0.00 0 0
181.63/181.78 c veclendiving : 0.00 0 0
181.63/181.78 c intdiving : 0.00 0 0
181.63/181.78 c actconsdiving : 0.00 0 0
181.63/181.78 c objpscostdiving : 0.00 0 0
181.63/181.78 c rootsoldiving : 0.00 0 0
181.63/181.78 c linesearchdiving : 0.00 0 0
181.63/181.78 c guideddiving : 0.00 0 0
181.63/181.78 c octane : 0.00 0 0
181.63/181.78 c rens : 0.00 0 0
181.63/181.78 c rins : 0.00 0 0
181.63/181.78 c localbranching : 0.00 0 0
181.63/181.78 c mutation : 0.00 0 0
181.63/181.78 c crossover : 0.00 0 0
181.63/181.78 c dins : 0.00 0 0
181.63/181.78 c LP : Time Calls Iterations Iter/call Iter/sec
181.63/181.78 c primal LP : 0.00 0 0 0.00 -
181.63/181.78 c dual LP : 0.04 6 517 86.17 12925.00
181.63/181.78 c barrier LP : 0.00 0 0 0.00 -
181.63/181.78 c diving/probing LP: 0.00 0 0 0.00 -
181.63/181.78 c strong branching : 0.48 33 3987 120.82 8306.25
181.63/181.78 c (at root node) : - 33 3987 120.82 -
181.63/181.78 c conflict analysis: 0.00 0 0 0.00 -
181.63/181.78 c B&B Tree :
181.63/181.78 c number of runs : 1
181.63/181.78 c nodes : 766054
181.63/181.78 c nodes (total) : 766054
181.63/181.78 c nodes left : 0
181.63/181.78 c max depth : 47
181.63/181.78 c max depth (total): 47
181.63/181.78 c backtracks : 257520 (33.6%)
181.63/181.78 c delayed cutoffs : 333902
181.63/181.78 c repropagations : 634601 (10241999 domain reductions, 245529 cutoffs)
181.63/181.78 c avg switch length: 2.53
181.63/181.78 c switching time : 23.15
181.63/181.78 c Solution :
181.63/181.78 c Solutions found : 1 (1 improvements)
181.63/181.78 c Primal Bound : +2.80000000000000e+01 (in run 1, after 766054 nodes, 164.49 seconds, depth 32, found by <relaxation>)
181.63/181.78 c Dual Bound : +2.80000000000000e+01
181.63/181.78 c Gap : 0.00 %
181.63/181.78 c Root Dual Bound : +2.80000000000000e+01
181.63/181.79 c Time complete: 181.72.