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-2664414-1276297388.opb>
0.01/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.01/0.05 c problem read
0.01/0.05 c No objective function, only one solution is needed.
0.01/0.05 c presolving settings loaded
0.01/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.01/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.15 c presolving (3 rounds):
0.09/0.15 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.15 c 242 implications, 22 cliques
0.09/0.15 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.06
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
4.08/4.12 c 3.8s| 10000 | 8101 | 0 | 0.0 |7271k| 102 | - | 231 |4289 | 0 | 0 | 0 |2652 | 0 | 0.000000e+00 | -- | Inf
9.59/9.67 c 9.1s| 20000 | 14803 | 0 | 0.0 | 12M| 102 | - | 231 |5398 | 0 | 0 | 0 |6848 | 0 | 0.000000e+00 | -- | Inf
14.59/14.69 c 13.9s| 30000 | 22559 | 0 | 0.0 | 16M| 102 | - | 231 |6127 | 0 | 0 | 0 |9659 | 0 | 0.000000e+00 | -- | Inf
20.49/20.51 c 19.4s| 40000 | 29883 | 0 | 0.0 | 21M| 102 | - | 231 |6803 | 0 | 0 | 0 | 13k| 0 | 0.000000e+00 | -- | Inf
26.88/26.90 c 25.6s| 50000 | 36965 | 0 | 0.0 | 26M| 102 | - | 231 |7671 | 0 | 0 | 0 | 16k| 0 | 0.000000e+00 | -- | Inf
34.38/34.40 c 32.9s| 60000 | 43563 | 0 | 0.0 | 31M| 102 | - | 231 |8238 | 0 | 0 | 0 | 21k| 0 | 0.000000e+00 | -- | Inf
42.47/42.51 c 40.7s| 70000 | 49826 | 0 | 0.0 | 36M| 102 | - | 231 |8746 | 0 | 0 | 0 | 26k| 0 | 0.000000e+00 | -- | Inf
51.47/51.59 c 49.5s| 80000 | 55750 | 0 | 0.0 | 40M| 102 | - | 231 |9512 | 0 | 0 | 0 | 32k| 0 | 0.000000e+00 | -- | Inf
62.07/62.15 c 59.8s| 90000 | 61099 | 0 | 0.0 | 45M| 102 | - | 231 | 10k| 0 | 0 | 0 | 38k| 0 | 0.000000e+00 | -- | Inf
77.67/77.72 c 75.0s|100000 | 64270 | 0 | 0.0 | 50M| 102 | - | 231 | 12k| 0 | 0 | 0 | 47k| 0 | 0.000000e+00 | -- | Inf
91.36/91.46 c 88.5s|110000 | 69298 | 0 | 0.0 | 54M| 102 | - | 231 | 10k| 0 | 0 | 0 | 53k| 0 | 0.000000e+00 | -- | Inf
102.75/102.80 c 99.6s|120000 | 75508 | 0 | 0.0 | 58M| 102 | - | 231 | 10k| 0 | 0 | 0 | 58k| 0 | 0.000000e+00 | -- | Inf
113.36/113.42 c 110s|130000 | 81812 | 0 | 0.0 | 62M| 102 | - | 231 | 10k| 0 | 0 | 0 | 63k| 0 | 0.000000e+00 | -- | Inf
124.05/124.14 c 120s|140000 | 87997 | 0 | 0.0 | 67M| 102 | - | 231 | 10k| 0 | 0 | 0 | 68k| 0 | 0.000000e+00 | -- | Inf
135.16/135.27 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
135.16/135.27 c 131s|150000 | 94163 | 0 | 0.0 | 71M| 102 | - | 231 | 10k| 0 | 0 | 0 | 73k| 0 | 0.000000e+00 | -- | Inf
146.64/146.71 c 142s|160000 |100176 | 0 | 0.0 | 75M| 102 | - | 231 | 11k| 0 | 0 | 0 | 78k| 0 | 0.000000e+00 | -- | Inf
158.44/158.56 c 154s|170000 |106094 | 0 | 0.0 | 80M| 102 | - | 231 | 11k| 0 | 0 | 0 | 84k| 0 | 0.000000e+00 | -- | Inf
171.45/171.54 c 167s|180000 |111567 | 0 | 0.0 | 84M| 102 | - | 231 | 11k| 0 | 0 | 0 | 90k| 0 | 0.000000e+00 | -- | Inf
185.04/185.17 c 180s|190000 |116909 | 0 | 0.0 | 88M| 102 | - | 231 | 12k| 0 | 0 | 0 | 96k| 0 | 0.000000e+00 | -- | Inf
197.53/197.67 c 192s|200000 |122727 | 0 | 0.0 | 92M| 102 | - | 231 | 12k| 0 | 0 | 0 | 101k| 0 | 0.000000e+00 | -- | Inf
210.92/211.00 c 205s|210000 |128213 | 0 | 0.0 | 97M| 102 | - | 231 | 12k| 0 | 0 | 0 | 107k| 0 | 0.000000e+00 | -- | Inf
225.23/225.39 c 220s|220000 |133370 | 0 | 0.0 | 101M| 102 | - | 231 | 13k| 0 | 0 | 0 | 114k| 0 | 0.000000e+00 | -- | Inf
239.22/239.30 c 233s|230000 |138804 | 0 | 0.0 | 105M| 102 | - | 231 | 13k| 0 | 0 | 0 | 120k| 0 | 0.000000e+00 | -- | Inf
254.32/254.48 c 248s|240000 |143603 | 0 | 0.0 | 110M| 102 | - | 231 | 14k| 0 | 0 | 0 | 126k| 0 | 0.000000e+00 | -- | Inf
271.61/271.73 c 265s|250000 |147981 | 0 | 0.0 | 115M| 102 | - | 231 | 15k| 0 | 0 | 0 | 133k| 0 | 0.000000e+00 | -- | Inf
290.90/291.03 c 284s|260000 |151920 | 0 | 0.0 | 120M| 102 | - | 231 | 16k| 0 | 0 | 0 | 141k| 0 | 0.000000e+00 | -- | Inf
311.10/311.23 c 304s|270000 |155659 | 0 | 0.0 | 125M| 102 | - | 231 | 15k| 0 | 0 | 0 | 149k| 0 | 0.000000e+00 | -- | Inf
331.89/332.06 c 324s|280000 |159202 | 0 | 0.0 | 130M| 102 | - | 231 | 15k| 0 | 0 | 0 | 158k| 0 | 0.000000e+00 | -- | Inf
336.40/336.56 c * 329s|282094 | 0 | 0 | 0.0 |8342k| 102 | - | 231 | 16k| 0 | 0 | 0 | 160k| 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
336.40/336.57 c
336.40/336.57 c SCIP Status : problem is solved [optimal solution found]
336.40/336.57 c Solving Time (sec) : 328.87
336.40/336.57 c Solving Nodes : 282094
336.40/336.57 c Primal Bound : +0.00000000000000e+00 (1 solutions)
336.40/336.57 c Dual Bound : +0.00000000000000e+00
336.40/336.57 c Gap : 0.00 %
336.40/336.57 s SATISFIABLE
336.40/336.57 v -x221 -x211 -x201 -x191 -x181 -x171 -x161 x151 -x141 -x131 -x231 -x210 x200 -x190 -x180 -x170 -x160 -x150 -x140 -x130 -x230 -x220
336.40/336.57 v -x199 x189 -x179 -x169 -x159 -x149 -x139 -x129 x229 -x219 -x209 -x188 -x178 -x168 -x158 -x148 -x138 -x128 -x228 -x218 -x208
336.40/336.57 v -x198 -x177 -x167 -x157 -x147 x137 -x127 -x227 -x217 -x207 -x197 -x187 -x166 -x156 -x146 -x136 x126 -x226 -x216 -x206 -x196
336.40/336.57 v -x186 -x176 x155 -x145 -x135 -x125 -x225 -x215 x205 -x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 -x204 -x194 -x184
336.40/336.57 v x174 -x164 -x154 -x133 -x123 -x223 x213 -x203 -x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 -x212 -x202 -x192 -x182 -x172 x162
336.40/336.57 v -x152 -x142 -x132 -x121 -x120 -x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104
336.40/336.57 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
336.40/336.57 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
336.40/336.57 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
336.40/336.57 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
336.40/336.57 v x1
336.40/336.57 c SCIP Status : problem is solved [optimal solution found]
336.40/336.57 c Solving Time : 328.87
336.40/336.57 c Original Problem :
336.40/336.57 c Problem name : HOME/instance-2664414-1276297388.opb
336.40/336.57 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
336.40/336.57 c Constraints : 2707 initial, 2707 maximal
336.40/336.57 c Presolved Problem :
336.40/336.57 c Problem name : t_HOME/instance-2664414-1276297388.opb
336.40/336.57 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
336.40/336.57 c Constraints : 2564 initial, 16354 maximal
336.40/336.57 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
336.40/336.57 c trivial : 0.00 0 0 0 0 0 0 0 0
336.40/336.57 c dualfix : 0.00 0 0 0 0 0 0 0 0
336.40/336.57 c boundshift : 0.00 0 0 0 0 0 0 0 0
336.40/336.57 c inttobinary : 0.00 0 0 0 0 0 0 0 0
336.40/336.57 c implics : 0.00 0 0 0 0 0 0 0 0
336.40/336.57 c probing : 0.00 0 0 0 0 0 0 0 0
336.40/336.57 c knapsack : 0.00 0 0 0 0 0 0 0 0
336.40/336.57 c setppc : 0.00 0 0 0 0 0 0 0 0
336.40/336.57 c linear : 0.02 0 0 0 0 0 143 0 0
336.40/336.57 c logicor : 0.03 0 0 0 0 0 0 0 0
336.40/336.57 c root node : - 0 - - 0 - - - -
336.40/336.57 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
336.40/336.57 c integral : 0 0 0 0 0 0 0 0 0 0
336.40/336.57 c knapsack : 1 0 785160 0 238791 16657 2258282 0 0 0
336.40/336.57 c setppc : 22 0 772529 0 238790 26826 914286 0 0 0
336.40/336.57 c logicor : 2541+ 0 631993 0 238791 31473 2070602 0 0 0
336.40/336.57 c countsols : 0 0 0 0 238791 0 0 0 0 0
336.40/336.57 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
336.40/336.57 c integral : 0.00 0.00 0.00 0.00 0.00
336.40/336.57 c knapsack : 14.85 0.00 13.72 0.00 1.13
336.40/336.57 c setppc : 10.24 0.00 7.45 0.00 2.79
336.40/336.57 c logicor : 168.57 0.00 138.85 0.00 29.72
336.40/336.57 c countsols : 0.08 0.00 0.00 0.00 0.08
336.40/336.57 c Propagators : Time Calls Cutoffs DomReds
336.40/336.57 c vbounds : 0.31 1 0 0
336.40/336.57 c rootredcost : 0.41 0 0 0
336.40/336.57 c pseudoobj : 0.35 0 0 0
336.40/336.57 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
336.40/336.57 c propagation : 5.24 74956 74933 360292 20.7 2186 21.0 -
336.40/336.57 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
336.40/336.57 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
336.40/336.57 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
336.40/336.57 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
336.40/336.57 c applied globally : - - - 158726 15.9 - - -
336.40/336.57 c applied locally : - - - 1322 34.6 - - -
336.40/336.57 c Separators : Time Calls Cutoffs DomReds Cuts Conss
336.40/336.57 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
336.40/336.57 c redcost : 0.00 0 0 0 0 0
336.40/336.57 c impliedbounds : 0.00 0 0 0 0 0
336.40/336.57 c intobj : 0.00 0 0 0 0 0
336.40/336.57 c cgmip : 0.00 0 0 0 0 0
336.40/336.57 c gomory : 0.00 0 0 0 0 0
336.40/336.57 c strongcg : 0.00 0 0 0 0 0
336.40/336.57 c cmir : 0.00 0 0 0 0 0
336.40/336.57 c flowcover : 0.00 0 0 0 0 0
336.40/336.57 c clique : 0.00 0 0 0 0 0
336.40/336.57 c zerohalf : 0.00 0 0 0 0 0
336.40/336.57 c mcf : 0.00 0 0 0 0 0
336.40/336.57 c rapidlearning : 0.00 0 0 0 0 0
336.40/336.57 c Pricers : Time Calls Vars
336.40/336.57 c problem variables: 0.00 0 0
336.40/336.57 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
336.40/336.57 c relpscost : 0.00 0 0 0 0 0 0
336.40/336.57 c pscost : 0.00 0 0 0 0 0 0
336.40/336.57 c inference : 6.33 238790 0 0 0 0 477580
336.40/336.57 c mostinf : 0.00 0 0 0 0 0 0
336.40/336.57 c leastinf : 0.00 0 0 0 0 0 0
336.40/336.57 c fullstrong : 0.00 0 0 0 0 0 0
336.40/336.57 c allfullstrong : 0.00 0 0 0 0 0 0
336.40/336.57 c random : 0.00 0 0 0 0 0 0
336.40/336.57 c Primal Heuristics : Time Calls Found
336.40/336.57 c LP solutions : 0.00 - 0
336.40/336.57 c pseudo solutions : 0.46 - 1
336.40/336.57 c trivial : 0.00 1 0
336.40/336.57 c simplerounding : 0.00 0 0
336.40/336.57 c zirounding : 0.00 0 0
336.40/336.57 c rounding : 0.00 0 0
336.40/336.57 c shifting : 0.00 0 0
336.40/336.57 c intshifting : 0.00 0 0
336.40/336.57 c oneopt : 0.00 0 0
336.40/336.57 c twoopt : 0.00 0 0
336.40/336.57 c fixandinfer : 0.00 0 0
336.40/336.57 c feaspump : 0.00 0 0
336.40/336.57 c coefdiving : 0.00 0 0
336.40/336.57 c pscostdiving : 0.00 0 0
336.40/336.57 c fracdiving : 0.00 0 0
336.40/336.57 c veclendiving : 0.00 0 0
336.40/336.57 c intdiving : 0.00 0 0
336.40/336.57 c actconsdiving : 0.00 0 0
336.40/336.57 c objpscostdiving : 0.00 0 0
336.40/336.57 c rootsoldiving : 0.00 0 0
336.40/336.57 c linesearchdiving : 0.00 0 0
336.40/336.57 c guideddiving : 0.00 0 0
336.40/336.57 c octane : 0.00 0 0
336.40/336.57 c rens : 0.00 0 0
336.40/336.57 c rins : 0.00 0 0
336.40/336.57 c localbranching : 0.00 0 0
336.40/336.57 c mutation : 0.00 0 0
336.40/336.57 c crossover : 0.00 0 0
336.40/336.57 c dins : 0.00 0 0
336.40/336.57 c undercover : 0.00 0 0
336.40/336.57 c nlp : 0.00 0 0
336.40/336.57 c trysol : 0.00 0 0
336.40/336.57 c LP : Time Calls Iterations Iter/call Iter/sec
336.40/336.57 c primal LP : 0.00 0 0 0.00 -
336.40/336.57 c dual LP : 0.00 0 0 0.00 -
336.40/336.57 c lex dual LP : 0.00 0 0 0.00 -
336.40/336.57 c barrier LP : 0.00 0 0 0.00 -
336.40/336.57 c diving/probing LP: 0.00 0 0 0.00 -
336.40/336.57 c strong branching : 0.00 0 0 0.00 -
336.40/336.57 c (at root node) : - 0 0 0.00 -
336.40/336.57 c conflict analysis: 0.00 0 0 0.00 -
336.40/336.57 c B&B Tree :
336.40/336.57 c number of runs : 1
336.40/336.57 c nodes : 282094
336.40/336.57 c nodes (total) : 282094
336.40/336.57 c nodes left : 0
336.40/336.57 c max depth : 102
336.40/336.57 c max depth (total): 102
336.40/336.57 c backtracks : 42403 (15.0%)
336.40/336.57 c delayed cutoffs : 35477
336.40/336.57 c repropagations : 146812 (1846503 domain reductions, 31653 cutoffs)
336.40/336.57 c avg switch length: 8.80
336.40/336.57 c switching time : 84.24
336.40/336.57 c Solution :
336.40/336.57 c Solutions found : 1 (1 improvements)
336.40/336.57 c First Solution : +0.00000000000000e+00 (in run 1, after 282094 nodes, 328.40 seconds, depth 53, found by <relaxation>)
336.40/336.57 c Primal Bound : +0.00000000000000e+00 (in run 1, after 282094 nodes, 328.40 seconds, depth 53, found by <relaxation>)
336.40/336.57 c Dual Bound : +0.00000000000000e+00
336.40/336.57 c Gap : 0.00 %
336.40/336.57 c Root Dual Bound : +0.00000000000000e+00
336.40/336.57 c Root Iterations : 0
336.49/336.63 c Time complete: 336.52.