0.89/1.00 c SCIP version 1.1.0.7
0.89/1.00 c LP-Solver Clp 1.8.2
0.89/1.00 c user parameter file <scip.set> not found - using default parameters
0.89/1.00 c read problem <HOME/instance-1883956-1245238134.opb>
0.89/1.00 c original problem has 2750 variables (2750 bin, 0 int, 0 impl, 0 cont) and 74305 constraints
1.09/1.17 c No objective function, only one solution is needed.
1.09/1.17 c start presolving problem
1.09/1.17 c presolving:
1.89/1.93 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 74305 upgd conss, 148500 impls, 0 clqs
1.99/2.04 c presolving (2 rounds):
1.99/2.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.99/2.04 c 148500 implications, 0 cliques
1.99/2.04 c presolved problem has 2750 variables (2750 bin, 0 int, 0 impl, 0 cont) and 74305 constraints
1.99/2.04 c 74305 constraints of type <logicor>
1.99/2.04 c transformed objective value is always integral (scale: 1)
1.99/2.04 c Presolving Time: 0.68
1.99/2.04 c PURESAT
1.99/2.04 c -----------------------------------------------------------------------------------------------
1.99/2.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 0]
1.99/2.04 c separating/flowcover/freq = c -1
1.99/2.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 0]
1.99/2.04 c separating/cmir/freq = c -1
1.99/2.04 c # additional number of allowed LP iterations
1.99/2.04 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.04 c heuristics/veclendiving/maxlpiterofs = c 1500
1.99/2.04 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.04 c heuristics/veclendiving/maxlpiterquot = c 0.075
1.99/2.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.04 c heuristics/veclendiving/freq = c -1
1.99/2.04 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 1]
1.99/2.04 c heuristics/simplerounding/freq = c -1
1.99/2.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.04 c heuristics/shifting/freq = c -1
1.99/2.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 1]
1.99/2.04 c heuristics/rounding/freq = c -1
1.99/2.04 c # additional number of allowed LP iterations
1.99/2.04 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.04 c heuristics/rootsoldiving/maxlpiterofs = c 1500
1.99/2.04 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.99/2.04 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
1.99/2.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 20]
1.99/2.04 c heuristics/rootsoldiving/freq = c -1
1.99/2.04 c # number of nodes added to the contingent of the total nodes
1.99/2.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.99/2.04 c heuristics/rens/nodesofs = c 2000
1.99/2.04 c # minimum percentage of integer variables that have to be fixable
1.99/2.04 c # [type: real, range: [0,1], default: 0.5]
1.99/2.04 c heuristics/rens/minfixingrate = c 0.3
1.99/2.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 0]
1.99/2.04 c heuristics/rens/freq = c -1
1.99/2.04 c # additional number of allowed LP iterations
1.99/2.04 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.04 c heuristics/pscostdiving/maxlpiterofs = c 1500
1.99/2.04 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.04 c heuristics/pscostdiving/maxlpiterquot = c 0.075
1.99/2.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.04 c heuristics/pscostdiving/freq = c -1
1.99/2.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 1]
1.99/2.04 c heuristics/oneopt/freq = c -1
1.99/2.04 c # additional number of allowed LP iterations
1.99/2.04 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.04 c heuristics/objpscostdiving/maxlpiterofs = c 1500
1.99/2.04 c # maximal fraction of diving LP iterations compared to total iteration number
1.99/2.04 c # [type: real, range: [0,1], default: 0.01]
1.99/2.04 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
1.99/2.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 20]
1.99/2.04 c heuristics/objpscostdiving/freq = c -1
1.99/2.04 c # additional number of allowed LP iterations
1.99/2.04 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.04 c heuristics/linesearchdiving/maxlpiterofs = c 1500
1.99/2.04 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.04 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
1.99/2.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.04 c heuristics/linesearchdiving/freq = c -1
1.99/2.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.04 c heuristics/intshifting/freq = c -1
1.99/2.04 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.04 c heuristics/intdiving/maxlpiterquot = c 0.075
1.99/2.04 c # additional number of allowed LP iterations
1.99/2.04 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.04 c heuristics/guideddiving/maxlpiterofs = c 1500
1.99/2.04 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.04 c heuristics/guideddiving/maxlpiterquot = c 0.075
1.99/2.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.04 c heuristics/guideddiving/freq = c -1
1.99/2.04 c # additional number of allowed LP iterations
1.99/2.04 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.04 c heuristics/fracdiving/maxlpiterofs = c 1500
1.99/2.04 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.04 c heuristics/fracdiving/maxlpiterquot = c 0.075
1.99/2.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.04 c heuristics/fracdiving/freq = c -1
1.99/2.04 c # additional number of allowed LP iterations
1.99/2.04 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.04 c heuristics/feaspump/maxlpiterofs = c 2000
1.99/2.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 20]
1.99/2.04 c heuristics/feaspump/freq = c -1
1.99/2.04 c # minimum percentage of integer variables that have to be fixed
1.99/2.04 c # [type: real, range: [0,1], default: 0.666]
1.99/2.04 c heuristics/crossover/minfixingrate = c 0.5
1.99/2.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.99/2.04 c # [type: real, range: [0,1], default: 0.1]
1.99/2.04 c heuristics/crossover/nodesquot = c 0.15
1.99/2.04 c # number of nodes without incumbent change that heuristic should wait
1.99/2.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.99/2.04 c heuristics/crossover/nwaitingnodes = c 100
1.99/2.04 c # number of nodes added to the contingent of the total nodes
1.99/2.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.99/2.04 c heuristics/crossover/nodesofs = c 750
1.99/2.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 30]
1.99/2.04 c heuristics/crossover/freq = c -1
1.99/2.04 c # additional number of allowed LP iterations
1.99/2.04 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.04 c heuristics/coefdiving/maxlpiterofs = c 1500
1.99/2.04 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.04 c heuristics/coefdiving/maxlpiterquot = c 0.075
1.99/2.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.04 c heuristics/coefdiving/freq = c -1
1.99/2.04 c # priority of node selection rule <dfs> in standard mode
1.99/2.04 c # [type: int, range: [-536870912,536870911], default: 0]
1.99/2.04 c nodeselection/dfs/stdpriority = c 1000000
1.99/2.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: -1]
1.99/2.04 c presolving/probing/maxrounds = c 0
1.99/2.04 c # should presolving try to simplify knapsacks
1.99/2.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.99/2.04 c constraints/knapsack/simplifyinequalities = c TRUE
1.99/2.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.99/2.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.99/2.04 c constraints/knapsack/disaggregation = c FALSE
1.99/2.04 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: -1]
1.99/2.04 c constraints/knapsack/maxnumcardlift = c 0
1.99/2.04 c # should presolving try to simplify inequalities
1.99/2.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.99/2.04 c constraints/linear/simplifyinequalities = c TRUE
1.99/2.04 c # maximal number of separation rounds in the root node (-1: unlimited)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: -1]
1.99/2.04 c separating/maxroundsroot = c 5
1.99/2.04 c # maximal number of separation rounds per node (-1: unlimited)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 5]
1.99/2.04 c separating/maxrounds = c 1
1.99/2.04 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)
1.99/2.04 c # [type: char, range: {lafpsqd}, default: l]
1.99/2.04 c lp/pricing = c a
1.99/2.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 1]
1.99/2.04 c lp/solvefreq = c 0
1.99/2.04 c # solving stops, if the given number of solutions were found (-1: no limit)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: -1]
1.99/2.04 c limits/solutions = c 1
1.99/2.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.99/2.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.99/2.04 c limits/memory = c 1620
1.99/2.04 c # maximal time in seconds to run
1.99/2.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.99/2.04 c limits/time = c 1791
1.99/2.04 c # frequency for displaying node information lines
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 100]
1.99/2.04 c display/freq = c 10000
1.99/2.04 c # should enforcement of pseudo solution be disabled?
1.99/2.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.99/2.04 c constraints/disableenfops = c TRUE
1.99/2.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: 0]
1.99/2.04 c constraints/agelimit = c 1
1.99/2.04 c # should binary conflicts be preferred?
1.99/2.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.99/2.04 c conflict/preferbinary = c TRUE
1.99/2.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
1.99/2.04 c # [type: int, range: [-1,2147483647], default: -1]
1.99/2.04 c conflict/interconss = c 0
1.99/2.04 c -----------------------------------------------------------------------------------------------
1.99/2.04 c start solving problem
1.99/2.04 c
2.39/2.47 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.39/2.47 c 1.2s| 1 | 0 | 110 | 86M| 0 | 110 |2750 | 74k| 74k|2750 | 74k| 0 | 0 | 0 | 5.500000e+01 | -- | Inf
3.98/4.00 c 2.6s| 1 | 0 | 558 | 86M| 0 | 104 |2750 | 74k| 74k|2750 | 74k| 3 | 0 | 0 | 5.500000e+01 | -- | Inf
6.78/6.87 c 5.5s| 1 | 0 | 1004 | 87M| 0 | 100 |2750 | 74k| 74k|2750 | 74k| 16 | 0 | 0 | 5.500000e+01 | -- | Inf
14.69/14.74 c 13.3s| 1 | 0 | 2422 | 87M| 0 | 68 |2750 | 74k| 74k|2750 | 74k| 26 | 0 | 0 | 5.500000e+01 | -- | Inf
20.18/20.20 c 18.8s| 1 | 0 | 3228 | 87M| 0 | 63 |2750 | 74k| 74k|2750 | 74k| 36 | 0 | 0 | 5.500000e+01 | -- | Inf
23.78/23.82 c 22.4s| 1 | 0 | 3484 | 88M| 0 | 67 |2750 | 74k| 74k|2750 | 74k| 42 | 0 | 0 | 5.500000e+01 | -- | Inf
46.35/46.43 c 44.8s| 1 | 2 | 3484 | 88M| 0 | 67 |2750 | 74k| 74k|2750 | 74k| 42 | 0 | 33 | 5.500000e+01 | -- | Inf
76.24/76.36 c 74.5s| 10000 | 1664 | 3484 | 90M|1692 | - |2750 | 74k| 60k| 0 | 0 | 42 |5420 | 33 | 5.500000e+01 | -- | Inf
110.12/110.22 c 108s| 20000 | 1652 | 3484 | 90M|1692 | - |2750 | 74k| 60k| 0 | 0 | 42 | 11k| 33 | 5.500000e+01 | -- | Inf
142.32/142.40 c 140s| 30000 | 1647 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 18k| 33 | 5.500000e+01 | -- | Inf
173.91/174.01 c 171s| 40000 | 1652 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 24k| 33 | 5.500000e+01 | -- | Inf
205.70/205.82 c 203s| 50000 | 1639 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 30k| 33 | 5.500000e+01 | -- | Inf
239.38/239.57 c 236s| 60000 | 1638 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 37k| 33 | 5.500000e+01 | -- | Inf
271.97/272.16 c 269s| 70000 | 1648 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 43k| 33 | 5.500000e+01 | -- | Inf
301.16/301.31 c 298s| 80000 | 1643 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 49k| 33 | 5.500000e+01 | -- | Inf
332.95/333.12 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
332.95/333.12 c 329s| 90000 | 1639 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 55k| 33 | 5.500000e+01 | -- | Inf
364.83/365.05 c 361s|100000 | 1639 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 62k| 33 | 5.500000e+01 | -- | Inf
397.03/397.21 c 393s|110000 | 1644 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 68k| 33 | 5.500000e+01 | -- | Inf
429.31/429.52 c 425s|120000 | 1638 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 74k| 33 | 5.500000e+01 | -- | Inf
462.91/463.17 c 458s|130000 | 1642 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 81k| 33 | 5.500000e+01 | -- | Inf
495.39/495.62 c 490s|140000 | 1636 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 87k| 33 | 5.500000e+01 | -- | Inf
527.07/527.35 c 522s|150000 | 1641 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 93k| 33 | 5.500000e+01 | -- | Inf
560.26/560.55 c 555s|160000 | 1636 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 100k| 33 | 5.500000e+01 | -- | Inf
591.06/591.35 c 585s|170000 | 1640 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 106k| 33 | 5.500000e+01 | -- | Inf
621.74/622.01 c 616s|180000 | 1640 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 112k| 33 | 5.500000e+01 | -- | Inf
653.53/653.87 c 647s|190000 | 1633 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 118k| 33 | 5.500000e+01 | -- | Inf
685.11/685.49 c 679s|200000 | 1639 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 124k| 33 | 5.500000e+01 | -- | Inf
718.30/718.67 c 712s|210000 | 1644 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 131k| 33 | 5.500000e+01 | -- | Inf
750.69/751.08 c 744s|220000 | 1636 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 137k| 33 | 5.500000e+01 | -- | Inf
781.09/781.47 c 774s|230000 | 1634 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 143k| 33 | 5.500000e+01 | -- | Inf
811.07/811.44 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
811.07/811.44 c 803s|240000 | 1643 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 149k| 33 | 5.500000e+01 | -- | Inf
843.66/844.01 c 836s|250000 | 1633 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 156k| 33 | 5.500000e+01 | -- | Inf
876.25/876.66 c 868s|260000 | 1634 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 162k| 33 | 5.500000e+01 | -- | Inf
909.54/909.95 c 901s|270000 | 1633 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 169k| 33 | 5.500000e+01 | -- | Inf
941.33/941.75 c 933s|280000 | 1635 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 175k| 33 | 5.500000e+01 | -- | Inf
976.01/976.47 c 967s|290000 | 1639 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 181k| 33 | 5.500000e+01 | -- | Inf
1006.80/1007.24 c 998s|300000 | 1641 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 188k| 33 | 5.500000e+01 | -- | Inf
1038.79/1039.29 c 1029s|310000 | 1634 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 194k| 33 | 5.500000e+01 | -- | Inf
1069.28/1069.71 c 1060s|320000 | 1640 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 200k| 33 | 5.500000e+01 | -- | Inf
1100.67/1101.10 c 1091s|330000 | 1646 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 206k| 33 | 5.500000e+01 | -- | Inf
1131.46/1131.91 c 1121s|340000 | 1630 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 213k| 33 | 5.500000e+01 | -- | Inf
1163.04/1163.57 c 1153s|350000 | 1633 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 219k| 33 | 5.500000e+01 | -- | Inf
1194.73/1195.27 c 1184s|360000 | 1633 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 225k| 33 | 5.500000e+01 | -- | Inf
1225.93/1226.49 c 1215s|370000 | 1629 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 232k| 33 | 5.500000e+01 | -- | Inf
1260.71/1261.27 c 1250s|380000 | 1633 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 238k| 33 | 5.500000e+01 | -- | Inf
1289.90/1290.41 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1289.90/1290.41 c 1278s|390000 | 1635 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 244k| 33 | 5.500000e+01 | -- | Inf
1316.59/1317.16 c 1305s|400000 | 1636 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 250k| 33 | 5.500000e+01 | -- | Inf
1343.59/1344.18 c 1332s|410000 | 1635 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 256k| 33 | 5.500000e+01 | -- | Inf
1373.36/1373.97 c 1361s|420000 | 1635 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 262k| 33 | 5.500000e+01 | -- | Inf
1403.94/1404.55 c 1392s|430000 | 1634 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 268k| 33 | 5.500000e+01 | -- | Inf
1436.04/1436.63 c 1423s|440000 | 1636 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 274k| 33 | 5.500000e+01 | -- | Inf
1470.03/1470.64 c 1457s|450000 | 1639 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 280k| 33 | 5.500000e+01 | -- | Inf
1504.01/1504.61 c 1491s|460000 | 1652 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 287k| 33 | 5.500000e+01 | -- | Inf
1536.50/1537.15 c 1523s|470000 | 1631 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 293k| 33 | 5.500000e+01 | -- | Inf
1567.68/1568.38 c 1554s|480000 | 1639 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 299k| 33 | 5.500000e+01 | -- | Inf
1600.88/1601.51 c 1587s|490000 | 1625 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 305k| 33 | 5.500000e+01 | -- | Inf
1635.97/1636.66 c 1622s|500000 | 1631 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 312k| 33 | 5.500000e+01 | -- | Inf
1671.85/1672.56 c 1657s|510000 | 1622 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 318k| 33 | 5.500000e+01 | -- | Inf
1704.44/1705.13 c 1690s|520000 | 1633 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 324k| 33 | 5.500000e+01 | -- | Inf
1738.02/1738.78 c 1723s|530000 | 1632 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 331k| 33 | 5.500000e+01 | -- | Inf
1770.91/1771.62 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1770.91/1771.62 c 1755s|540000 | 1619 | 3484 | 90M|1692 | - |2750 | 74k| 59k| 0 | 0 | 42 | 337k| 33 | 5.500000e+01 | -- | Inf
1800.01/1800.70 c
1800.01/1800.70 c SCIP Status : solving was interrupted [user interrupt]
1800.01/1800.70 c Solving Time (sec) : 1784.33
1800.01/1800.70 c Solving Nodes : 548866
1800.01/1800.70 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1800.01/1800.70 c Dual Bound : +5.50000000000003e+01
1800.01/1800.70 c Gap : infinite
1800.01/1800.70 c NODE 548866
1800.01/1800.70 c DUAL BOUND 55
1800.01/1800.70 c PRIMAL BOUND 1e+20
1800.01/1800.70 c GAP 1e+20
1800.01/1800.70 s UNKNOWN
1800.01/1800.70 c SCIP Status : solving was interrupted [user interrupt]
1800.01/1800.70 c Solving Time : 1784.33
1800.01/1800.70 c Original Problem :
1800.01/1800.70 c Problem name : HOME/instance-1883956-1245238134.opb
1800.01/1800.70 c Variables : 2750 (2750 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.01/1800.70 c Constraints : 74305 initial, 74305 maximal
1800.01/1800.70 c Presolved Problem :
1800.01/1800.70 c Problem name : t_HOME/instance-1883956-1245238134.opb
1800.01/1800.70 c Variables : 2750 (2750 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.01/1800.70 c Constraints : 74305 initial, 74337 maximal
1800.01/1800.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1800.01/1800.70 c trivial : 0.00 0 0 0 0 0 0 0 0
1800.01/1800.70 c dualfix : 0.00 0 0 0 0 0 0 0 0
1800.01/1800.70 c boundshift : 0.00 0 0 0 0 0 0 0 0
1800.01/1800.71 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1800.01/1800.71 c implics : 0.00 0 0 0 0 0 0 0 0
1800.01/1800.71 c probing : 0.00 0 0 0 0 0 0 0 0
1800.01/1800.71 c logicor : 0.18 0 0 0 0 0 0 0 0
1800.01/1800.71 c root node : - 0 - - 0 - - - -
1800.01/1800.71 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1800.01/1800.71 c integral : 0 0 0 1 0 0 0 0 0 2
1800.01/1800.71 c logicor : 74305+ 5 3255659 0 0 333587 15452285 0 0 0
1800.01/1800.71 c countsols : 0 0 0 0 0 0 0 0 0 0
1800.01/1800.71 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1800.01/1800.71 c integral : 22.45 0.00 0.00 22.45 0.00
1800.01/1800.71 c logicor : 913.64 0.03 913.61 0.00 0.00
1800.01/1800.71 c countsols : 0.00 0.00 0.00 0.00 0.00
1800.01/1800.71 c Propagators : Time Calls Cutoffs DomReds
1800.01/1800.71 c rootredcost : 1.47 0 0 0
1800.01/1800.71 c pseudoobj : 520.80 3610841 0 0
1800.01/1800.71 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1800.01/1800.71 c propagation : 649.13 333587 333587 333587 455.6 17658 285.8 -
1800.01/1800.71 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1800.01/1800.71 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1800.01/1800.71 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1800.01/1800.71 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1800.01/1800.71 c applied globally : - - - 44089 196.2 - - -
1800.01/1800.71 c applied locally : - - - 299072 483.1 - - -
1800.01/1800.71 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1800.01/1800.71 c cut pool : 0.00 4 - - 0 - (maximal pool size: 205)
1800.01/1800.71 c redcost : 0.00 5 0 0 0 0
1800.01/1800.71 c impliedbounds : 0.02 5 0 0 0 0
1800.01/1800.71 c intobj : 0.00 0 0 0 0 0
1800.01/1800.71 c gomory : 5.55 5 0 0 2110 0
1800.01/1800.71 c strongcg : 3.91 5 0 0 2110 0
1800.01/1800.71 c cmir : 0.00 0 0 0 0 0
1800.01/1800.71 c flowcover : 0.00 0 0 0 0 0
1800.01/1800.71 c clique : 0.21 5 0 0 15 0
1800.01/1800.71 c zerohalf : 0.00 0 0 0 0 0
1800.01/1800.71 c mcf : 0.14 1 0 0 0 0
1800.01/1800.71 c Pricers : Time Calls Vars
1800.01/1800.71 c problem variables: 0.00 0 0
1800.01/1800.71 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1800.01/1800.71 c relpscost : 22.45 1 0 0 0 0 2
1800.01/1800.71 c pscost : 0.00 0 0 0 0 0 0
1800.01/1800.71 c inference : 11.67 388783 0 0 0 0 777566
1800.01/1800.71 c mostinf : 0.00 0 0 0 0 0 0
1800.01/1800.71 c leastinf : 0.00 0 0 0 0 0 0
1800.01/1800.71 c fullstrong : 0.00 0 0 0 0 0 0
1800.01/1800.71 c allfullstrong : 0.00 0 0 0 0 0 0
1800.01/1800.71 c random : 0.00 0 0 0 0 0 0
1800.01/1800.71 c Primal Heuristics : Time Calls Found
1800.01/1800.71 c LP solutions : 0.00 - 0
1800.01/1800.71 c pseudo solutions : 0.00 - 0
1800.01/1800.71 c simplerounding : 0.00 0 0
1800.01/1800.71 c rounding : 0.00 0 0
1800.01/1800.71 c shifting : 0.00 0 0
1800.01/1800.71 c intshifting : 0.00 0 0
1800.01/1800.71 c oneopt : 0.00 0 0
1800.01/1800.71 c fixandinfer : 0.00 0 0
1800.01/1800.71 c feaspump : 0.00 0 0
1800.01/1800.71 c coefdiving : 0.00 0 0
1800.01/1800.71 c pscostdiving : 0.00 0 0
1800.01/1800.71 c fracdiving : 0.00 0 0
1800.01/1800.71 c veclendiving : 0.00 0 0
1800.01/1800.71 c intdiving : 0.00 0 0
1800.01/1800.71 c actconsdiving : 0.00 0 0
1800.01/1800.71 c objpscostdiving : 0.00 0 0
1800.01/1800.71 c rootsoldiving : 0.00 0 0
1800.01/1800.71 c linesearchdiving : 0.00 0 0
1800.01/1800.71 c guideddiving : 0.00 0 0
1800.01/1800.71 c octane : 0.00 0 0
1800.01/1800.71 c rens : 0.00 0 0
1800.01/1800.71 c rins : 0.00 0 0
1800.01/1800.71 c localbranching : 0.00 0 0
1800.01/1800.71 c mutation : 0.00 0 0
1800.01/1800.71 c crossover : 0.00 0 0
1800.01/1800.71 c dins : 0.00 0 0
1800.01/1800.71 c LP : Time Calls Iterations Iter/call Iter/sec
1800.01/1800.71 c primal LP : 0.09 0 0 0.00 0.00
1800.01/1800.71 c dual LP : 11.28 6 3484 580.67 308.87
1800.01/1800.71 c barrier LP : 0.00 0 0 0.00 -
1800.01/1800.71 c diving/probing LP: 0.00 0 0 0.00 -
1800.01/1800.71 c strong branching : 22.45 33 5660 171.52 252.12
1800.01/1800.71 c (at root node) : - 33 5660 171.52 -
1800.01/1800.71 c conflict analysis: 0.00 0 0 0.00 -
1800.01/1800.71 c B&B Tree :
1800.01/1800.71 c number of runs : 1
1800.01/1800.71 c nodes : 548866
1800.01/1800.71 c nodes (total) : 548866
1800.01/1800.71 c nodes left : 1631
1800.01/1800.71 c max depth : 1692
1800.01/1800.71 c max depth (total): 1692
1800.01/1800.71 c backtracks : 195933 (35.7%)
1800.01/1800.71 c delayed cutoffs : 227072
1800.01/1800.71 c repropagations : 439120 (7921267 domain reductions, 173505 cutoffs)
1800.01/1800.71 c avg switch length: 2.51
1800.01/1800.71 c switching time : 178.36
1800.01/1800.71 c Solution :
1800.01/1800.71 c Solutions found : 0 (0 improvements)
1800.01/1800.71 c Primal Bound : -
1800.01/1800.71 c Dual Bound : +5.50000000000003e+01
1800.01/1800.71 c Gap : infinite
1800.01/1800.71 c Root Dual Bound : +5.50000000000000e+01
1800.30/1801.00 c Time complete: 1800.3.