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-2664270-1276269625.opb>
0.00/0.01 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 332 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.01 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.02 c presolving:
0.01/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 252 impls, 0 clqs
0.01/0.04 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.01/0.04 c presolving (3 rounds):
0.01/0.04 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.04 c 5244 implications, 0 cliques
0.01/0.04 c presolved problem has 212 variables (212 bin, 0 int, 0 impl, 0 cont) and 332 constraints
0.01/0.04 c 130 constraints of type <knapsack>
0.01/0.04 c 202 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.02
0.01/0.04 c - non default parameters ----------------------------------------------------------------------
0.01/0.04 c # SCIP version 1.2.1.2
0.01/0.04 c
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = 10000
0.01/0.04 c
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = 1799.99
0.01/0.04 c
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = 1620
0.01/0.04 c
0.01/0.04 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c limits/solutions = 1
0.01/0.04 c
0.01/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c lp/solvefreq = -1
0.01/0.04 c
0.01/0.04 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.04 c separating/maxrounds = 1
0.01/0.04 c
0.01/0.04 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c separating/maxroundsroot = 5
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.04 c constraints/knapsack/disaggregation = FALSE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c presolving/probing/maxrounds = 0
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/coefdiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.04 c heuristics/crossover/freq = -1
0.01/0.04 c
0.01/0.04 c # number of nodes added to the contingent of the total nodes
0.01/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.04 c heuristics/crossover/nodesofs = 750
0.01/0.04 c
0.01/0.04 c # number of nodes without incumbent change that heuristic should wait
0.01/0.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.04 c heuristics/crossover/nwaitingnodes = 100
0.01/0.04 c
0.01/0.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.04 c # [type: real, range: [0,1], default: 0.1]
0.01/0.04 c heuristics/crossover/nodesquot = 0.15
0.01/0.04 c
0.01/0.04 c # minimum percentage of integer variables that have to be fixed
0.01/0.04 c # [type: real, range: [0,1], default: 0.666]
0.01/0.04 c heuristics/crossover/minfixingrate = 0.5
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04 c heuristics/feaspump/freq = -1
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/fracdiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/guideddiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/intshifting/freq = -1
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/linesearchdiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c heuristics/nlp/freq = -1
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04 c heuristics/objpscostdiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.04 c # [type: real, range: [0,1], default: 0.01]
0.01/0.04 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c heuristics/oneopt/freq = -1
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/pscostdiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c heuristics/rens/freq = -1
0.01/0.04 c
0.01/0.04 c # minimum percentage of integer variables that have to be fixable
0.01/0.04 c # [type: real, range: [0,1], default: 0.5]
0.01/0.04 c heuristics/rens/minfixingrate = 0.3
0.01/0.04 c
0.01/0.04 c # number of nodes added to the contingent of the total nodes
0.01/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.04 c heuristics/rens/nodesofs = 2000
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04 c heuristics/rootsoldiving/freq = -1
0.01/0.04 c
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.04 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.04 c
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05 c heuristics/rounding/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05 c heuristics/shifting/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05 c heuristics/simplerounding/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05 c heuristics/trivial/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05 c heuristics/trysol/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05 c heuristics/veclendiving/freq = -1
0.01/0.05 c
0.01/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.05 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.05 c
0.01/0.05 c # additional number of allowed LP iterations
0.01/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.05 c
0.01/0.05 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05 c heuristics/zirounding/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05 c separating/cmir/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05 c separating/flowcover/freq = -1
0.01/0.05 c
0.01/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.05 c separating/rapidlearning/freq = 0
0.01/0.05 c
0.01/0.05 c -----------------------------------------------------------------------------------------------
0.01/0.05 c start solving
0.01/0.05 c
0.01/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.05 c 0.0s| 1 | 2 | 0 | - |1066k| 0 | - | 212 | 332 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.09 c 1.9s| 10000 | 6179 | 0 | 0.0 |4890k| 58 | - | 212 | 824 | 0 | 0 | 0 |1886 | 0 | 0.000000e+00 | -- | Inf
4.19/4.20 c 3.8s| 20000 | 12546 | 0 | 0.0 |8584k| 59 | - | 212 | 937 | 0 | 0 | 0 |3615 | 0 | 0.000000e+00 | -- | Inf
6.29/6.37 c 5.8s| 30000 | 18931 | 0 | 0.0 | 12M| 59 | - | 212 |1125 | 0 | 0 | 0 |5538 | 0 | 0.000000e+00 | -- | Inf
8.59/8.67 c 7.9s| 40000 | 25077 | 0 | 0.0 | 15M| 59 | - | 212 |1194 | 0 | 0 | 0 |7803 | 0 | 0.000000e+00 | -- | Inf
11.00/11.07 c 10.1s| 50000 | 31067 | 0 | 0.0 | 19M| 59 | - | 212 |1157 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
13.58/13.60 c 12.4s| 60000 | 36587 | 0 | 0.0 | 23M| 59 | - | 212 |1178 | 0 | 0 | 0 | 13k| 0 | 0.000000e+00 | -- | Inf
16.50/16.54 c 15.1s| 70000 | 41078 | 0 | 0.0 | 27M| 59 | - | 212 |1417 | 0 | 0 | 0 | 16k| 0 | 0.000000e+00 | -- | Inf
19.79/19.84 c 18.2s| 80000 | 44475 | 0 | 0.0 | 30M| 60 | - | 212 |1772 | 0 | 0 | 0 | 21k| 0 | 0.000000e+00 | -- | Inf
22.99/23.03 c 21.1s| 90000 | 48568 | 0 | 0.0 | 34M| 60 | - | 212 |1937 | 0 | 0 | 0 | 25k| 0 | 0.000000e+00 | -- | Inf
26.09/26.16 c 24.0s|100000 | 53350 | 0 | 0.0 | 38M| 60 | - | 212 |1853 | 0 | 0 | 0 | 29k| 0 | 0.000000e+00 | -- | Inf
29.28/29.37 c 27.0s|110000 | 58224 | 0 | 0.0 | 41M| 60 | - | 212 |2116 | 0 | 0 | 0 | 32k| 0 | 0.000000e+00 | -- | Inf
32.58/32.60 c 30.0s|120000 | 63239 | 0 | 0.0 | 45M| 60 | - | 212 |1986 | 0 | 0 | 0 | 34k| 0 | 0.000000e+00 | -- | Inf
35.78/35.80 c 33.0s|130000 | 68326 | 0 | 0.0 | 49M| 60 | - | 212 |1889 | 0 | 0 | 0 | 37k| 0 | 0.000000e+00 | -- | Inf
38.98/39.00 c 36.0s|140000 | 73368 | 0 | 0.0 | 52M| 60 | - | 212 |1871 | 0 | 0 | 0 | 40k| 0 | 0.000000e+00 | -- | Inf
42.08/42.16 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
42.08/42.16 c 39.0s|150000 | 78505 | 0 | 0.0 | 55M| 60 | - | 212 |1842 | 0 | 0 | 0 | 44k| 0 | 0.000000e+00 | -- | Inf
45.18/45.26 c 41.9s|160000 | 83775 | 0 | 0.0 | 59M| 60 | - | 212 |1751 | 0 | 0 | 0 | 47k| 0 | 0.000000e+00 | -- | Inf
48.29/48.37 c 44.7s|170000 | 88960 | 0 | 0.0 | 62M| 60 | - | 212 |1662 | 0 | 0 | 0 | 50k| 0 | 0.000000e+00 | -- | Inf
51.38/51.43 c 47.6s|180000 | 94275 | 0 | 0.0 | 66M| 60 | - | 212 |1590 | 0 | 0 | 0 | 53k| 0 | 0.000000e+00 | -- | Inf
54.48/54.51 c 50.5s|190000 | 99452 | 0 | 0.0 | 69M| 60 | - | 212 |1697 | 0 | 0 | 0 | 57k| 0 | 0.000000e+00 | -- | Inf
57.68/57.70 c 53.4s|200000 |104496 | 0 | 0.0 | 73M| 60 | - | 212 |1791 | 0 | 0 | 0 | 60k| 0 | 0.000000e+00 | -- | Inf
60.98/61.05 c 56.5s|210000 |109294 | 0 | 0.0 | 77M| 60 | - | 212 |1760 | 0 | 0 | 0 | 64k| 0 | 0.000000e+00 | -- | Inf
64.38/64.44 c 59.7s|220000 |113979 | 0 | 0.0 | 80M| 60 | - | 212 |1843 | 0 | 0 | 0 | 68k| 0 | 0.000000e+00 | -- | Inf
67.87/67.92 c 63.0s|230000 |118563 | 0 | 0.0 | 84M| 60 | - | 212 |1837 | 0 | 0 | 0 | 72k| 0 | 0.000000e+00 | -- | Inf
71.27/71.39 c 66.2s|240000 |123094 | 0 | 0.0 | 87M| 60 | - | 212 |1871 | 0 | 0 | 0 | 76k| 0 | 0.000000e+00 | -- | Inf
74.97/75.09 c 69.7s|250000 |127361 | 0 | 0.0 | 91M| 60 | - | 212 |1896 | 0 | 0 | 0 | 81k| 0 | 0.000000e+00 | -- | Inf
78.87/78.94 c 73.3s|260000 |131303 | 0 | 0.0 | 94M| 60 | - | 212 |1923 | 0 | 0 | 0 | 85k| 0 | 0.000000e+00 | -- | Inf
82.77/82.87 c 77.0s|270000 |135051 | 0 | 0.0 | 97M| 60 | - | 212 |1941 | 0 | 0 | 0 | 90k| 0 | 0.000000e+00 | -- | Inf
86.87/86.91 c 80.8s|280000 |138652 | 0 | 0.0 | 101M| 60 | - | 212 |1958 | 0 | 0 | 0 | 94k| 0 | 0.000000e+00 | -- | Inf
90.97/91.08 c 84.8s|290000 |141981 | 0 | 0.0 | 104M| 60 | - | 212 |2155 | 0 | 0 | 0 | 99k| 0 | 0.000000e+00 | -- | Inf
95.47/95.55 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
95.47/95.55 c 89.0s|300000 |145120 | 0 | 0.0 | 107M| 60 | - | 212 |2124 | 0 | 0 | 0 | 104k| 0 | 0.000000e+00 | -- | Inf
99.97/100.10 c 93.3s|310000 |148131 | 0 | 0.0 | 110M| 60 | - | 212 |2329 | 0 | 0 | 0 | 110k| 0 | 0.000000e+00 | -- | Inf
104.97/105.08 c 98.0s|320000 |150664 | 0 | 0.0 | 113M| 60 | - | 212 |2446 | 0 | 0 | 0 | 116k| 0 | 0.000000e+00 | -- | Inf
110.67/110.71 c 103s|330000 |152515 | 0 | 0.0 | 115M| 61 | - | 212 |2659 | 0 | 0 | 0 | 122k| 0 | 0.000000e+00 | -- | Inf
116.36/116.42 c * 109s|339442 | 0 | 0 | 0.0 |2173k| 62 | - | 212 |1523 | 0 | 0 | 0 | 129k| 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
116.36/116.42 c
116.36/116.42 c SCIP Status : problem is solved [optimal solution found]
116.36/116.42 c Solving Time (sec) : 108.77
116.36/116.42 c Solving Nodes : 339442
116.36/116.42 c Primal Bound : +0.00000000000000e+00 (1 solutions)
116.36/116.42 c Dual Bound : +0.00000000000000e+00
116.36/116.42 c Gap : 0.00 %
116.36/116.42 s SATISFIABLE
116.36/116.42 v -x219 x220 -x217 x218 x215 -x216 x213 -x214 x211 -x212 -x209 -x210 -x207 -x208 -x205 -x206 -x203 -x204 x201 -x202 x199 -x200 x197
116.36/116.42 v -x198 x195 -x196 x193 -x194 x191 -x192 -x189 x190 -x187 x188 -x185 x186 -x183 x184 -x181 x182 -x179 x180 -x177 x178 -x175
116.36/116.42 v -x176 -x173 -x174 -x171 x172 -x169 x170 x167 -x168 x165 -x166 -x163 x164 -x161 x162 x159 -x160 x157 -x158 x155 -x156 x153 -x154
116.36/116.42 v -x151 x152 -x149 x150 -x147 x148 -x145 x146 x143 -x144 x141 -x142 -x139 x140 x137 -x138 x135 -x136 x133 -x134 -x131 x132 -x129
116.36/116.42 v x130 -x128 -x126 x124 x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 x106 -x104 -x102 -x100 -x98 -x96 -x94 -x92 -x90 -x88
116.36/116.42 v -x86 -x84 -x82 x80 -x78 -x76 -x74 -x72 -x70 -x68 -x66 x64 x62 -x60 -x58 -x56 -x54 -x52 -x50 x48 x46 x44 -x42 -x40 -x38 -x36
116.36/116.42 v -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x127 -x125 -x123 -x121 -x119 -x117 -x115 -x113
116.36/116.42 v -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 x83 x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65
116.36/116.42 v -x63 -x61 -x59 -x57 -x55 -x53 -x51 -x49 -x47 -x45 -x43 -x41 -x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 x23 x21 x19 x17 -x15
116.36/116.42 v -x13 -x11 -x9 -x7 x5 x3 x1
116.36/116.42 c SCIP Status : problem is solved [optimal solution found]
116.36/116.42 c Solving Time : 108.77
116.36/116.42 c Original Problem :
116.36/116.42 c Problem name : HOME/instance-2664270-1276269625.opb
116.36/116.42 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
116.36/116.42 c Constraints : 332 initial, 332 maximal
116.36/116.42 c Presolved Problem :
116.36/116.42 c Problem name : t_HOME/instance-2664270-1276269625.opb
116.36/116.42 c Variables : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
116.36/116.42 c Constraints : 332 initial, 3087 maximal
116.36/116.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
116.36/116.42 c trivial : 0.00 0 0 0 0 0 0 0 0
116.36/116.42 c dualfix : 0.00 0 0 0 0 0 0 0 0
116.36/116.42 c boundshift : 0.00 0 0 0 0 0 0 0 0
116.36/116.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0
116.36/116.42 c implics : 0.00 0 8 0 0 0 0 0 0
116.36/116.42 c probing : 0.00 0 0 0 0 0 0 0 0
116.36/116.42 c knapsack : 0.00 0 0 0 0 0 0 0 0
116.36/116.42 c logicor : 0.01 0 0 0 0 0 0 0 0
116.36/116.42 c root node : - 0 - - 0 - - - -
116.36/116.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
116.36/116.42 c integral : 0 0 0 0 0 0 0 0 0 0
116.36/116.42 c knapsack : 130 0 973628 0 259277 93416 2916644 0 0 0
116.36/116.42 c logicor : 202+ 0 579078 0 259278 9820 1589372 0 0 0
116.36/116.42 c countsols : 0 0 0 0 259278 0 0 0 0 0
116.36/116.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
116.36/116.42 c integral : 0.00 0.00 0.00 0.00 0.00
116.36/116.42 c knapsack : 33.72 0.00 32.58 0.00 1.14
116.36/116.42 c logicor : 25.58 0.00 21.46 0.00 4.12
116.36/116.42 c countsols : 0.09 0.00 0.00 0.00 0.09
116.36/116.42 c Propagators : Time Calls Cutoffs DomReds
116.36/116.42 c vbounds : 0.44 1 0 0
116.36/116.42 c rootredcost : 0.34 0 0 0
116.36/116.42 c pseudoobj : 0.43 0 0 0
116.36/116.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
116.36/116.42 c propagation : 18.87 103235 84180 657748 57.5 605 42.4 -
116.36/116.42 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
116.36/116.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
116.36/116.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
116.36/116.42 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
116.36/116.42 c applied globally : - - - 94728 18.1 - - -
116.36/116.42 c applied locally : - - - 34339 39.7 - - -
116.36/116.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
116.36/116.42 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
116.36/116.42 c redcost : 0.00 0 0 0 0 0
116.36/116.42 c impliedbounds : 0.00 0 0 0 0 0
116.36/116.42 c intobj : 0.00 0 0 0 0 0
116.36/116.42 c cgmip : 0.00 0 0 0 0 0
116.36/116.42 c gomory : 0.00 0 0 0 0 0
116.36/116.42 c strongcg : 0.00 0 0 0 0 0
116.36/116.42 c cmir : 0.00 0 0 0 0 0
116.36/116.42 c flowcover : 0.00 0 0 0 0 0
116.36/116.42 c clique : 0.00 0 0 0 0 0
116.36/116.42 c zerohalf : 0.00 0 0 0 0 0
116.36/116.42 c mcf : 0.00 0 0 0 0 0
116.36/116.42 c rapidlearning : 0.00 0 0 0 0 0
116.36/116.42 c Pricers : Time Calls Vars
116.36/116.42 c problem variables: 0.00 0 0
116.36/116.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
116.36/116.42 c relpscost : 0.00 0 0 0 0 0 0
116.36/116.42 c pscost : 0.00 0 0 0 0 0 0
116.36/116.42 c inference : 5.28 259277 0 0 0 0 518554
116.36/116.42 c mostinf : 0.00 0 0 0 0 0 0
116.36/116.42 c leastinf : 0.00 0 0 0 0 0 0
116.36/116.42 c fullstrong : 0.00 0 0 0 0 0 0
116.36/116.42 c allfullstrong : 0.00 0 0 0 0 0 0
116.36/116.42 c random : 0.00 0 0 0 0 0 0
116.36/116.42 c Primal Heuristics : Time Calls Found
116.36/116.42 c LP solutions : 0.00 - 0
116.36/116.42 c pseudo solutions : 0.52 - 1
116.36/116.42 c trivial : 0.00 1 0
116.36/116.42 c simplerounding : 0.00 0 0
116.36/116.42 c zirounding : 0.00 0 0
116.36/116.42 c rounding : 0.00 0 0
116.36/116.42 c shifting : 0.00 0 0
116.36/116.42 c intshifting : 0.00 0 0
116.36/116.42 c oneopt : 0.00 0 0
116.36/116.42 c twoopt : 0.00 0 0
116.36/116.42 c fixandinfer : 0.00 0 0
116.36/116.42 c feaspump : 0.00 0 0
116.36/116.42 c coefdiving : 0.00 0 0
116.36/116.42 c pscostdiving : 0.00 0 0
116.36/116.42 c fracdiving : 0.00 0 0
116.36/116.42 c veclendiving : 0.00 0 0
116.36/116.42 c intdiving : 0.00 0 0
116.36/116.42 c actconsdiving : 0.00 0 0
116.36/116.42 c objpscostdiving : 0.00 0 0
116.36/116.42 c rootsoldiving : 0.00 0 0
116.36/116.42 c linesearchdiving : 0.00 0 0
116.36/116.42 c guideddiving : 0.00 0 0
116.36/116.42 c octane : 0.00 0 0
116.36/116.42 c rens : 0.00 0 0
116.36/116.42 c rins : 0.00 0 0
116.36/116.42 c localbranching : 0.00 0 0
116.36/116.42 c mutation : 0.00 0 0
116.36/116.42 c crossover : 0.00 0 0
116.36/116.42 c dins : 0.00 0 0
116.36/116.42 c undercover : 0.00 0 0
116.36/116.42 c nlp : 0.00 0 0
116.36/116.42 c trysol : 0.00 0 0
116.36/116.42 c LP : Time Calls Iterations Iter/call Iter/sec
116.36/116.42 c primal LP : 0.00 0 0 0.00 -
116.36/116.42 c dual LP : 0.00 0 0 0.00 -
116.36/116.42 c lex dual LP : 0.00 0 0 0.00 -
116.36/116.42 c barrier LP : 0.00 0 0 0.00 -
116.36/116.42 c diving/probing LP: 0.00 0 0 0.00 -
116.36/116.42 c strong branching : 0.00 0 0 0.00 -
116.36/116.42 c (at root node) : - 0 0 0.00 -
116.36/116.42 c conflict analysis: 0.00 0 0 0.00 -
116.36/116.42 c B&B Tree :
116.36/116.42 c number of runs : 1
116.36/116.42 c nodes : 339442
116.36/116.42 c nodes (total) : 339442
116.36/116.42 c nodes left : 0
116.36/116.42 c max depth : 62
116.36/116.42 c max depth (total): 62
116.36/116.42 c backtracks : 47761 (14.1%)
116.36/116.42 c delayed cutoffs : 24852
116.36/116.42 c repropagations : 148079 (834578 domain reductions, 23072 cutoffs)
116.36/116.42 c avg switch length: 9.18
116.36/116.42 c switching time : 27.60
116.36/116.42 c Solution :
116.36/116.42 c Solutions found : 1 (1 improvements)
116.36/116.42 c First Solution : +0.00000000000000e+00 (in run 1, after 339442 nodes, 108.25 seconds, depth 18, found by <relaxation>)
116.36/116.42 c Primal Bound : +0.00000000000000e+00 (in run 1, after 339442 nodes, 108.25 seconds, depth 18, found by <relaxation>)
116.36/116.42 c Dual Bound : +0.00000000000000e+00
116.36/116.42 c Gap : 0.00 %
116.36/116.42 c Root Dual Bound : +0.00000000000000e+00
116.36/116.42 c Root Iterations : 0
116.36/116.45 c Time complete: 116.41.