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-2664272-1276270549.opb>
0.00/0.02 c original problem has 266 variables (266 bin, 0 int, 0 impl, 0 cont) and 573 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.02 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.00/0.03 c presolving:
0.00/0.03 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 302 impls, 0 clqs
0.00/0.03 c (round 2) 14 del vars, 18 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 302 impls, 0 clqs
0.00/0.03 c (round 3) 14 del vars, 29 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 302 impls, 0 clqs
0.05/0.05 c (round 4) 14 del vars, 29 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 544 upgd conss, 302 impls, 0 clqs
0.05/0.06 c (round 5) 20 del vars, 29 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 544 upgd conss, 6476 impls, 6 clqs
0.05/0.07 c presolving (6 rounds):
0.05/0.07 c 20 deleted vars, 29 deleted constraints, 12 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.05/0.07 c 6476 implications, 6 cliques
0.05/0.07 c presolved problem has 246 variables (246 bin, 0 int, 0 impl, 0 cont) and 544 constraints
0.05/0.07 c 162 constraints of type <knapsack>
0.05/0.07 c 382 constraints of type <logicor>
0.05/0.07 c transformed objective value is always integral (scale: 1)
0.05/0.07 c Presolving Time: 0.03
0.05/0.07 c - non default parameters ----------------------------------------------------------------------
0.05/0.07 c # SCIP version 1.2.1.2
0.05/0.07 c
0.05/0.07 c # frequency for displaying node information lines
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.05/0.07 c display/freq = 10000
0.05/0.07 c
0.05/0.07 c # maximal time in seconds to run
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.05/0.07 c limits/time = 1799.99
0.05/0.07 c
0.05/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.05/0.07 c limits/memory = 1620
0.05/0.07 c
0.05/0.07 c # solving stops, if the given number of solutions were found (-1: no limit)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.07 c limits/solutions = 1
0.05/0.07 c
0.05/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.07 c lp/solvefreq = -1
0.05/0.07 c
0.05/0.07 c # maximal number of separation rounds per node (-1: unlimited)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 5]
0.05/0.07 c separating/maxrounds = 1
0.05/0.07 c
0.05/0.07 c # maximal number of separation rounds in the root node (-1: unlimited)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.07 c separating/maxroundsroot = 5
0.05/0.07 c
0.05/0.07 c # should presolving try to simplify inequalities
0.05/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.07 c constraints/linear/simplifyinequalities = TRUE
0.05/0.07 c
0.05/0.07 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.05/0.07 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.05/0.07 c constraints/knapsack/disaggregation = FALSE
0.05/0.07 c
0.05/0.07 c # should presolving try to simplify knapsacks
0.05/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.05/0.07 c
0.05/0.07 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.07 c presolving/probing/maxrounds = 0
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.07 c heuristics/coefdiving/freq = -1
0.05/0.07 c
0.05/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.07 c heuristics/coefdiving/maxlpiterquot = 0.075
0.05/0.07 c
0.05/0.07 c # additional number of allowed LP iterations
0.05/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.07 c heuristics/coefdiving/maxlpiterofs = 1500
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 30]
0.05/0.07 c heuristics/crossover/freq = -1
0.05/0.07 c
0.05/0.07 c # number of nodes added to the contingent of the total nodes
0.05/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.05/0.07 c heuristics/crossover/nodesofs = 750
0.05/0.07 c
0.05/0.07 c # number of nodes without incumbent change that heuristic should wait
0.05/0.07 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.05/0.07 c heuristics/crossover/nwaitingnodes = 100
0.05/0.07 c
0.05/0.07 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.05/0.07 c # [type: real, range: [0,1], default: 0.1]
0.05/0.07 c heuristics/crossover/nodesquot = 0.15
0.05/0.07 c
0.05/0.07 c # minimum percentage of integer variables that have to be fixed
0.05/0.07 c # [type: real, range: [0,1], default: 0.666]
0.05/0.07 c heuristics/crossover/minfixingrate = 0.5
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.05/0.07 c heuristics/feaspump/freq = -1
0.05/0.07 c
0.05/0.07 c # additional number of allowed LP iterations
0.05/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.07 c heuristics/feaspump/maxlpiterofs = 2000
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.07 c heuristics/fracdiving/freq = -1
0.05/0.07 c
0.05/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.07 c heuristics/fracdiving/maxlpiterquot = 0.075
0.05/0.07 c
0.05/0.07 c # additional number of allowed LP iterations
0.05/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.07 c heuristics/fracdiving/maxlpiterofs = 1500
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.07 c heuristics/guideddiving/freq = -1
0.05/0.07 c
0.05/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.07 c heuristics/guideddiving/maxlpiterquot = 0.075
0.05/0.07 c
0.05/0.07 c # additional number of allowed LP iterations
0.05/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.07 c heuristics/guideddiving/maxlpiterofs = 1500
0.05/0.07 c
0.05/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.07 c heuristics/intdiving/maxlpiterquot = 0.075
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.07 c heuristics/intshifting/freq = -1
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.07 c heuristics/linesearchdiving/freq = -1
0.05/0.07 c
0.05/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.07 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.05/0.07 c
0.05/0.07 c # additional number of allowed LP iterations
0.05/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.07 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.07 c heuristics/nlp/freq = -1
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.05/0.07 c heuristics/objpscostdiving/freq = -1
0.05/0.07 c
0.05/0.07 c # maximal fraction of diving LP iterations compared to total iteration number
0.05/0.07 c # [type: real, range: [0,1], default: 0.01]
0.05/0.07 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.05/0.07 c
0.05/0.07 c # additional number of allowed LP iterations
0.05/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.07 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.07 c heuristics/oneopt/freq = -1
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.07 c heuristics/pscostdiving/freq = -1
0.05/0.07 c
0.05/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.07 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.05/0.07 c
0.05/0.07 c # additional number of allowed LP iterations
0.05/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.07 c heuristics/pscostdiving/maxlpiterofs = 1500
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.07 c heuristics/rens/freq = -1
0.05/0.07 c
0.05/0.07 c # minimum percentage of integer variables that have to be fixable
0.05/0.07 c # [type: real, range: [0,1], default: 0.5]
0.05/0.07 c heuristics/rens/minfixingrate = 0.3
0.05/0.07 c
0.05/0.07 c # number of nodes added to the contingent of the total nodes
0.05/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.05/0.07 c heuristics/rens/nodesofs = 2000
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.05/0.07 c heuristics/rootsoldiving/freq = -1
0.05/0.07 c
0.05/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.05/0.07 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.05/0.07 c
0.05/0.07 c # additional number of allowed LP iterations
0.05/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.07 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.07 c heuristics/rounding/freq = -1
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.07 c heuristics/shifting/freq = -1
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.07 c heuristics/simplerounding/freq = -1
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.07 c heuristics/trivial/freq = -1
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.07 c heuristics/trysol/freq = -1
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.07 c heuristics/veclendiving/freq = -1
0.05/0.07 c
0.05/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.07 c heuristics/veclendiving/maxlpiterquot = 0.075
0.05/0.07 c
0.05/0.07 c # additional number of allowed LP iterations
0.05/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.07 c heuristics/veclendiving/maxlpiterofs = 1500
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.07 c heuristics/zirounding/freq = -1
0.05/0.07 c
0.05/0.07 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.07 c separating/cmir/freq = -1
0.05/0.07 c
0.05/0.07 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.07 c separating/flowcover/freq = -1
0.05/0.07 c
0.05/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.07 c separating/rapidlearning/freq = 0
0.05/0.07 c
0.05/0.07 c -----------------------------------------------------------------------------------------------
0.05/0.07 c start solving
0.05/0.07 c
0.05/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.05/0.07 c 0.0s| 1 | 2 | 0 | - |1399k| 0 | - | 246 | 544 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.19/3.25 c 3.0s| 10000 | 4525 | 0 | 0.0 |6073k| 45 | - | 246 |1437 | 0 | 0 | 0 |2320 | 0 | 0.000000e+00 | -- | Inf
7.19/7.27 c 6.7s| 20000 | 8274 | 0 | 0.0 | 10M| 45 | - | 246 |1797 | 0 | 0 | 0 |5034 | 0 | 0.000000e+00 | -- | Inf
11.08/11.17 c 10.4s| 30000 | 12677 | 0 | 0.0 | 14M| 45 | - | 246 |2376 | 0 | 0 | 0 |7228 | 0 | 0.000000e+00 | -- | Inf
16.09/16.19 c 15.2s| 40000 | 16026 | 0 | 0.0 | 18M| 45 | - | 246 |3133 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
23.09/23.13 c 21.8s| 50000 | 18013 | 0 | 0.0 | 20M| 45 | - | 246 |3612 | 0 | 0 | 0 | 13k| 0 | 0.000000e+00 | -- | Inf
28.78/28.87 c 27.3s| 60000 | 21446 | 0 | 0.0 | 24M| 45 | - | 246 |3296 | 0 | 0 | 0 | 16k| 0 | 0.000000e+00 | -- | Inf
34.98/35.04 c 33.2s| 70000 | 24875 | 0 | 0.0 | 27M| 45 | - | 246 |4050 | 0 | 0 | 0 | 18k| 0 | 0.000000e+00 | -- | Inf
41.98/42.05 c 39.9s| 80000 | 27723 | 0 | 0.0 | 31M| 45 | - | 246 |4471 | 0 | 0 | 0 | 21k| 0 | 0.000000e+00 | -- | Inf
49.28/49.30 c 46.9s| 90000 | 30541 | 0 | 0.0 | 34M| 45 | - | 246 |4811 | 0 | 0 | 0 | 23k| 0 | 0.000000e+00 | -- | Inf
57.38/57.42 c 54.7s|100000 | 32812 | 0 | 0.0 | 37M| 45 | - | 246 |5137 | 0 | 0 | 0 | 26k| 0 | 0.000000e+00 | -- | Inf
66.47/66.52 c 63.6s|110000 | 35041 | 0 | 0.0 | 40M| 45 | - | 246 |5295 | 0 | 0 | 0 | 29k| 0 | 0.000000e+00 | -- | Inf
76.77/76.87 c 73.7s|120000 | 36595 | 0 | 0.0 | 42M| 45 | - | 246 |5709 | 0 | 0 | 0 | 33k| 0 | 0.000000e+00 | -- | Inf
89.16/89.25 c 85.7s|130000 | 37224 | 0 | 0.0 | 43M| 45 | - | 246 |4674 | 0 | 0 | 0 | 36k| 0 | 0.000000e+00 | -- | Inf
97.16/97.24 c 93.4s|140000 | 40307 | 0 | 0.0 | 47M| 45 | - | 246 |4798 | 0 | 0 | 0 | 39k| 0 | 0.000000e+00 | -- | Inf
106.06/106.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
106.06/106.10 c 102s|150000 | 43106 | 0 | 0.0 | 50M| 45 | - | 246 |5479 | 0 | 0 | 0 | 41k| 0 | 0.000000e+00 | -- | Inf
115.76/115.82 c 112s|160000 | 45630 | 0 | 0.0 | 53M| 45 | - | 246 |6085 | 0 | 0 | 0 | 44k| 0 | 0.000000e+00 | -- | Inf
126.25/126.33 c 122s|170000 | 47905 | 0 | 0.0 | 56M| 45 | - | 246 |6564 | 0 | 0 | 0 | 47k| 0 | 0.000000e+00 | -- | Inf
137.95/138.01 c 133s|180000 | 49618 | 0 | 0.0 | 59M| 45 | - | 246 |6941 | 0 | 0 | 0 | 50k| 0 | 0.000000e+00 | -- | Inf
150.14/150.22 c 145s|190000 | 51313 | 0 | 0.0 | 61M| 45 | - | 246 |7149 | 0 | 0 | 0 | 53k| 0 | 0.000000e+00 | -- | Inf
162.85/162.91 c 157s|200000 | 52609 | 0 | 0.0 | 64M| 45 | - | 246 |7419 | 0 | 0 | 0 | 57k| 0 | 0.000000e+00 | -- | Inf
175.74/175.85 c 170s|210000 | 53911 | 0 | 0.0 | 66M| 45 | - | 246 |7780 | 0 | 0 | 0 | 60k| 0 | 0.000000e+00 | -- | Inf
190.04/190.16 c 184s|220000 | 54960 | 0 | 0.0 | 68M| 45 | - | 246 |8026 | 0 | 0 | 0 | 63k| 0 | 0.000000e+00 | -- | Inf
205.43/205.53 c 199s|230000 | 55779 | 0 | 0.0 | 69M| 45 | - | 246 |8317 | 0 | 0 | 0 | 66k| 0 | 0.000000e+00 | -- | Inf
222.72/222.80 c 216s|240000 | 55913 | 0 | 0.0 | 70M| 45 | - | 246 |8450 | 0 | 0 | 0 | 70k| 0 | 0.000000e+00 | -- | Inf
242.62/242.77 c 236s|250000 | 55181 | 0 | 0.0 | 71M| 45 | - | 246 |8549 | 0 | 0 | 0 | 73k| 0 | 0.000000e+00 | -- | Inf
258.71/258.84 c 252s|260000 | 55979 | 0 | 0.0 | 72M| 45 | - | 246 |6422 | 0 | 0 | 0 | 77k| 0 | 0.000000e+00 | -- | Inf
271.30/271.41 c 264s|270000 | 58089 | 0 | 0.0 | 75M| 45 | - | 246 |6882 | 0 | 0 | 0 | 80k| 0 | 0.000000e+00 | -- | Inf
284.90/285.07 c 277s|280000 | 59692 | 0 | 0.0 | 77M| 45 | - | 246 |7562 | 0 | 0 | 0 | 83k| 0 | 0.000000e+00 | -- | Inf
299.39/299.51 c 291s|290000 | 61347 | 0 | 0.0 | 80M| 45 | - | 246 |7954 | 0 | 0 | 0 | 86k| 0 | 0.000000e+00 | -- | Inf
315.09/315.21 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
315.09/315.21 c 307s|300000 | 62501 | 0 | 0.0 | 82M| 45 | - | 246 |8446 | 0 | 0 | 0 | 89k| 0 | 0.000000e+00 | -- | Inf
331.89/332.06 c 323s|310000 | 63497 | 0 | 0.0 | 84M| 45 | - | 246 |8904 | 0 | 0 | 0 | 93k| 0 | 0.000000e+00 | -- | Inf
349.99/350.18 c 341s|320000 | 64323 | 0 | 0.0 | 85M| 45 | - | 246 |9332 | 0 | 0 | 0 | 96k| 0 | 0.000000e+00 | -- | Inf
368.18/368.36 c 359s|330000 | 65134 | 0 | 0.0 | 87M| 45 | - | 246 |9611 | 0 | 0 | 0 | 100k| 0 | 0.000000e+00 | -- | Inf
385.98/386.20 c 377s|340000 | 65939 | 0 | 0.0 | 88M| 45 | - | 246 |9748 | 0 | 0 | 0 | 103k| 0 | 0.000000e+00 | -- | Inf
405.27/405.47 c 396s|350000 | 66150 | 0 | 0.0 | 90M| 45 | - | 246 | 10k| 0 | 0 | 0 | 106k| 0 | 0.000000e+00 | -- | Inf
425.76/425.90 c 416s|360000 | 66164 | 0 | 0.0 | 90M| 45 | - | 246 | 10k| 0 | 0 | 0 | 110k| 0 | 0.000000e+00 | -- | Inf
447.47/447.70 c 437s|370000 | 65773 | 0 | 0.0 | 91M| 45 | - | 246 | 10k| 0 | 0 | 0 | 114k| 0 | 0.000000e+00 | -- | Inf
471.46/471.63 c 461s|380000 | 64867 | 0 | 0.0 | 91M| 45 | - | 246 | 10k| 0 | 0 | 0 | 117k| 0 | 0.000000e+00 | -- | Inf
497.25/497.41 c 486s|390000 | 63417 | 0 | 0.0 | 90M| 45 | - | 246 | 10k| 0 | 0 | 0 | 121k| 0 | 0.000000e+00 | -- | Inf
525.55/525.76 c 514s|400000 | 61556 | 0 | 0.0 | 88M| 45 | - | 246 |9590 | 0 | 0 | 0 | 125k| 0 | 0.000000e+00 | -- | Inf
547.54/547.72 c 536s|410000 | 62060 | 0 | 0.0 | 90M| 45 | - | 246 |9441 | 0 | 0 | 0 | 129k| 0 | 0.000000e+00 | -- | Inf
569.13/569.30 c 557s|420000 | 62736 | 0 | 0.0 | 92M| 45 | - | 246 |9929 | 0 | 0 | 0 | 132k| 0 | 0.000000e+00 | -- | Inf
584.83/585.04 c * 573s|426511 | 0 | 0 | 0.0 |6730k| 45 | - | 246 | 10k| 0 | 0 | 0 | 135k| 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
584.83/585.04 c
584.83/585.04 c SCIP Status : problem is solved [optimal solution found]
584.83/585.04 c Solving Time (sec) : 572.79
584.83/585.04 c Solving Nodes : 426511
584.83/585.04 c Primal Bound : +0.00000000000000e+00 (1 solutions)
584.83/585.04 c Dual Bound : +0.00000000000000e+00
584.83/585.04 c Gap : 0.00 %
584.83/585.04 s SATISFIABLE
584.83/585.04 v x265 -x266 -x263 x264 x261 -x262 -x259 x260 x257 -x258 -x255 x256 -x253 -x254 -x251 x252 -x249 x250 -x247 -x248 -x245 -x246 x243
584.83/585.04 v -x244 -x241 x242 x239 -x240 -x237 x238 x235 -x236 -x233 x234 x231 -x232 -x229 x230 x227 -x228 -x225 x226 -x223 -x224 -x221
584.83/585.04 v x222 -x219 -x220 -x217 x218 -x215 x216 -x213 -x214 -x211 x212 x209 -x210 -x207 x208 x205 -x206 -x203 x204 x201 -x202 -x199 x200
584.83/585.04 v -x197 x198 x195 -x196 x193 -x194 x191 -x192 -x189 x190 x187 -x188 -x185 x186 x183 -x184 -x181 x182 -x179 x180 x177 -x178 x175
584.83/585.04 v -x176 x173 -x174 x171 -x172 x169 -x170 -x167 x168 x165 -x166 -x163 x164 -x162 -x160 -x158 -x156 -x154 -x152 -x150 -x148 -x146
584.83/585.04 v -x144 -x142 x140 -x138 -x136 -x134 -x132 -x130 -x128 -x126 x124 -x122 x120 -x118 x116 -x114 x112 -x110 -x108 -x106 x104
584.83/585.04 v -x102 -x100 -x98 -x96 -x94 -x92 -x90 x88 -x86 x84 -x82 x80 -x78 x76 -x74 -x72 -x70 x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52
584.83/585.04 v -x50 -x48 -x46 -x44 -x42 -x40 -x38 -x36 -x34 x32 -x30 -x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 x161
584.83/585.04 v -x159 -x157 -x155 x153 -x151 x149 -x147 x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131 -x129 -x127 -x125 -x123 -x121 -x119
584.83/585.04 v -x117 -x115 -x113 -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71
584.83/585.04 v -x69 -x67 -x65 -x63 -x61 -x59 -x57 -x55 x53 -x51 -x49 -x47 x45 -x43 x41 -x39 x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21
584.83/585.04 v -x19 x17 -x15 -x13 -x11 x9 -x7 x5 -x3 x1
584.83/585.04 c SCIP Status : problem is solved [optimal solution found]
584.83/585.04 c Solving Time : 572.79
584.83/585.04 c Original Problem :
584.83/585.04 c Problem name : HOME/instance-2664272-1276270549.opb
584.83/585.04 c Variables : 266 (266 binary, 0 integer, 0 implicit integer, 0 continuous)
584.83/585.04 c Constraints : 573 initial, 573 maximal
584.83/585.04 c Presolved Problem :
584.83/585.04 c Problem name : t_HOME/instance-2664272-1276270549.opb
584.83/585.04 c Variables : 246 (246 binary, 0 integer, 0 implicit integer, 0 continuous)
584.83/585.04 c Constraints : 544 initial, 10991 maximal
584.83/585.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
584.83/585.04 c trivial : 0.00 0 0 0 0 0 0 0 0
584.83/585.04 c dualfix : 0.00 0 0 0 0 0 0 0 0
584.83/585.04 c boundshift : 0.00 0 0 0 0 0 0 0 0
584.83/585.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0
584.83/585.04 c implics : 0.00 0 8 0 0 0 0 0 0
584.83/585.04 c probing : 0.00 0 0 0 0 0 0 0 0
584.83/585.04 c knapsack : 0.00 0 0 0 0 0 0 0 0
584.83/585.04 c linear : 0.01 12 0 0 12 0 29 0 0
584.83/585.04 c logicor : 0.02 0 0 0 0 0 0 0 0
584.83/585.04 c root node : - 0 - - 0 - - - -
584.83/585.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
584.83/585.04 c integral : 0 0 0 0 0 0 0 0 0 0
584.83/585.04 c knapsack : 162 0 1582286 0 263845 151585 5070392 0 0 0
584.83/585.04 c logicor : 382+ 0 1237050 0 263845 45331 2896429 0 0 0
584.83/585.04 c countsols : 0 0 0 0 263845 0 0 0 0 0
584.83/585.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
584.83/585.04 c integral : 0.00 0.00 0.00 0.00 0.00
584.83/585.04 c knapsack : 62.08 0.00 58.96 0.00 3.12
584.83/585.04 c logicor : 270.92 0.00 262.98 0.00 7.94
584.83/585.04 c countsols : 0.19 0.00 0.00 0.00 0.19
584.83/585.04 c Propagators : Time Calls Cutoffs DomReds
584.83/585.04 c vbounds : 1.05 1 0 0
584.83/585.04 c rootredcost : 0.79 0 0 0
584.83/585.04 c pseudoobj : 0.61 0 0 0
584.83/585.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
584.83/585.04 c propagation : 24.86 104955 100436 1081356 54.8 1515 24.6 -
584.83/585.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
584.83/585.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
584.83/585.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
584.83/585.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
584.83/585.04 c applied globally : - - - 133035 19.1 - - -
584.83/585.04 c applied locally : - - - 2003 56.1 - - -
584.83/585.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
584.83/585.04 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
584.83/585.04 c redcost : 0.00 0 0 0 0 0
584.83/585.04 c impliedbounds : 0.00 0 0 0 0 0
584.83/585.04 c intobj : 0.00 0 0 0 0 0
584.83/585.04 c cgmip : 0.00 0 0 0 0 0
584.83/585.04 c gomory : 0.00 0 0 0 0 0
584.83/585.04 c strongcg : 0.00 0 0 0 0 0
584.83/585.04 c cmir : 0.00 0 0 0 0 0
584.83/585.04 c flowcover : 0.00 0 0 0 0 0
584.83/585.04 c clique : 0.00 0 0 0 0 0
584.83/585.04 c zerohalf : 0.00 0 0 0 0 0
584.83/585.04 c mcf : 0.00 0 0 0 0 0
584.83/585.04 c rapidlearning : 0.00 0 0 0 0 0
584.83/585.04 c Pricers : Time Calls Vars
584.83/585.04 c problem variables: 0.00 0 0
584.83/585.04 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
584.83/585.04 c relpscost : 0.00 0 0 0 0 0 0
584.83/585.04 c pscost : 0.00 0 0 0 0 0 0
584.83/585.04 c inference : 5.43 263844 0 0 0 0 527688
584.83/585.04 c mostinf : 0.00 0 0 0 0 0 0
584.83/585.04 c leastinf : 0.00 0 0 0 0 0 0
584.83/585.04 c fullstrong : 0.00 0 0 0 0 0 0
584.83/585.04 c allfullstrong : 0.00 0 0 0 0 0 0
584.83/585.04 c random : 0.00 0 0 0 0 0 0
584.83/585.04 c Primal Heuristics : Time Calls Found
584.83/585.04 c LP solutions : 0.00 - 0
584.83/585.04 c pseudo solutions : 0.39 - 1
584.83/585.04 c trivial : 0.00 1 0
584.83/585.04 c simplerounding : 0.00 0 0
584.83/585.04 c zirounding : 0.00 0 0
584.83/585.04 c rounding : 0.00 0 0
584.83/585.04 c shifting : 0.00 0 0
584.83/585.04 c intshifting : 0.00 0 0
584.83/585.04 c oneopt : 0.00 0 0
584.83/585.04 c twoopt : 0.00 0 0
584.83/585.04 c fixandinfer : 0.00 0 0
584.83/585.04 c feaspump : 0.00 0 0
584.83/585.04 c coefdiving : 0.00 0 0
584.83/585.04 c pscostdiving : 0.00 0 0
584.83/585.04 c fracdiving : 0.00 0 0
584.83/585.04 c veclendiving : 0.00 0 0
584.83/585.04 c intdiving : 0.00 0 0
584.83/585.04 c actconsdiving : 0.00 0 0
584.83/585.04 c objpscostdiving : 0.00 0 0
584.83/585.04 c rootsoldiving : 0.00 0 0
584.83/585.04 c linesearchdiving : 0.00 0 0
584.83/585.04 c guideddiving : 0.00 0 0
584.83/585.04 c octane : 0.00 0 0
584.83/585.04 c rens : 0.00 0 0
584.83/585.04 c rins : 0.00 0 0
584.83/585.04 c localbranching : 0.00 0 0
584.83/585.04 c mutation : 0.00 0 0
584.83/585.04 c crossover : 0.00 0 0
584.83/585.04 c dins : 0.00 0 0
584.83/585.04 c undercover : 0.00 0 0
584.83/585.04 c nlp : 0.00 0 0
584.83/585.04 c trysol : 0.00 0 0
584.83/585.04 c LP : Time Calls Iterations Iter/call Iter/sec
584.83/585.04 c primal LP : 0.00 0 0 0.00 -
584.83/585.04 c dual LP : 0.00 0 0 0.00 -
584.83/585.04 c lex dual LP : 0.00 0 0 0.00 -
584.83/585.04 c barrier LP : 0.00 0 0 0.00 -
584.83/585.04 c diving/probing LP: 0.00 0 0 0.00 -
584.83/585.04 c strong branching : 0.00 0 0 0.00 -
584.83/585.04 c (at root node) : - 0 0 0.00 -
584.83/585.04 c conflict analysis: 0.00 0 0 0.00 -
584.83/585.04 c B&B Tree :
584.83/585.04 c number of runs : 1
584.83/585.04 c nodes : 426511
584.83/585.04 c nodes (total) : 426511
584.83/585.04 c nodes left : 0
584.83/585.04 c max depth : 45
584.83/585.04 c max depth (total): 45
584.83/585.04 c backtracks : 102961 (24.1%)
584.83/585.04 c delayed cutoffs : 38440
584.83/585.04 c repropagations : 132493 (1258734 domain reductions, 34250 cutoffs)
584.83/585.04 c avg switch length: 10.80
584.83/585.04 c switching time : 165.88
584.83/585.04 c Solution :
584.83/585.04 c Solutions found : 1 (1 improvements)
584.83/585.04 c First Solution : +0.00000000000000e+00 (in run 1, after 426511 nodes, 572.40 seconds, depth 23, found by <relaxation>)
584.83/585.04 c Primal Bound : +0.00000000000000e+00 (in run 1, after 426511 nodes, 572.40 seconds, depth 23, found by <relaxation>)
584.83/585.04 c Dual Bound : +0.00000000000000e+00
584.83/585.04 c Gap : 0.00 %
584.83/585.04 c Root Dual Bound : +0.00000000000000e+00
584.83/585.04 c Root Iterations : 0
584.83/585.09 c Time complete: 584.92.