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