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-2664661-1276430089.opb>
0.00/0.04 c original problem has 668 variables (668 bin, 0 int, 0 impl, 0 cont) and 1666 constraints
0.00/0.04 c problem read
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.09/0.10 c (round 1) 0 del vars, 60 del conss, 0 chg bounds, 60 chg sides, 0 chg coeffs, 1604 upgd conss, 1644 impls, 0 clqs
0.09/0.11 c (round 2) 0 del vars, 60 del conss, 0 chg bounds, 60 chg sides, 0 chg coeffs, 1605 upgd conss, 1644 impls, 0 clqs
0.09/0.12 c (round 3) 0 del vars, 60 del conss, 0 chg bounds, 60 chg sides, 0 chg coeffs, 1606 upgd conss, 1644 impls, 0 clqs
0.09/0.18 c (round 4) 50 del vars, 60 del conss, 0 chg bounds, 60 chg sides, 0 chg coeffs, 1606 upgd conss, 15564 impls, 0 clqs
0.09/0.19 c presolving (5 rounds):
0.09/0.19 c 50 deleted vars, 60 deleted constraints, 0 tightened bounds, 0 added holes, 60 changed sides, 0 changed coefficients
0.09/0.19 c 15564 implications, 0 cliques
0.09/0.19 c presolved problem has 618 variables (618 bin, 0 int, 0 impl, 0 cont) and 1606 constraints
0.09/0.19 c 1606 constraints of type <logicor>
0.09/0.19 c transformed objective value is always integral (scale: 1)
0.09/0.19 c Presolving Time: 0.12
0.09/0.19 c - non default parameters ----------------------------------------------------------------------
0.09/0.19 c # SCIP version 1.2.1.2
0.09/0.19 c
0.09/0.19 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.19 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.19 c conflict/interconss = 0
0.09/0.19 c
0.09/0.19 c # should binary conflicts be preferred?
0.09/0.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.19 c conflict/preferbinary = TRUE
0.09/0.19 c
0.09/0.19 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.19 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.19 c constraints/agelimit = 1
0.09/0.19 c
0.09/0.19 c # should enforcement of pseudo solution be disabled?
0.09/0.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.19 c constraints/disableenfops = TRUE
0.09/0.19 c
0.09/0.19 c # frequency for displaying node information lines
0.09/0.19 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.19 c display/freq = 10000
0.09/0.19 c
0.09/0.19 c # maximal time in seconds to run
0.09/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.19 c limits/time = 1799.97
0.09/0.19 c
0.09/0.19 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.19 c limits/memory = 1620
0.09/0.19 c
0.09/0.19 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.19 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.19 c lp/solvefreq = -1
0.09/0.19 c
0.09/0.19 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.09/0.19 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.19 c lp/pricing = a
0.09/0.19 c
0.09/0.19 c # should presolving try to simplify inequalities
0.09/0.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.19 c constraints/linear/simplifyinequalities = TRUE
0.09/0.19 c
0.09/0.19 c # should presolving try to simplify knapsacks
0.09/0.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.19 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.19 c
0.09/0.19 c # priority of node selection rule <dfs> in standard mode
0.09/0.19 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.19 c nodeselection/dfs/stdpriority = 1000000
0.09/0.19 c
0.09/0.19 c -----------------------------------------------------------------------------------------------
0.09/0.19 c start solving
0.09/0.19 c
0.09/0.19 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.19 c 0.1s| 1 | 2 | 0 | - |3089k| 0 | - | 618 |1606 | 0 | 0 | 0 | 0 | 0 | 5.000000e+01 | -- | Inf
14.98/15.06 c 13.9s| 10000 | 12 | 0 | 0.0 |3383k| 28 | - | 618 |1683 | 0 | 0 | 0 |7456 | 0 | 5.000000e+01 | -- | Inf
21.38/21.40 o 334
21.38/21.40 c *19.8s| 14125 | 9 | 0 | 0.0 |3408k| 28 | - | 618 |1665 | 0 | 0 | 0 | 10k| 0 | 5.100000e+01 | 3.340000e+02 | 554.90%
29.69/29.78 c 27.5s| 20000 | 9 | 0 | 0.0 |3179k| 28 | - | 618 |1619 | 0 | 0 | 0 | 14k| 0 | 6.200000e+01 | 3.340000e+02 | 438.71%
30.88/30.95 c
30.88/30.95 c SCIP Status : problem is solved [optimal solution found]
30.88/30.95 c Solving Time (sec) : 28.54
30.88/30.95 c Solving Nodes : 20849
30.88/30.95 c Primal Bound : +3.34000000000000e+02 (1 solutions)
30.88/30.95 c Dual Bound : +3.34000000000000e+02
30.88/30.95 c Gap : 0.00 %
30.88/30.95 s OPTIMUM FOUND
30.88/30.95 v -x668 x667 -x666 x665 x664 -x663 x662 -x661 -x660 x659 x658 -x657 -x656 x655 x654 -x653 x652 -x651 -x650 x649 x648 -x647 x646 -x645
30.88/30.95 v -x644 x643 x642 -x641 -x640 x639 -x638 x637 -x636 x635 x634 -x633 -x632 x631 -x630 x629 -x628 x627 x626 -x625 x624 -x623
30.88/30.95 v -x622 x621 -x620 x619 x618 -x617 -x616 x615 -x614 x613 -x612 x611 -x610 x609 -x608 x607 x606 -x605 -x604 x603 x602 -x601 -x600
30.88/30.95 v x599 -x598 x597 x596 -x595 x594 -x593 -x592 x591 x590 -x589 x588 -x587 -x586 x585 -x584 x583 -x582 x581 x580 -x579 -x578 x577
30.88/30.95 v -x576 x575 x574 -x573 -x572 x571 x570 -x569 -x568 x567 x566 -x565 -x564 x563 -x562 x561 -x560 x559 x558 -x557 x556 -x555
30.88/30.95 v -x554 x553 x552 -x551 x550 -x549 -x548 x547 -x546 x545 -x544 x543 x542 -x541 x540 -x539 -x538 x537 -x536 x535 x534 -x533 x532
30.88/30.95 v -x531 -x530 x529 -x528 x527 x526 -x525 -x524 x523 -x522 x521 -x520 x519 x518 -x517 -x516 x515 x514 -x513 x512 -x511 -x510 x509
30.88/30.95 v x508 -x507 -x506 x505 -x504 x503 x502 -x501 -x500 x499 -x498 x497 x496 -x495 -x494 x493 -x492 x491 x490 -x489 -x488 x487 -x486
30.88/30.95 v x485 -x484 x483 x482 -x481 -x480 x479 -x478 x477 -x476 x475 x474 -x473 -x472 x471 -x470 x469 x468 -x467 -x466 x465 -x464
30.88/30.95 v x463 x462 -x461 -x460 x459 -x458 x457 x456 -x455 -x454 x453 x452 -x451 -x450 x449 -x448 x447 x446 -x445 -x444 x443 x442 -x441
30.88/30.95 v x440 -x439 -x438 x437 x436 -x435 x434 -x433 x432 -x431 -x430 x429 x428 -x427 x426 -x425 -x424 x423 x422 -x421 x420 -x419 -x418
30.88/30.95 v x417 x416 -x415 -x414 x413 -x412 x411 x410 -x409 -x408 x407 -x406 x405 x404 -x403 x402 -x401 -x400 x399 -x398 x397 -x396
30.88/30.95 v x395 -x394 x393 x392 -x391 -x390 x389 -x388 x387 x386 -x385 -x384 x383 -x382 x381 x380 -x379 x378 -x377 -x376 x375 -x374 x373
30.88/30.95 v x372 -x371 -x370 x369 -x368 x367 x366 -x365 x364 -x363 -x362 x361 x360 -x359 -x358 x357 -x356 x355 -x354 x353 x352 -x351 x350
30.88/30.95 v -x349 x348 -x347 -x346 x345 x344 -x343 -x342 x341 -x340 x339 x338 -x337 x336 -x335 -x334 x333 -x332 x331 x330 -x329 -x328 x327
30.88/30.95 v -x326 x325 x324 -x323 x322 -x321 -x320 x319 -x318 x317 x316 -x315 -x314 x313 -x312 x311 x310 -x309 -x308 x307 x306 -x305
30.88/30.95 v x304 -x303 -x302 x301 x300 -x299 -x298 x297 -x296 x295 x294 -x293 -x292 x291 -x290 x289 -x288 x287 x286 -x285 x284 -x283 x282
30.88/30.95 v -x281 -x280 x279 -x278 x277 x276 -x275 -x274 x273 -x272 x271 -x270 x269 -x268 x267 x266 -x265 -x264 x263 -x262 x261 x260 -x259
30.88/30.95 v x258 -x257 -x256 x255 x254 -x253 -x252 x251 -x250 x249 x248 -x247 x246 -x245 x244 -x243 x242 -x241 x240 -x239 x238 -x237 x236
30.88/30.95 v -x235 x234 -x233 x232 -x231 x230 -x229 x228 -x227 x226 -x225 x224 -x223 x222 -x221 x220 -x219 x218 -x217 x216 -x215 x214
30.88/30.95 v -x213 x212 -x211 x210 -x209 x208 -x207 x206 -x205 x204 -x203 x202 -x201 x200 -x199 x198 -x197 x196 -x195 x194 -x193 x192 -x191
30.88/30.95 v x190 -x189 x188 -x187 x186 -x185 x184 -x183 x182 -x181 x180 -x179 x178 -x177 x176 -x175 x174 -x173 x172 -x171 x170 -x169 x168
30.88/30.95 v -x167 x166 -x165 x164 -x163 x162 -x161 x160 -x159 x158 -x157 -x156 x155 x154 -x153 x152 -x151 x150 -x149 x148 -x147 -x146
30.88/30.95 v x145 x144 -x143 x142 -x141 x140 -x139 -x138 x137 x136 -x135 x134 -x133 x132 -x131 -x130 x129 x128 -x127 x126 -x125 -x124 x123
30.88/30.95 v -x122 x121 -x120 x119 x118 -x117 x116 -x115 x114 -x113 x112 -x111 -x110 x109 x108 -x107 x106 -x105 x104 -x103 -x102 x101 -x100
30.88/30.95 v x99 x98 -x97 x96 -x95 -x94 x93 x92 -x91 -x90 x89 x88 -x87 -x86 x85 x84 -x83 -x82 x81 x80 -x79 -x78 x77 x76 -x75 -x74 x73 x72
30.88/30.95 v -x71 -x70 x69 x68 -x67 -x66 x65 x64 -x63 -x62 x61 x60 -x59 -x58 x57 x56 -x55 -x54 x53 x52 -x51 -x50 x49 x48 -x47 -x46 x45
30.88/30.95 v x44 -x43 -x42 x41 x40 -x39 -x38 x37 x36 -x35 -x34 x33 x32 -x31 -x30 x29 x28 -x27 -x26 x25 x24 -x23 -x22 x21 x20 -x19 -x18 x17
30.88/30.95 v x16 -x15 -x14 x13 x12 -x11 -x10 x9 -x8 x7 x6 -x5 -x4 x3 -x2 x1
30.88/30.95 c SCIP Status : problem is solved [optimal solution found]
30.88/30.95 c Solving Time : 28.54
30.88/30.95 c Original Problem :
30.88/30.95 c Problem name : HOME/instance-2664661-1276430089.opb
30.88/30.95 c Variables : 668 (668 binary, 0 integer, 0 implicit integer, 0 continuous)
30.88/30.95 c Constraints : 1666 initial, 1666 maximal
30.88/30.95 c Presolved Problem :
30.88/30.95 c Problem name : t_HOME/instance-2664661-1276430089.opb
30.88/30.95 c Variables : 618 (618 binary, 0 integer, 0 implicit integer, 0 continuous)
30.88/30.95 c Constraints : 1606 initial, 2028 maximal
30.88/30.95 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
30.88/30.95 c trivial : 0.00 0 0 0 0 0 0 0 0
30.88/30.95 c dualfix : 0.00 0 0 0 0 0 0 0 0
30.88/30.95 c boundshift : 0.00 0 0 0 0 0 0 0 0
30.88/30.95 c inttobinary : 0.00 0 0 0 0 0 0 0 0
30.88/30.95 c implics : 0.00 0 0 0 0 0 0 0 0
30.88/30.95 c probing : 0.04 0 50 0 0 0 0 0 0
30.88/30.95 c linear : 0.02 0 0 0 0 0 60 60 0
30.88/30.95 c logicor : 0.04 0 0 0 0 0 0 0 0
30.88/30.95 c root node : - 294 - - 294 - - - -
30.88/30.95 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
30.88/30.95 c integral : 0 0 0 0 0 0 0 0 0 0
30.88/30.95 c logicor : 1606+ 0 463705 0 1 13699 2467707 0 0 0
30.88/30.95 c countsols : 0 0 0 0 1 0 0 0 0 0
30.88/30.95 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
30.88/30.95 c integral : 0.00 0.00 0.00 0.00 0.00
30.88/30.95 c logicor : 7.17 0.00 7.17 0.00 0.00
30.88/30.95 c countsols : 0.00 0.00 0.00 0.00 0.00
30.88/30.95 c Propagators : Time Calls Cutoffs DomReds
30.88/30.95 c vbounds : 0.17 2 0 0
30.88/30.95 c rootredcost : 0.32 0 0 0
30.88/30.95 c pseudoobj : 12.00 477110 0 0
30.88/30.95 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
30.88/30.95 c propagation : 1.28 13699 13698 13698 10.9 1105 10.2 -
30.88/30.95 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
30.88/30.95 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
30.88/30.95 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
30.88/30.95 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
30.88/30.95 c applied globally : - - - 14803 10.9 - - -
30.88/30.95 c applied locally : - - - 0 0.0 - - -
30.88/30.95 c Separators : Time Calls Cutoffs DomReds Cuts Conss
30.88/30.95 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
30.88/30.95 c redcost : 0.00 0 0 0 0 0
30.88/30.95 c impliedbounds : 0.00 0 0 0 0 0
30.88/30.95 c intobj : 0.00 0 0 0 0 0
30.88/30.95 c cgmip : 0.00 0 0 0 0 0
30.88/30.95 c gomory : 0.00 0 0 0 0 0
30.88/30.95 c strongcg : 0.00 0 0 0 0 0
30.88/30.95 c cmir : 0.00 0 0 0 0 0
30.88/30.95 c flowcover : 0.00 0 0 0 0 0
30.88/30.95 c clique : 0.00 0 0 0 0 0
30.88/30.95 c zerohalf : 0.00 0 0 0 0 0
30.88/30.95 c mcf : 0.00 0 0 0 0 0
30.88/30.95 c rapidlearning : 0.00 0 0 0 0 0
30.88/30.95 c Pricers : Time Calls Vars
30.88/30.95 c problem variables: 0.00 0 0
30.88/30.95 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
30.88/30.95 c relpscost : 0.00 0 0 0 0 0 0
30.88/30.95 c pscost : 0.00 0 0 0 0 0 0
30.88/30.95 c inference : 1.09 13738 0 0 0 0 27476
30.88/30.95 c mostinf : 0.00 0 0 0 0 0 0
30.88/30.95 c leastinf : 0.00 0 0 0 0 0 0
30.88/30.95 c fullstrong : 0.00 0 0 0 0 0 0
30.88/30.95 c allfullstrong : 0.00 0 0 0 0 0 0
30.88/30.95 c random : 0.00 0 0 0 0 0 0
30.88/30.95 c Primal Heuristics : Time Calls Found
30.88/30.95 c LP solutions : 0.00 - 0
30.88/30.95 c pseudo solutions : 0.00 - 1
30.88/30.95 c oneopt : 0.01 0 0
30.88/30.95 c trivial : 0.01 2 0
30.88/30.95 c simplerounding : 0.00 0 0
30.88/30.95 c zirounding : 0.00 0 0
30.88/30.95 c rounding : 0.00 0 0
30.88/30.95 c shifting : 0.00 0 0
30.88/30.95 c intshifting : 0.00 0 0
30.88/30.95 c twoopt : 0.00 0 0
30.88/30.95 c fixandinfer : 0.00 0 0
30.88/30.95 c feaspump : 0.00 0 0
30.88/30.95 c coefdiving : 0.00 0 0
30.88/30.95 c pscostdiving : 0.00 0 0
30.88/30.95 c fracdiving : 0.00 0 0
30.88/30.95 c veclendiving : 0.00 0 0
30.88/30.95 c intdiving : 0.00 0 0
30.88/30.95 c actconsdiving : 0.00 0 0
30.88/30.95 c objpscostdiving : 0.00 0 0
30.88/30.95 c rootsoldiving : 0.00 0 0
30.88/30.95 c linesearchdiving : 0.00 0 0
30.88/30.95 c guideddiving : 0.00 0 0
30.88/30.95 c octane : 0.00 0 0
30.88/30.95 c rens : 0.00 0 0
30.88/30.95 c rins : 0.00 0 0
30.88/30.95 c localbranching : 0.00 0 0
30.88/30.95 c mutation : 0.00 0 0
30.88/30.95 c crossover : 0.00 0 0
30.88/30.95 c dins : 0.00 0 0
30.88/30.95 c undercover : 0.00 0 0
30.88/30.95 c nlp : 0.02 0 0
30.88/30.95 c trysol : 0.01 0 0
30.88/30.95 c LP : Time Calls Iterations Iter/call Iter/sec
30.88/30.95 c primal LP : 0.00 0 0 0.00 -
30.88/30.95 c dual LP : 0.00 0 0 0.00 -
30.88/30.95 c lex dual LP : 0.00 0 0 0.00 -
30.88/30.95 c barrier LP : 0.00 0 0 0.00 -
30.88/30.95 c diving/probing LP: 0.00 0 0 0.00 -
30.88/30.95 c strong branching : 0.00 0 0 0.00 -
30.88/30.95 c (at root node) : - 0 0 0.00 -
30.88/30.95 c conflict analysis: 0.00 0 0 0.00 -
30.88/30.95 c B&B Tree :
30.88/30.95 c number of runs : 1
30.88/30.95 c nodes : 20849
30.88/30.95 c nodes (total) : 20849
30.88/30.95 c nodes left : 0
30.88/30.95 c max depth : 28
30.88/30.95 c max depth (total): 28
30.88/30.95 c backtracks : 6616 (31.7%)
30.88/30.95 c delayed cutoffs : 6628
30.88/30.95 c repropagations : 20507 (1188724 domain reductions, 6589 cutoffs)
30.88/30.95 c avg switch length: 2.66
30.88/30.95 c switching time : 3.48
30.88/30.95 c Solution :
30.88/30.95 c Solutions found : 1 (1 improvements)
30.88/30.95 c First Solution : +3.34000000000000e+02 (in run 1, after 14125 nodes, 19.76 seconds, depth 16, found by <relaxation>)
30.88/30.95 c Primal Bound : +3.34000000000000e+02 (in run 1, after 14125 nodes, 19.76 seconds, depth 16, found by <relaxation>)
30.88/30.95 c Dual Bound : +3.34000000000000e+02
30.88/30.95 c Gap : 0.00 %
30.88/30.95 c Root Dual Bound : +5.00000000000000e+01
30.88/30.95 c Root Iterations : 0
30.88/30.96 c Time complete: 30.94.