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-2664523-1276327903.opb>
0.00/0.03 c original problem has 900 variables (900 bin, 0 int, 0 impl, 0 cont) and 673 constraints
0.00/0.03 c problem read
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c presolving settings loaded
0.00/0.03 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.05 c presolving:
0.08/0.09 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 673 upgd conss, 0 impls, 49 clqs
0.08/0.09 c presolving (2 rounds):
0.08/0.09 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.08/0.09 c 0 implications, 49 cliques
0.08/0.09 c presolved problem has 900 variables (900 bin, 0 int, 0 impl, 0 cont) and 673 constraints
0.08/0.09 c 49 constraints of type <setppc>
0.08/0.09 c 624 constraints of type <logicor>
0.08/0.09 c transformed objective value is always integral (scale: 1)
0.08/0.09 c Presolving Time: 0.05
0.08/0.09 c - non default parameters ----------------------------------------------------------------------
0.08/0.09 c # SCIP version 1.2.1.2
0.08/0.09 c
0.08/0.09 c # frequency for displaying node information lines
0.08/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.08/0.09 c display/freq = 10000
0.08/0.09 c
0.08/0.09 c # maximal time in seconds to run
0.08/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.08/0.09 c limits/time = 1799.97
0.08/0.09 c
0.08/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.08/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.08/0.09 c limits/memory = 1620
0.08/0.09 c
0.08/0.09 c # solving stops, if the given number of solutions were found (-1: no limit)
0.08/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.08/0.09 c limits/solutions = 1
0.08/0.09 c
0.08/0.09 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.08/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.09 c lp/solvefreq = -1
0.08/0.09 c
0.08/0.09 c # maximal number of separation rounds per node (-1: unlimited)
0.08/0.09 c # [type: int, range: [-1,2147483647], default: 5]
0.08/0.09 c separating/maxrounds = 1
0.08/0.09 c
0.08/0.09 c # maximal number of separation rounds in the root node (-1: unlimited)
0.08/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.08/0.09 c separating/maxroundsroot = 5
0.08/0.09 c
0.08/0.09 c # should presolving try to simplify inequalities
0.08/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.08/0.09 c constraints/linear/simplifyinequalities = TRUE
0.08/0.09 c
0.08/0.09 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.08/0.09 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.08/0.09 c constraints/knapsack/disaggregation = FALSE
0.08/0.09 c
0.08/0.09 c # should presolving try to simplify knapsacks
0.08/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.08/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.08/0.09 c
0.08/0.09 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.08/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.08/0.09 c presolving/probing/maxrounds = 0
0.08/0.09 c
0.08/0.09 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.08/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.09 c heuristics/coefdiving/freq = -1
0.08/0.09 c
0.08/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.09 c heuristics/coefdiving/maxlpiterquot = 0.075
0.08/0.09 c
0.08/0.09 c # additional number of allowed LP iterations
0.08/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.09 c heuristics/coefdiving/maxlpiterofs = 1500
0.08/0.09 c
0.08/0.09 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.08/0.09 c # [type: int, range: [-1,2147483647], default: 30]
0.08/0.10 c heuristics/crossover/freq = -1
0.08/0.10 c
0.08/0.10 c # number of nodes added to the contingent of the total nodes
0.08/0.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.08/0.10 c heuristics/crossover/nodesofs = 750
0.08/0.10 c
0.08/0.10 c # number of nodes without incumbent change that heuristic should wait
0.08/0.10 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.08/0.10 c heuristics/crossover/nwaitingnodes = 100
0.08/0.10 c
0.08/0.10 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.08/0.10 c # [type: real, range: [0,1], default: 0.1]
0.08/0.10 c heuristics/crossover/nodesquot = 0.15
0.08/0.10 c
0.08/0.10 c # minimum percentage of integer variables that have to be fixed
0.08/0.10 c # [type: real, range: [0,1], default: 0.666]
0.08/0.10 c heuristics/crossover/minfixingrate = 0.5
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 20]
0.08/0.10 c heuristics/feaspump/freq = -1
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/feaspump/maxlpiterofs = 2000
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/fracdiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/fracdiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/fracdiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/guideddiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/guideddiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/guideddiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/intdiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/intshifting/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/linesearchdiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/nlp/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 20]
0.08/0.10 c heuristics/objpscostdiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to total iteration number
0.08/0.10 c # [type: real, range: [0,1], default: 0.01]
0.08/0.10 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/oneopt/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/pscostdiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/pscostdiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.08/0.10 c heuristics/rens/freq = -1
0.08/0.10 c
0.08/0.10 c # minimum percentage of integer variables that have to be fixable
0.08/0.10 c # [type: real, range: [0,1], default: 0.5]
0.08/0.10 c heuristics/rens/minfixingrate = 0.3
0.08/0.10 c
0.08/0.10 c # number of nodes added to the contingent of the total nodes
0.08/0.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.08/0.10 c heuristics/rens/nodesofs = 2000
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 20]
0.08/0.10 c heuristics/rootsoldiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.08/0.10 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/rounding/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/shifting/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/simplerounding/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.08/0.10 c heuristics/trivial/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/trysol/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/veclendiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/veclendiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/veclendiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/zirounding/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.08/0.10 c separating/cmir/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.08/0.10 c separating/flowcover/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.08/0.10 c separating/rapidlearning/freq = 0
0.08/0.10 c
0.08/0.10 c -----------------------------------------------------------------------------------------------
0.08/0.10 c start solving
0.09/0.10 c
0.09/0.10 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.10 c 0.1s| 1 | 2 | 0 | - |2724k| 0 | - | 900 | 673 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.19/4.27 c 4.1s| 10000 | 9868 | 0 | 0.0 |6181k| 524 | - | 900 | 770 | 0 | 0 | 0 | 220 | 0 | 0.000000e+00 | -- | Inf
5.39/5.42 c * 5.2s| 12974 | 0 | 0 | 0.0 |3367k| 565 | - | 900 | 765 | 0 | 0 | 0 | 272 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
5.39/5.42 c
5.39/5.42 c SCIP Status : problem is solved [optimal solution found]
5.39/5.42 c Solving Time (sec) : 5.21
5.39/5.42 c Solving Nodes : 12974
5.39/5.42 c Primal Bound : +0.00000000000000e+00 (1 solutions)
5.39/5.42 c Dual Bound : +0.00000000000000e+00
5.39/5.42 c Gap : 0.00 %
5.39/5.42 s SATISFIABLE
5.39/5.42 v -x204 -x212 -x317 -x312 -x304 -x17 -x13 -x535 -x314 -x120 -x117 -x104 -x103 -x102 -x544 -x110 -x543 -x318 -x319 -x9 -x214 -x101
5.39/5.42 v -x548 -x213 -x310 -x203 -x118 -x20 -x125 x533 -x305 -x123 -x25 -x534 -x109 -x303 -x308 x302 -x8 -x216 -x531 -x530 -x207 -x527
5.39/5.42 v -x499 -x498 -x494 -x493 -x492 -x489 -x487 -x482 -x480 -x479 -x478 -x476 -x323 -x496 -x119 -x200 -x199 -x198 -x195 -x189 -x187
5.39/5.42 v -x185 -x184 -x183 -x249 -x247 -x245 -x244 -x243 -x241 -x226 -x222 -x542 -x320 -x182 -x218 -x7 -x14 -x227 -x497 -x239 -x547
5.39/5.42 v -x211 -x307 -x124 -x107 x273 -x272 -x267 -x264 -x262 -x261 -x258 -x253 -x251 -x21 -x473 -x472 -x470 -x463 -x459 -x458 -x457
5.39/5.42 v -x454 -x451 -x324 -x467 -x5 -x194 -x259 x112 -x549 -x315 -x246 -x3 -x111 -x186 -x114 -x268 -x464 -x306 -x248 -x529 -x179 -x228
5.39/5.42 v -x234 -x11 -x209 -x115 -x188 -x484 -x180 -x255 -x491 -x274 -x108 -x18 x232 -x250 -x316 -x177 x495 -x263 -x270 -x375 -x374 -x372
5.39/5.42 v -x370 -x369 -x368 -x367 -x366 -x365 -x364 -x363 -x362 -x361 -x360 -x357 -x356 x355 -x354 -x353 -x352 -x351 -x471 -x181 -x550
5.39/5.42 v -x238 -x106 -x206 -x196 -x537 -x322 -x223 -x486 -x116 -x22 -x539 -x526 -x4 -x475 -x219 -x75 -x74 -x73 -x69 -x67 -x66 -x65
5.39/5.42 v -x64 x60 -x58 -x57 -x55 -x54 -x51 -x229 -x208 -x465 -x481 -x321 -x215 -x540 -x485 -x257 -x121 -x52 -x68 -x205 -x210 -x231 -x525
5.39/5.42 v -x524 -x523 -x521 -x519 -x518 -x517 -x515 -x512 -x509 -x508 -x507 -x506 -x505 -x504 -x503 -x502 -x59 -x225 -x309 -x191 -x453
5.39/5.42 v x397 -x396 -x395 -x390 -x388 -x386 -x385 -x384 -x382 -x381 -x378 -x377 -x376 -x61 -x269 -x599 -x598 -x597 x596 -x594 -x592
5.39/5.42 v -x590 -x588 -x586 -x584 -x583 -x582 -x581 -x580 -x579 -x578 x24 -x230 -x501 -x387 -x2 -x456 -x311 -x536 -x1 -x380 -x266 -x450
5.39/5.42 v -x447 -x446 -x442 -x440 -x439 -x437 -x436 -x435 x434 -x432 -x430 -x429 -x428 -x427 -x426 -x122 -x313 -x240 -x242 -x593 -x359
5.39/5.42 v -x373 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x91 -x90 -x89 -x88 -x86 -x85 -x84 -x83 -x82 -x78 -x76 -x105 -x16 -x53 -x233
5.39/5.42 v -x56 -x92 -x15 -x193 -x202 -x585 -x371 -x513 -x275 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x141 -x140 -x139 -x138
5.39/5.42 v x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x126 -x708 -x707 -x706 -x705 -x704 -x703 x702 -x701 -x700 -x699 -x698
5.39/5.42 v -x697 -x600 -x520 -x23 -x461 -x591 -x142 -x455 -x393 -x12 -x541 -x398 -x137 -x431 -x70 -x522 -x483 -x178 -x511 -x235 x300 -x299
5.39/5.42 v -x298 -x297 -x296 -x295 -x294 -x293 -x291 -x290 -x289 -x287 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x276 -x466 -x477 -x220
5.39/5.42 v -x224 -x576 x79 -x490 -x449 -x510 -x546 -x292 -x443 -x575 -x574 -x572 -x571 -x570 x569 -x567 -x566 -x565 -x563 -x562 -x561
5.39/5.42 v -x560 -x559 -x557 -x556 -x555 -x554 -x553 -x552 -x551 -x252 -x452 -x636 -x635 -x634 -x633 -x632 -x631 -x630 x629 -x628 -x627
5.39/5.42 v -x626 -x625 -x528 -x288 -x221 -x10 -x532 -x445 -x77 -x558 -x277 -x217 -x325 x468 -x391 -x448 -x425 -x423 -x422 -x420 -x419
5.39/5.42 v -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x410 -x409 -x408 -x406 -x405 -x404 x403 -x402 -x401 -x256 x190 -x424 -x589 -x81 -x564
5.39/5.42 v -x488 -x816 -x815 -x814 -x813 x812 -x811 -x810 -x809 -x808 -x807 -x806 -x805 -x568 -x474 -x389 -x660 -x659 -x658 -x657 -x656
5.39/5.42 v -x655 -x654 -x653 x652 -x651 -x650 -x649 -x80 -x197 -x399 -x175 -x174 -x173 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164
5.39/5.42 v -x163 -x161 -x160 -x159 -x158 -x157 x156 -x155 -x154 -x153 -x151 -x152 -x545 -x441 -x516 -x438 -x421 -x350 -x348 -x347 -x346
5.39/5.42 v -x345 -x344 -x343 x342 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 -x327 -x326 -x460 -x237
5.39/5.42 v -x444 -x63 -x394 -x768 -x767 -x766 x765 -x764 -x763 -x762 -x761 -x760 -x759 -x758 -x757 x514 -x176 -x192 -x500 -x379 -x577
5.39/5.42 v -x71 -x840 -x839 -x838 -x837 -x836 -x835 -x834 -x833 -x832 -x831 x830 -x829 -x595 -x285 -x236 -x852 -x851 -x850 -x849 -x848
5.39/5.42 v -x847 -x846 -x845 x844 -x843 -x842 -x841 -x271 -x19 -x411 -x648 -x647 -x646 -x645 -x644 -x643 -x642 -x641 -x640 -x639 -x638 x637
5.39/5.42 v -x254 -x113 -x876 -x875 -x874 -x873 -x872 -x871 -x870 -x869 -x868 -x867 -x866 x865 -x573 -x888 -x887 -x886 -x885 -x884 x883
5.39/5.42 v -x882 -x881 -x880 -x879 -x878 -x877 -x349 -x162 -x732 -x731 -x730 -x729 -x728 x727 -x726 -x725 -x724 -x723 -x722 -x721 -x286
5.39/5.42 v -x383 -x87 x828 -x827 -x826 -x825 -x824 -x823 -x822 -x821 -x820 -x819 -x818 -x817 -x469 -x624 x623 -x622 -x621 -x620 -x619
5.39/5.42 v -x618 -x617 -x616 -x615 -x614 -x613 -x127 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 x38 -x37 -x36 -x35 -x34
5.39/5.42 v -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x358 -x792 -x791 -x790 -x789 -x788 -x787 -x786 -x785 -x784 -x783 -x782 -x781 -x341
5.39/5.42 v -x72 -x720 -x719 -x718 -x717 -x716 -x715 -x714 -x713 -x712 -x711 x710 -x709 -x260 -x684 -x683 -x682 -x681 -x680 -x679 -x678
5.39/5.42 v -x677 -x676 x675 -x674 -x673 -x407 x201 -x672 -x671 -x670 x669 -x668 -x667 -x666 -x665 -x664 -x663 -x662 -x661 -x6 -x62 -x462
5.39/5.42 v -x756 -x755 -x754 -x753 -x752 -x751 -x750 -x749 -x748 x747 -x746 -x745 -x538 -x900 -x899 x898 -x897 -x896 -x895 -x894 -x893
5.39/5.42 v -x892 -x891 -x890 -x889 -x400 -x696 -x695 -x694 -x693 x692 -x691 -x690 -x689 -x688 -x687 -x686 -x685 -x433 -x864 -x863 -x862
5.39/5.42 v -x861 -x860 -x859 -x858 x857 -x856 -x855 -x854 -x853 -x172 -x804 -x803 -x802 -x801 -x800 -x799 x798 -x797 -x796 -x795 -x794 -x793
5.39/5.42 v -x392 x612 -x611 -x610 -x609 -x608 -x607 -x606 -x605 -x604 -x603 -x602 -x601 -x301 -x780 x779 -x778 -x777 -x776 -x775 -x774
5.39/5.42 v -x773 -x772 -x771 -x770 -x769 -x265 -x744 -x743 x742 -x741 -x740 -x739 -x738 -x737 -x736 -x735 -x734 -x733 -x587
5.39/5.42 c SCIP Status : problem is solved [optimal solution found]
5.39/5.42 c Solving Time : 5.21
5.39/5.42 c Original Problem :
5.39/5.42 c Problem name : HOME/instance-2664523-1276327903.opb
5.39/5.42 c Variables : 900 (900 binary, 0 integer, 0 implicit integer, 0 continuous)
5.39/5.42 c Constraints : 673 initial, 673 maximal
5.39/5.42 c Presolved Problem :
5.39/5.42 c Problem name : t_HOME/instance-2664523-1276327903.opb
5.39/5.42 c Variables : 900 (900 binary, 0 integer, 0 implicit integer, 0 continuous)
5.39/5.42 c Constraints : 673 initial, 789 maximal
5.39/5.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.39/5.42 c trivial : 0.00 0 0 0 0 0 0 0 0
5.39/5.42 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.39/5.42 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.39/5.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.39/5.42 c implics : 0.00 0 0 0 0 0 0 0 0
5.39/5.42 c probing : 0.00 0 0 0 0 0 0 0 0
5.39/5.42 c setppc : 0.01 0 0 0 0 0 0 0 0
5.39/5.42 c logicor : 0.01 0 0 0 0 0 0 0 0
5.39/5.42 c root node : - 0 - - 0 - - - -
5.39/5.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.39/5.42 c integral : 0 0 0 0 0 0 0 0 0 0
5.39/5.42 c setppc : 49 0 14531 0 12906 78 7668 0 0 0
5.39/5.42 c logicor : 624+ 0 4277 0 12907 20 4285 0 0 0
5.39/5.42 c countsols : 0 0 0 0 12907 0 0 0 0 0
5.39/5.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.39/5.42 c integral : 0.00 0.00 0.00 0.00 0.00
5.39/5.42 c setppc : 0.48 0.00 0.10 0.00 0.38
5.39/5.42 c logicor : 2.76 0.00 0.02 0.00 2.74
5.39/5.42 c countsols : 0.01 0.00 0.00 0.00 0.01
5.39/5.42 c Propagators : Time Calls Cutoffs DomReds
5.39/5.42 c vbounds : 0.00 1 0 0
5.39/5.42 c rootredcost : 0.01 0 0 0
5.39/5.42 c pseudoobj : 0.00 0 0 0
5.39/5.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.39/5.42 c propagation : 0.05 98 98 1144 126.4 0 0.0 -
5.39/5.42 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.39/5.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.39/5.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.39/5.42 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.39/5.42 c applied globally : - - - 247 66.6 - - -
5.39/5.42 c applied locally : - - - 25 114.0 - - -
5.39/5.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.39/5.42 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
5.39/5.42 c redcost : 0.00 0 0 0 0 0
5.39/5.42 c impliedbounds : 0.00 0 0 0 0 0
5.39/5.42 c intobj : 0.00 0 0 0 0 0
5.39/5.42 c cgmip : 0.00 0 0 0 0 0
5.39/5.42 c gomory : 0.00 0 0 0 0 0
5.39/5.42 c strongcg : 0.00 0 0 0 0 0
5.39/5.42 c cmir : 0.00 0 0 0 0 0
5.39/5.42 c flowcover : 0.00 0 0 0 0 0
5.39/5.42 c clique : 0.00 0 0 0 0 0
5.39/5.42 c zerohalf : 0.00 0 0 0 0 0
5.39/5.42 c mcf : 0.00 0 0 0 0 0
5.39/5.42 c rapidlearning : 0.00 0 0 0 0 0
5.39/5.42 c Pricers : Time Calls Vars
5.39/5.42 c problem variables: 0.00 0 0
5.39/5.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.39/5.42 c relpscost : 0.00 0 0 0 0 0 0
5.39/5.42 c pscost : 0.00 0 0 0 0 0 0
5.39/5.42 c inference : 1.59 12906 0 0 0 0 25812
5.39/5.42 c mostinf : 0.00 0 0 0 0 0 0
5.39/5.42 c leastinf : 0.00 0 0 0 0 0 0
5.39/5.42 c fullstrong : 0.00 0 0 0 0 0 0
5.39/5.42 c allfullstrong : 0.00 0 0 0 0 0 0
5.39/5.42 c random : 0.00 0 0 0 0 0 0
5.39/5.42 c Primal Heuristics : Time Calls Found
5.39/5.42 c LP solutions : 0.00 - 0
5.39/5.42 c pseudo solutions : 0.01 - 1
5.39/5.42 c trivial : 0.00 1 0
5.39/5.42 c simplerounding : 0.00 0 0
5.39/5.42 c zirounding : 0.00 0 0
5.39/5.42 c rounding : 0.00 0 0
5.39/5.42 c shifting : 0.00 0 0
5.39/5.42 c intshifting : 0.00 0 0
5.39/5.42 c oneopt : 0.00 0 0
5.39/5.42 c twoopt : 0.00 0 0
5.39/5.42 c fixandinfer : 0.00 0 0
5.39/5.42 c feaspump : 0.00 0 0
5.39/5.42 c coefdiving : 0.00 0 0
5.39/5.42 c pscostdiving : 0.00 0 0
5.39/5.42 c fracdiving : 0.00 0 0
5.39/5.42 c veclendiving : 0.00 0 0
5.39/5.42 c intdiving : 0.00 0 0
5.39/5.42 c actconsdiving : 0.00 0 0
5.39/5.42 c objpscostdiving : 0.00 0 0
5.39/5.42 c rootsoldiving : 0.00 0 0
5.39/5.42 c linesearchdiving : 0.00 0 0
5.39/5.42 c guideddiving : 0.00 0 0
5.39/5.42 c octane : 0.00 0 0
5.39/5.42 c rens : 0.00 0 0
5.39/5.42 c rins : 0.00 0 0
5.39/5.42 c localbranching : 0.00 0 0
5.39/5.42 c mutation : 0.00 0 0
5.39/5.42 c crossover : 0.00 0 0
5.39/5.42 c dins : 0.00 0 0
5.39/5.42 c undercover : 0.00 0 0
5.39/5.42 c nlp : 0.00 0 0
5.39/5.42 c trysol : 0.00 0 0
5.39/5.42 c LP : Time Calls Iterations Iter/call Iter/sec
5.39/5.42 c primal LP : 0.00 0 0 0.00 -
5.39/5.42 c dual LP : 0.00 0 0 0.00 -
5.39/5.42 c lex dual LP : 0.00 0 0 0.00 -
5.39/5.42 c barrier LP : 0.00 0 0 0.00 -
5.39/5.42 c diving/probing LP: 0.00 0 0 0.00 -
5.39/5.42 c strong branching : 0.00 0 0 0.00 -
5.39/5.42 c (at root node) : - 0 0 0.00 -
5.39/5.42 c conflict analysis: 0.00 0 0 0.00 -
5.39/5.42 c B&B Tree :
5.39/5.42 c number of runs : 1
5.39/5.42 c nodes : 12974
5.39/5.42 c nodes (total) : 12974
5.39/5.42 c nodes left : 0
5.39/5.42 c max depth : 565
5.39/5.42 c max depth (total): 565
5.39/5.42 c backtracks : 32 (0.2%)
5.39/5.42 c delayed cutoffs : 32
5.39/5.42 c repropagations : 176 (1039 domain reductions, 31 cutoffs)
5.39/5.42 c avg switch length: 2.02
5.39/5.42 c switching time : 0.12
5.39/5.42 c Solution :
5.39/5.42 c Solutions found : 1 (1 improvements)
5.39/5.42 c First Solution : +0.00000000000000e+00 (in run 1, after 12974 nodes, 5.20 seconds, depth 565, found by <relaxation>)
5.39/5.42 c Primal Bound : +0.00000000000000e+00 (in run 1, after 12974 nodes, 5.20 seconds, depth 565, found by <relaxation>)
5.39/5.42 c Dual Bound : +0.00000000000000e+00
5.39/5.42 c Gap : 0.00 %
5.39/5.42 c Root Dual Bound : +0.00000000000000e+00
5.39/5.42 c Root Iterations : 0
5.39/5.43 c Time complete: 5.43.