0.00/0.01 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-3452994-1307071509.opb>
0.00/0.01 c original problem has 600 variables (600 bin, 0 int, 0 impl, 0 cont) and 460 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 presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 460 upgd conss, 0 impls, 40 clqs
0.00/0.03 c presolving (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 0 implications, 40 cliques
0.00/0.03 c presolved problem has 600 variables (600 bin, 0 int, 0 impl, 0 cont) and 460 constraints
0.00/0.03 c 40 constraints of type <setppc>
0.00/0.03 c 420 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 2.0.1.4
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 13950
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # belongs reading time to solving time?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c timing/reading = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/shiftandpropagate/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/subnlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/undercover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 233 | - |2451k| 0 | 128 | 600 | 460 | 600 | 460 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.2s| 1 | 0 | 346 | - |3158k| 0 | 118 | 600 | 469 | 600 | 468 | 8 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.3s| 1 | 0 | 429 | - |3964k| 0 | 112 | 600 | 469 | 600 | 475 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.4s| 1 | 0 | 639 | - |4642k| 0 | 133 | 600 | 469 | 600 | 485 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.38/0.45 c 0.4s| 1 | 0 | 870 | - |5365k| 0 | 149 | 600 | 469 | 600 | 497 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 1174 | - |6073k| 0 | 140 | 600 | 469 | 600 | 508 | 48 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.59 c 0.6s| 1 | 2 | 1174 | - |6074k| 0 | 140 | 600 | 469 | 600 | 508 | 48 | 0 | 15 | 0.000000e+00 | -- | Inf
1.58/1.64 c * 1.6s| 37 | 0 | 1715 | 15.0 |6248k| 22 | - | 600 | 469 | 600 | 480 | 48 | 0 | 738 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.58/1.65 c
1.58/1.65 c SCIP Status : problem is solved [optimal solution found]
1.58/1.65 c Solving Time (sec) : 1.64
1.58/1.65 c Solving Nodes : 37
1.58/1.65 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.58/1.65 c Dual Bound : +0.00000000000000e+00
1.58/1.65 c Gap : 0.00 %
1.58/1.65 s SATISFIABLE
1.58/1.65 v -x269 -x279 -x271 -x275 -x277 -x376 -x368 -x365 -x220 -x215 -x211 -x204 -x370 -x359 -x358 -x356 -x343 x261 -x270 -x347 x297 -x296
1.58/1.65 v -x294 -x292 -x290 -x282 -x276 x206 -x373 -x342 -x351 -x295 -x291 -x213 -x274 -x120 -x117 -x114 -x113 -x111 -x109 -x103 -x159
1.58/1.65 v -x156 -x155 -x151 -x145 -x144 -x142 -x110 -x205 -x299 -x118 -x201 -x273 -x112 -x345 -x104 -x265 -x280 -x141 -x78 -x74 -x73
1.58/1.65 v -x72 -x71 -x70 -x68 -x67 -x65 -x64 -x62 -x61 -x179 -x178 -x177 -x176 -x172 -x171 -x170 -x168 -x166 -x163 -x161 -x372 -x263 -x147
1.58/1.65 v -x284 -x289 -x380 -x341 -x175 -x169 -x210 x153 -x157 -x66 -x240 -x239 -x238 -x236 -x235 -x233 -x231 -x229 -x226 -x225 -x224
1.58/1.65 v -x222 x378 -x180 -x260 -x257 -x256 -x252 -x248 -x247 -x245 -x241 -x369 -x249 -x56 -x55 -x54 -x52 -x49 -x48 -x46 -x44 -x43
1.58/1.65 v -x42 -x221 -x227 -x234 -x59 -x101 -x350 -x262 -x167 -x361 -x106 -x38 -x37 -x36 -x35 x31 -x30 -x27 -x26 -x24 -x21 -x107 -x158
1.58/1.65 v -x51 -x20 -x17 -x15 -x14 -x10 -x9 -x8 -x7 -x5 -x3 -x146 -x346 -x150 -x79 -x366 -x371 -x143 -x53 -x285 -x154 -x140 -x138 -x136
1.58/1.65 v x134 -x132 -x129 -x128 -x123 -x122 -x121 -x1 -x28 -x77 -x281 x115 -x344 -x377 x250 -x360 -x363 -x228 -x149 -x367 -x34 -x133
1.58/1.65 v -x340 -x339 -x338 -x337 -x332 -x330 -x328 -x326 -x325 -x324 -x322 -x321 -x60 -x63 -x300 -x2 -x126 -x259 -x267 -x116 -x272 -x400
1.58/1.65 v -x397 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x23 -x354 -x209 -x333 -x381 -x334 -x230
1.58/1.65 v -x208 -x69 -x22 x329 -x45 -x364 -x399 -x6 -x13 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188
1.58/1.65 v -x187 -x186 -x185 -x184 -x183 -x100 -x99 -x98 -x97 -x96 -x93 -x92 -x91 -x89 -x88 -x87 -x86 -x85 -x84 x83 -x82 -x81 -x223
1.58/1.65 v -x75 -x336 -x286 -x278 x165 -x374 -x102 -x246 -x90 -x254 -x323 -x50 -x298 -x335 -x253 -x216 -x219 -x244 -x58 -x127 -x357 -x242
1.58/1.65 v -x18 -x353 x396 -x202 -x125 -x355 -x173 -x349 -x203 -x131 -x214 -x57 -x40 -x19 -x264 -x108 -x258 -x124 -x181 -x32 -x207 -x398
1.58/1.65 v -x33 -x460 -x459 -x458 -x457 -x456 -x455 -x454 -x453 -x452 x451 -x266 x232 x80 -x382 -x237 -x39 -x95 -x379 -x212 -x600 -x599
1.58/1.65 v -x598 -x597 -x596 -x595 -x594 -x593 x592 -x591 -x160 -x320 x319 -x316 -x315 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306
1.58/1.65 v -x305 -x304 -x303 -x302 -x301 -x174 -x217 -x139 -x287 -x317 -x375 -x251 x4 -x490 -x489 -x488 -x487 -x486 -x485 -x484 -x483
1.58/1.65 v x482 -x481 -x29 -x500 -x499 -x498 -x497 -x496 -x495 -x494 x493 -x492 -x491 -x130 -x331 -x243 -x430 -x429 -x428 -x427 -x426 x425
1.58/1.65 v -x424 -x423 -x422 -x421 -x283 -x530 -x529 -x528 -x527 -x526 -x525 x524 -x523 -x522 -x521 -x293 -x162 -x25 -x590 -x589 -x588
1.58/1.65 v -x587 -x586 -x585 -x584 x583 -x582 -x581 -x119 -x94 -x135 -x540 -x539 -x538 x537 -x536 -x535 -x534 -x533 -x532 -x531 -x314
1.58/1.65 v -x410 -x409 -x408 x407 -x406 -x405 -x404 -x403 -x402 -x401 -x41 -x76 -x12 x348 -x268 -x510 -x509 x508 -x507 -x506 -x505 -x504
1.58/1.65 v -x503 -x502 -x501 -x11 -x440 -x439 -x438 -x437 -x436 -x435 x434 -x433 -x432 -x431 -x164 -x148 -x570 -x569 -x568 -x567 -x566
1.58/1.65 v -x565 -x564 -x563 -x562 x561 -x137 -x480 -x479 -x478 -x477 x476 -x475 -x474 -x473 -x472 -x471 -x288 -x152 -x520 -x519 -x518 -x517
1.58/1.65 v x516 -x515 -x514 -x513 -x512 -x511 -x352 -x327 -x470 x469 -x468 -x467 -x466 -x465 -x464 -x463 -x462 -x461 x47 -x450 -x449
1.58/1.65 v x448 -x447 -x446 -x445 -x444 -x443 -x442 -x441 -x105 -x550 x549 -x548 -x547 -x546 -x545 -x544 -x543 -x542 -x541 -x255 -x318
1.58/1.65 v -x580 -x579 -x578 -x577 -x576 x575 -x574 -x573 -x572 -x571 -x218 -x362 x560 -x559 -x558 -x557 -x556 -x555 -x554 -x553 -x552
1.58/1.65 v -x551 -x16 x420 -x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x411 x182
1.58/1.65 c SCIP Status : problem is solved [optimal solution found]
1.58/1.65 c Total Time : 1.64
1.58/1.65 c solving : 1.64
1.58/1.65 c presolving : 0.01 (included in solving)
1.58/1.65 c reading : 0.01 (included in solving)
1.58/1.65 c Original Problem :
1.58/1.65 c Problem name : HOME/instance-3452994-1307071509.opb
1.58/1.65 c Variables : 600 (600 binary, 0 integer, 0 implicit integer, 0 continuous)
1.58/1.65 c Constraints : 460 initial, 460 maximal
1.58/1.65 c Presolved Problem :
1.58/1.65 c Problem name : t_HOME/instance-3452994-1307071509.opb
1.58/1.65 c Variables : 600 (600 binary, 0 integer, 0 implicit integer, 0 continuous)
1.58/1.65 c Constraints : 460 initial, 469 maximal
1.58/1.65 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.58/1.65 c trivial : 0.00 0 0 0 0 0 0 0 0 0
1.58/1.65 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
1.58/1.65 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1.58/1.65 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1.58/1.65 c implics : 0.00 0 0 0 0 0 0 0 0 0
1.58/1.65 c probing : 0.00 0 0 0 0 0 0 0 0 0
1.58/1.65 c setppc : 0.00 0 0 0 0 0 0 0 0 0
1.58/1.65 c linear : 0.01 0 0 0 0 0 0 0 0 0
1.58/1.65 c logicor : 0.00 0 0 0 0 0 0 0 0 0
1.58/1.65 c root node : - 0 - - 0 - - - - -
1.58/1.65 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1.58/1.65 c integral : 0 0 0 37 0 3 0 0 0 0 0 72
1.58/1.65 c setppc : 40 5 73 1 0 0 0 0 623 0 0 0
1.58/1.65 c linear : 0+ 5 25 0 0 0 0 0 0 0 0 0
1.58/1.65 c logicor : 420 5 32 1 0 0 0 0 1 0 0 0
1.58/1.65 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
1.58/1.65 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1.58/1.65 c integral : 1.06 0.00 0.00 1.06 0.00 0.00 0.00
1.58/1.65 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.58/1.65 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.58/1.65 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.58/1.65 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.58/1.65 c Propagators : #Propagate #Resprop Cutoffs DomReds
1.58/1.65 c vbounds : 0 0 0 0
1.58/1.65 c rootredcost : 0 0 0 0
1.58/1.65 c pseudoobj : 0 0 0 0
1.58/1.65 c Propagator Timings : TotalTime Propagate Resprop
1.58/1.65 c vbounds : 0.00 0.00 0.00
1.58/1.65 c rootredcost : 0.00 0.00 0.00
1.58/1.65 c pseudoobj : 0.00 0.00 0.00
1.58/1.65 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.58/1.65 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.58/1.65 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.58/1.65 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.58/1.65 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.58/1.65 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.58/1.65 c applied globally : - - - 0 0.0 - - -
1.58/1.65 c applied locally : - - - 0 0.0 - - -
1.58/1.65 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.58/1.65 c cut pool : 0.00 4 - - 0 - (maximal pool size: 425)
1.58/1.65 c redcost : 0.00 41 0 0 0 0
1.58/1.65 c impliedbounds : 0.00 5 0 0 0 0
1.58/1.65 c intobj : 0.00 0 0 0 0 0
1.58/1.65 c gomory : 0.18 5 0 0 927 0
1.58/1.65 c cgmip : 0.00 0 0 0 0 0
1.58/1.65 c closecuts : 0.00 0 0 0 0 0
1.58/1.65 c strongcg : 0.22 5 0 0 2214 0
1.58/1.65 c cmir : 0.00 0 0 0 0 0
1.58/1.65 c flowcover : 0.00 0 0 0 0 0
1.58/1.65 c clique : 0.00 5 0 0 0 0
1.58/1.65 c zerohalf : 0.00 0 0 0 0 0
1.58/1.65 c mcf : 0.00 1 0 0 0 0
1.58/1.65 c oddcycle : 0.00 0 0 0 0 0
1.58/1.65 c rapidlearning : 0.02 1 0 0 0 9
1.58/1.65 c Pricers : Time Calls Vars
1.58/1.65 c problem variables: 0.00 0 0
1.58/1.65 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.58/1.65 c relpscost : 1.06 36 0 0 0 0 72
1.58/1.65 c pscost : 0.00 0 0 0 0 0 0
1.58/1.65 c inference : 0.00 0 0 0 0 0 0
1.58/1.65 c mostinf : 0.00 0 0 0 0 0 0
1.58/1.65 c leastinf : 0.00 0 0 0 0 0 0
1.58/1.65 c fullstrong : 0.00 0 0 0 0 0 0
1.58/1.65 c allfullstrong : 0.00 0 0 0 0 0 0
1.58/1.65 c random : 0.00 0 0 0 0 0 0
1.58/1.65 c Primal Heuristics : Time Calls Found
1.58/1.65 c LP solutions : 0.00 - 1
1.58/1.65 c pseudo solutions : 0.00 - 0
1.58/1.65 c trivial : 0.00 1 0
1.58/1.65 c shiftandpropagate: 0.00 0 0
1.58/1.65 c simplerounding : 0.00 0 0
1.58/1.65 c zirounding : 0.00 0 0
1.58/1.65 c rounding : 0.00 0 0
1.58/1.65 c shifting : 0.00 0 0
1.58/1.65 c intshifting : 0.00 0 0
1.58/1.65 c oneopt : 0.00 0 0
1.58/1.65 c twoopt : 0.00 0 0
1.58/1.65 c fixandinfer : 0.00 0 0
1.58/1.65 c feaspump : 0.00 0 0
1.58/1.65 c clique : 0.00 0 0
1.58/1.65 c coefdiving : 0.00 0 0
1.58/1.65 c pscostdiving : 0.00 0 0
1.58/1.65 c fracdiving : 0.00 0 0
1.58/1.65 c veclendiving : 0.00 0 0
1.58/1.65 c intdiving : 0.00 0 0
1.58/1.65 c actconsdiving : 0.00 0 0
1.58/1.65 c objpscostdiving : 0.00 0 0
1.58/1.65 c rootsoldiving : 0.00 0 0
1.58/1.65 c linesearchdiving : 0.00 0 0
1.58/1.65 c guideddiving : 0.00 0 0
1.58/1.65 c octane : 0.00 0 0
1.58/1.65 c rens : 0.00 0 0
1.58/1.65 c rins : 0.00 0 0
1.58/1.65 c localbranching : 0.00 0 0
1.58/1.65 c mutation : 0.00 0 0
1.58/1.65 c crossover : 0.00 0 0
1.58/1.65 c dins : 0.00 0 0
1.58/1.65 c vbounds : 0.00 0 0
1.58/1.65 c undercover : 0.00 0 0
1.58/1.65 c subnlp : 0.00 0 0
1.58/1.65 c trysol : 0.00 0 0
1.58/1.65 c LP : Time Calls Iterations Iter/call Iter/sec
1.58/1.65 c primal LP : 0.00 0 0 0.00 -
1.58/1.65 c dual LP : 0.10 42 1715 40.83 17201.09
1.58/1.65 c lex dual LP : 0.00 0 0 0.00 -
1.58/1.65 c barrier LP : 0.00 0 0 0.00 -
1.58/1.65 c diving/probing LP: 0.00 0 0 0.00 -
1.58/1.65 c strong branching : 1.06 738 17347 23.51 16373.51
1.58/1.65 c (at root node) : - 15 743 49.53 -
1.58/1.65 c conflict analysis: 0.00 0 0 0.00 -
1.58/1.65 c B&B Tree :
1.58/1.65 c number of runs : 1
1.58/1.65 c nodes : 37
1.58/1.65 c nodes (total) : 37
1.58/1.65 c nodes left : 0
1.58/1.65 c max depth : 22
1.58/1.65 c max depth (total): 22
1.58/1.65 c backtracks : 1 (2.7%)
1.58/1.65 c delayed cutoffs : 0
1.58/1.65 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.58/1.65 c avg switch length: 2.00
1.58/1.65 c switching time : 0.00
1.58/1.65 c Solution :
1.58/1.65 c Solutions found : 1 (1 improvements)
1.58/1.65 c First Solution : +0.00000000000000e+00 (in run 1, after 37 nodes, 1.64 seconds, depth 22, found by <relaxation>)
1.58/1.65 c Primal Bound : +0.00000000000000e+00 (in run 1, after 37 nodes, 1.64 seconds, depth 22, found by <relaxation>)
1.58/1.65 c Dual Bound : +0.00000000000000e+00
1.58/1.65 c Gap : 0.00 %
1.58/1.65 c Root Dual Bound : +0.00000000000000e+00
1.58/1.65 c Root Iterations : 1174
1.58/1.65 c Time complete: 1.65.