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