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