0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2664430-1276302575.opb>
0.03/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.03/0.05 c problem read
0.03/0.05 c No objective function, only one solution is needed.
0.03/0.05 c presolving settings loaded
0.03/0.05 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.03/0.07 c presolving:
0.09/0.12 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.13 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.14 c presolving (3 rounds):
0.09/0.14 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.14 c 242 implications, 22 cliques
0.09/0.14 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.15 c 1 constraints of type <knapsack>
0.09/0.15 c 22 constraints of type <setppc>
0.09/0.15 c 2541 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.07
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.95
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = 1
0.09/0.15 c
0.09/0.15 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c lp/solvefreq = -1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = 5
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = FALSE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c presolving/probing/maxrounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/nlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.15 c 0.1s| 1 | 2 | 0 | - |2396k| 0 | - | 231 |2564 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.89/3.90 c 3.6s| 10000 | 8295 | 0 | 0.0 |7223k| 104 | - | 231 |4207 | 0 | 0 | 0 |2663 | 0 | 0.000000e+00 | -- | Inf
9.59/9.69 c 9.2s| 20000 | 14616 | 0 | 0.0 | 12M| 104 | - | 231 |6088 | 0 | 0 | 0 |8062 | 0 | 0.000000e+00 | -- | Inf
14.39/14.45 c 13.7s| 30000 | 22691 | 0 | 0.0 | 16M| 104 | - | 231 |5828 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
19.49/19.50 c 18.5s| 40000 | 30526 | 0 | 0.0 | 20M| 104 | - | 231 |6263 | 0 | 0 | 0 | 13k| 0 | 0.000000e+00 | -- | Inf
24.78/24.86 c 23.7s| 50000 | 38257 | 0 | 0.0 | 25M| 104 | - | 231 |6884 | 0 | 0 | 0 | 17k| 0 | 0.000000e+00 | -- | Inf
31.18/31.23 c 29.8s| 60000 | 45342 | 0 | 0.0 | 30M| 104 | - | 231 |7632 | 0 | 0 | 0 | 21k| 0 | 0.000000e+00 | -- | Inf
38.27/38.38 c 36.7s| 70000 | 52155 | 0 | 0.0 | 34M| 104 | - | 231 |8652 | 0 | 0 | 0 | 25k| 0 | 0.000000e+00 | -- | Inf
46.47/46.56 c 44.6s| 80000 | 58693 | 0 | 0.0 | 39M| 104 | - | 231 |9459 | 0 | 0 | 0 | 30k| 0 | 0.000000e+00 | -- | Inf
57.08/57.17 c 54.9s| 90000 | 64095 | 0 | 0.0 | 45M| 104 | - | 231 | 10k| 0 | 0 | 0 | 37k| 0 | 0.000000e+00 | -- | Inf
69.77/69.84 c 67.3s|100000 | 69000 | 0 | 0.0 | 50M| 104 | - | 231 | 12k| 0 | 0 | 0 | 45k| 0 | 0.000000e+00 | -- | Inf
85.16/85.26 c 82.5s|110000 | 73166 | 0 | 0.0 | 55M| 104 | - | 231 | 13k| 0 | 0 | 0 | 53k| 0 | 0.000000e+00 | -- | Inf
102.46/102.56 c 99.5s|120000 | 76803 | 0 | 0.0 | 60M| 104 | - | 231 | 13k| 0 | 0 | 0 | 63k| 0 | 0.000000e+00 | -- | Inf
120.25/120.30 c 117s|130000 | 80184 | 0 | 0.0 | 65M| 104 | - | 231 | 13k| 0 | 0 | 0 | 71k| 0 | 0.000000e+00 | -- | Inf
132.35/132.41 c 129s|140000 | 86447 | 0 | 0.0 | 69M| 104 | - | 231 | 11k| 0 | 0 | 0 | 76k| 0 | 0.000000e+00 | -- | Inf
142.05/142.11 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
142.05/142.11 c 138s|150000 | 93695 | 0 | 0.0 | 73M| 104 | - | 231 | 10k| 0 | 0 | 0 | 80k| 0 | 0.000000e+00 | -- | Inf
151.34/151.42 c 147s|160000 |100870 | 0 | 0.0 | 78M| 104 | - | 231 | 10k| 0 | 0 | 0 | 84k| 0 | 0.000000e+00 | -- | Inf
160.34/160.45 c 156s|170000 |107986 | 0 | 0.0 | 82M| 104 | - | 231 | 10k| 0 | 0 | 0 | 88k| 0 | 0.000000e+00 | -- | Inf
169.53/169.65 c 165s|180000 |115074 | 0 | 0.0 | 86M| 104 | - | 231 | 10k| 0 | 0 | 0 | 92k| 0 | 0.000000e+00 | -- | Inf
179.03/179.14 c 174s|190000 |121927 | 0 | 0.0 | 91M| 104 | - | 231 | 10k| 0 | 0 | 0 | 97k| 0 | 0.000000e+00 | -- | Inf
188.63/188.72 c 184s|200000 |128771 | 0 | 0.0 | 95M| 104 | - | 231 | 10k| 0 | 0 | 0 | 101k| 0 | 0.000000e+00 | -- | Inf
198.33/198.47 c 193s|210000 |135542 | 0 | 0.0 | 100M| 104 | - | 231 | 10k| 0 | 0 | 0 | 106k| 0 | 0.000000e+00 | -- | Inf
207.84/207.98 c 202s|220000 |142422 | 0 | 0.0 | 104M| 104 | - | 231 | 10k| 0 | 0 | 0 | 110k| 0 | 0.000000e+00 | -- | Inf
220.12/220.24 c 214s|230000 |148114 | 0 | 0.0 | 109M| 104 | - | 231 | 11k| 0 | 0 | 0 | 116k| 0 | 0.000000e+00 | -- | Inf
234.23/234.36 c 228s|240000 |153444 | 0 | 0.0 | 115M| 104 | - | 231 | 12k| 0 | 0 | 0 | 123k| 0 | 0.000000e+00 | -- | Inf
248.82/248.91 c 242s|250000 |158934 | 0 | 0.0 | 120M| 104 | - | 231 | 13k| 0 | 0 | 0 | 129k| 0 | 0.000000e+00 | -- | Inf
264.31/264.46 c 258s|260000 |164258 | 0 | 0.0 | 125M| 104 | - | 231 | 14k| 0 | 0 | 0 | 135k| 0 | 0.000000e+00 | -- | Inf
281.00/281.13 c 274s|270000 |169275 | 0 | 0.0 | 130M| 104 | - | 231 | 14k| 0 | 0 | 0 | 142k| 0 | 0.000000e+00 | -- | Inf
298.10/298.27 c 291s|280000 |174374 | 0 | 0.0 | 135M| 104 | - | 231 | 15k| 0 | 0 | 0 | 149k| 0 | 0.000000e+00 | -- | Inf
316.79/316.99 c 309s|290000 |179046 | 0 | 0.0 | 140M| 104 | - | 231 | 15k| 0 | 0 | 0 | 156k| 0 | 0.000000e+00 | -- | Inf
335.09/335.27 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
335.09/335.27 c 327s|300000 |184045 | 0 | 0.0 | 145M| 104 | - | 231 | 16k| 0 | 0 | 0 | 163k| 0 | 0.000000e+00 | -- | Inf
354.49/354.62 c 346s|310000 |188714 | 0 | 0.0 | 150M| 104 | - | 231 | 16k| 0 | 0 | 0 | 170k| 0 | 0.000000e+00 | -- | Inf
374.58/374.76 c 366s|320000 |193260 | 0 | 0.0 | 155M| 104 | - | 231 | 17k| 0 | 0 | 0 | 178k| 0 | 0.000000e+00 | -- | Inf
396.89/397.07 c 388s|330000 |197253 | 0 | 0.0 | 160M| 104 | - | 231 | 17k| 0 | 0 | 0 | 186k| 0 | 0.000000e+00 | -- | Inf
419.47/419.62 c 410s|340000 |201332 | 0 | 0.0 | 165M| 104 | - | 231 | 17k| 0 | 0 | 0 | 195k| 0 | 0.000000e+00 | -- | Inf
443.26/443.48 c 434s|350000 |205110 | 0 | 0.0 | 170M| 104 | - | 231 | 18k| 0 | 0 | 0 | 203k| 0 | 0.000000e+00 | -- | Inf
467.56/467.77 c 458s|360000 |208797 | 0 | 0.0 | 175M| 104 | - | 231 | 18k| 0 | 0 | 0 | 212k| 0 | 0.000000e+00 | -- | Inf
494.35/494.50 c 484s|370000 |211987 | 0 | 0.0 | 180M| 104 | - | 231 | 19k| 0 | 0 | 0 | 222k| 0 | 0.000000e+00 | -- | Inf
519.94/520.18 c 510s|380000 |215481 | 0 | 0.0 | 185M| 104 | - | 231 | 19k| 0 | 0 | 0 | 231k| 0 | 0.000000e+00 | -- | Inf
547.83/548.07 c 537s|390000 |218435 | 0 | 0.0 | 189M| 104 | - | 231 | 20k| 0 | 0 | 0 | 240k| 0 | 0.000000e+00 | -- | Inf
574.52/574.70 c 563s|400000 |221834 | 0 | 0.0 | 194M| 104 | - | 231 | 20k| 0 | 0 | 0 | 249k| 0 | 0.000000e+00 | -- | Inf
604.32/604.51 c * 593s|409787 | 0 | 0 | 0.0 | 10M| 104 | - | 231 | 20k| 0 | 0 | 0 | 259k| 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
604.32/604.52 c
604.32/604.52 c SCIP Status : problem is solved [optimal solution found]
604.32/604.52 c Solving Time (sec) : 592.90
604.32/604.52 c Solving Nodes : 409787
604.32/604.52 c Primal Bound : +0.00000000000000e+00 (1 solutions)
604.32/604.52 c Dual Bound : +0.00000000000000e+00
604.32/604.52 c Gap : 0.00 %
604.32/604.53 s SATISFIABLE
604.32/604.53 v -x221 -x211 -x201 -x191 -x181 -x171 x161 -x151 -x141 -x131 -x231 x210 -x200 -x190 -x180 -x170 -x160 -x150 -x140 -x130 -x230 -x220
604.32/604.53 v x199 -x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 -x168 -x158 -x148 x138 -x128 -x228 x218 -x208
604.32/604.53 v -x198 -x177 -x167 -x157 -x147 -x137 -x127 -x227 -x217 -x207 -x197 x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196
604.32/604.53 v -x186 -x176 -x155 -x145 -x135 x125 -x225 -x215 -x205 -x195 -x185 x175 -x165 -x144 -x134 -x124 x224 -x214 -x204 -x194 -x184 -x174
604.32/604.53 v -x164 -x154 -x133 -x123 -x223 -x213 -x203 -x193 -x183 -x173 x163 -x153 -x143 -x122 -x222 -x212 -x202 -x192 -x182 -x172 -x162
604.32/604.53 v -x152 x142 -x132 -x121 -x120 -x119 -x118 -x117 x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 x106 -x105 -x104
604.32/604.53 v -x103 -x102 -x101 -x100 -x99 x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 x86 -x85 -x84 -x83 -x82 -x81 -x80
604.32/604.53 v -x79 -x78 -x77 -x76 -x75 x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 x57 -x56 -x55 -x54
604.32/604.53 v -x53 -x52 -x51 -x50 x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 x34 -x33 -x32 -x31 -x30 -x29
604.32/604.53 v -x28 -x27 -x26 x25 -x24 -x23 x22 -x11 -x21 -x10 -x20 -x9 -x19 -x8 -x18 -x7 -x17 -x6 -x16 -x5 -x15 x4 -x14 -x3 -x13 -x2 -x12
604.32/604.53 v -x1
604.32/604.53 c SCIP Status : problem is solved [optimal solution found]
604.32/604.53 c Solving Time : 592.90
604.32/604.53 c Original Problem :
604.32/604.53 c Problem name : HOME/instance-2664430-1276302575.opb
604.32/604.53 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
604.32/604.53 c Constraints : 2707 initial, 2707 maximal
604.32/604.53 c Presolved Problem :
604.32/604.53 c Problem name : t_HOME/instance-2664430-1276302575.opb
604.32/604.53 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
604.32/604.53 c Constraints : 2564 initial, 21111 maximal
604.32/604.53 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
604.32/604.53 c trivial : 0.00 0 0 0 0 0 0 0 0
604.32/604.53 c dualfix : 0.00 0 0 0 0 0 0 0 0
604.32/604.53 c boundshift : 0.00 0 0 0 0 0 0 0 0
604.32/604.53 c inttobinary : 0.00 0 0 0 0 0 0 0 0
604.32/604.53 c implics : 0.00 0 0 0 0 0 0 0 0
604.32/604.53 c probing : 0.00 0 0 0 0 0 0 0 0
604.32/604.53 c knapsack : 0.00 0 0 0 0 0 0 0 0
604.32/604.53 c setppc : 0.00 0 0 0 0 0 0 0 0
604.32/604.53 c linear : 0.03 0 0 0 0 0 143 0 0
604.32/604.53 c logicor : 0.03 0 0 0 0 0 0 0 0
604.32/604.53 c root node : - 0 - - 0 - - - -
604.32/604.53 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
604.32/604.53 c integral : 0 0 0 0 0 0 0 0 0 0
604.32/604.53 c knapsack : 1 0 1155385 0 343672 35641 3154286 0 0 0
604.32/604.53 c setppc : 22 0 1127733 0 343672 48718 1505183 0 0 0
604.32/604.53 c logicor : 2541+ 0 911971 0 343673 32290 3648234 0 0 0
604.32/604.53 c countsols : 0 0 0 0 343673 0 0 0 0 0
604.32/604.53 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
604.32/604.53 c integral : 0.00 0.00 0.00 0.00 0.00
604.32/604.53 c knapsack : 24.29 0.00 22.55 0.00 1.74
604.32/604.53 c setppc : 18.79 0.00 13.97 0.00 4.82
604.32/604.53 c logicor : 302.18 0.00 262.74 0.00 39.44
604.32/604.53 c countsols : 0.18 0.00 0.00 0.00 0.18
604.32/604.53 c Propagators : Time Calls Cutoffs DomReds
604.32/604.53 c vbounds : 0.70 1 0 0
604.32/604.53 c rootredcost : 0.79 0 0 0
604.32/604.53 c pseudoobj : 0.46 0 0 0
604.32/604.53 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
604.32/604.53 c propagation : 6.77 116649 116626 566279 18.8 2362 20.9 -
604.32/604.53 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
604.32/604.53 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
604.32/604.53 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
604.32/604.53 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
604.32/604.53 c applied globally : - - - 257971 14.9 - - -
604.32/604.53 c applied locally : - - - 1879 35.6 - - -
604.32/604.53 c Separators : Time Calls Cutoffs DomReds Cuts Conss
604.32/604.53 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
604.32/604.53 c redcost : 0.00 0 0 0 0 0
604.32/604.53 c impliedbounds : 0.00 0 0 0 0 0
604.32/604.53 c intobj : 0.00 0 0 0 0 0
604.32/604.53 c cgmip : 0.00 0 0 0 0 0
604.32/604.53 c gomory : 0.00 0 0 0 0 0
604.32/604.53 c strongcg : 0.00 0 0 0 0 0
604.32/604.53 c cmir : 0.00 0 0 0 0 0
604.32/604.53 c flowcover : 0.00 0 0 0 0 0
604.32/604.53 c clique : 0.00 0 0 0 0 0
604.32/604.53 c zerohalf : 0.00 0 0 0 0 0
604.32/604.53 c mcf : 0.00 0 0 0 0 0
604.32/604.53 c rapidlearning : 0.00 0 0 0 0 0
604.32/604.53 c Pricers : Time Calls Vars
604.32/604.53 c problem variables: 0.00 0 0
604.32/604.53 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
604.32/604.53 c relpscost : 0.00 0 0 0 0 0 0
604.32/604.53 c pscost : 0.00 0 0 0 0 0 0
604.32/604.53 c inference : 9.52 343672 0 0 0 0 687344
604.32/604.53 c mostinf : 0.00 0 0 0 0 0 0
604.32/604.53 c leastinf : 0.00 0 0 0 0 0 0
604.32/604.53 c fullstrong : 0.00 0 0 0 0 0 0
604.32/604.53 c allfullstrong : 0.00 0 0 0 0 0 0
604.32/604.53 c random : 0.00 0 0 0 0 0 0
604.32/604.53 c Primal Heuristics : Time Calls Found
604.32/604.53 c LP solutions : 0.00 - 0
604.32/604.53 c pseudo solutions : 0.70 - 1
604.32/604.53 c trivial : 0.01 1 0
604.32/604.53 c simplerounding : 0.00 0 0
604.32/604.53 c zirounding : 0.00 0 0
604.32/604.53 c rounding : 0.00 0 0
604.32/604.53 c shifting : 0.00 0 0
604.32/604.53 c intshifting : 0.00 0 0
604.32/604.53 c oneopt : 0.00 0 0
604.32/604.53 c twoopt : 0.00 0 0
604.32/604.53 c fixandinfer : 0.00 0 0
604.32/604.53 c feaspump : 0.00 0 0
604.32/604.53 c coefdiving : 0.00 0 0
604.32/604.53 c pscostdiving : 0.00 0 0
604.32/604.53 c fracdiving : 0.00 0 0
604.32/604.53 c veclendiving : 0.00 0 0
604.32/604.53 c intdiving : 0.00 0 0
604.32/604.53 c actconsdiving : 0.00 0 0
604.32/604.53 c objpscostdiving : 0.00 0 0
604.32/604.53 c rootsoldiving : 0.00 0 0
604.32/604.53 c linesearchdiving : 0.00 0 0
604.32/604.53 c guideddiving : 0.00 0 0
604.32/604.53 c octane : 0.00 0 0
604.32/604.53 c rens : 0.00 0 0
604.32/604.53 c rins : 0.00 0 0
604.32/604.53 c localbranching : 0.00 0 0
604.32/604.53 c mutation : 0.00 0 0
604.32/604.53 c crossover : 0.00 0 0
604.32/604.53 c dins : 0.00 0 0
604.32/604.53 c undercover : 0.00 0 0
604.32/604.53 c nlp : 0.00 0 0
604.32/604.53 c trysol : 0.00 0 0
604.32/604.53 c LP : Time Calls Iterations Iter/call Iter/sec
604.32/604.53 c primal LP : 0.00 0 0 0.00 -
604.32/604.53 c dual LP : 0.00 0 0 0.00 -
604.32/604.53 c lex dual LP : 0.00 0 0 0.00 -
604.32/604.53 c barrier LP : 0.00 0 0 0.00 -
604.32/604.53 c diving/probing LP: 0.00 0 0 0.00 -
604.32/604.53 c strong branching : 0.00 0 0 0.00 -
604.32/604.53 c (at root node) : - 0 0 0.00 -
604.32/604.53 c conflict analysis: 0.00 0 0 0.00 -
604.32/604.53 c B&B Tree :
604.32/604.53 c number of runs : 1
604.32/604.53 c nodes : 409787
604.32/604.53 c nodes (total) : 409787
604.32/604.53 c nodes left : 0
604.32/604.53 c max depth : 104
604.32/604.53 c max depth (total): 104
604.32/604.53 c backtracks : 60765 (14.8%)
604.32/604.53 c delayed cutoffs : 53129
604.32/604.53 c repropagations : 179332 (2856748 domain reductions, 50535 cutoffs)
604.32/604.53 c avg switch length: 9.29
604.32/604.53 c switching time : 154.47
604.32/604.53 c Solution :
604.32/604.53 c Solutions found : 1 (1 improvements)
604.32/604.53 c First Solution : +0.00000000000000e+00 (in run 1, after 409787 nodes, 592.19 seconds, depth 46, found by <relaxation>)
604.32/604.53 c Primal Bound : +0.00000000000000e+00 (in run 1, after 409787 nodes, 592.19 seconds, depth 46, found by <relaxation>)
604.32/604.53 c Dual Bound : +0.00000000000000e+00
604.32/604.53 c Gap : 0.00 %
604.32/604.53 c Root Dual Bound : +0.00000000000000e+00
604.32/604.53 c Root Iterations : 0
604.42/604.60 c Time complete: 604.43.