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