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-2664714-1276472243.opb>
0.00/0.04 c original problem has 682 variables (682 bin, 0 int, 0 impl, 0 cont) and 1701 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, 1639 upgd conss, 1658 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, 1640 upgd conss, 1658 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, 1641 upgd conss, 1658 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, 1641 upgd conss, 15578 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 15578 implications, 0 cliques
0.09/0.19 c presolved problem has 632 variables (632 bin, 0 int, 0 impl, 0 cont) and 1641 constraints
0.09/0.19 c 1641 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 | - |3145k| 0 | - | 632 |1641 | 0 | 0 | 0 | 0 | 0 | 5.000000e+01 | -- | Inf
9.18/9.21 o 341
9.18/9.21 c * 8.4s| 5715 | 15 | 0 | 0.0 |3437k| 31 | - | 632 |1676 | 0 | 0 | 0 |3968 | 0 | 5.000000e+01 | 3.410000e+02 | 582.00%
15.18/15.26 c 14.0s| 10000 | 12 | 0 | 0.0 |3412k| 31 | - | 632 |1675 | 0 | 0 | 0 |6911 | 0 | 5.000000e+01 | 3.410000e+02 | 582.00%
33.28/33.33 c 30.7s| 20000 | 9 | 0 | 0.0 |3421k| 31 | - | 632 |1685 | 0 | 0 | 0 | 14k| 0 | 5.100000e+01 | 3.410000e+02 | 568.63%
39.38/39.42 c
39.38/39.42 c SCIP Status : problem is solved [optimal solution found]
39.38/39.42 c Solving Time (sec) : 36.32
39.38/39.42 c Solving Nodes : 24062
39.38/39.42 c Primal Bound : +3.41000000000000e+02 (1 solutions)
39.38/39.42 c Dual Bound : +3.41000000000000e+02
39.38/39.42 c Gap : 0.00 %
39.38/39.43 s OPTIMUM FOUND
39.38/39.43 v -x682 x681 x680 -x679 -x678 x677 -x676 x675 -x674 x673 -x672 x671 -x670 x669 -x668 x667 -x666 x665 x664 -x663 x662 -x661 -x660
39.38/39.43 v x659 x658 -x657 -x656 x655 x654 -x653 x652 -x651 -x650 x649 x648 -x647 x646 -x645 x644 -x643 -x642 x641 -x640 x639 x638 -x637
39.38/39.43 v -x636 x635 -x634 x633 -x632 x631 -x630 x629 -x628 x627 x626 -x625 x624 -x623 -x622 x621 -x620 x619 x618 -x617 x616 -x615 x614
39.38/39.43 v -x613 x612 -x611 x610 -x609 -x608 x607 -x606 x605 x604 -x603 x602 -x601 x600 -x599 x598 -x597 x596 -x595 -x594 x593 x592 -x591
39.38/39.43 v x590 -x589 -x588 x587 x586 -x585 x584 -x583 x582 -x581 -x580 x579 x578 -x577 x576 -x575 -x574 x573 -x572 x571 -x570 x569
39.38/39.43 v -x568 x567 -x566 x565 -x564 x563 x562 -x561 -x560 x559 -x558 x557 -x556 x555 x554 -x553 x552 -x551 -x550 x549 x548 -x547 x546
39.38/39.43 v -x545 -x544 x543 -x542 x541 -x540 x539 x538 -x537 -x536 x535 -x534 x533 x532 -x531 -x530 x529 -x528 x527 -x526 x525 -x524 x523
39.38/39.43 v x522 -x521 x520 -x519 -x518 x517 -x516 x515 x514 -x513 x512 -x511 -x510 x509 x508 -x507 -x506 x505 -x504 x503 x502 -x501 x500
39.38/39.43 v -x499 x498 -x497 x496 -x495 -x494 x493 -x492 x491 x490 -x489 -x488 x487 -x486 x485 -x484 x483 -x482 x481 x480 -x479 -x478
39.38/39.43 v x477 -x476 x475 x474 -x473 x472 -x471 x470 -x469 x468 -x467 -x466 x465 -x464 x463 x462 -x461 -x460 x459 x458 -x457 x456 -x455
39.38/39.43 v x454 -x453 -x452 x451 x450 -x449 x448 -x447 x446 -x445 -x444 x443 x442 -x441 -x440 x439 -x438 x437 -x436 x435 x434 -x433 x432
39.38/39.43 v -x431 -x430 x429 x428 -x427 -x426 x425 x424 -x423 x422 -x421 x420 -x419 -x418 x417 -x416 x415 -x414 x413 -x412 x411 -x410
39.38/39.43 v x409 -x408 x407 x406 -x405 x404 -x403 -x402 x401 x400 -x399 x398 -x397 -x396 x395 -x394 x393 x392 -x391 -x390 x389 -x388 x387
39.38/39.43 v -x386 x385 -x384 x383 -x382 x381 x380 -x379 -x378 x377 x376 -x375 x374 -x373 -x372 x371 -x370 x369 x368 -x367 -x366 x365 x364
39.38/39.43 v -x363 x362 -x361 x360 -x359 x358 -x357 -x356 x355 x354 -x353 x352 -x351 x350 -x349 x348 -x347 -x346 x345 -x344 x343 -x342 x341
39.38/39.43 v -x340 x339 -x338 x337 x336 -x335 x334 -x333 x332 -x331 x330 -x329 x328 -x327 -x326 x325 x324 -x323 x322 -x321 x320 -x319
39.38/39.43 v x318 -x317 x316 -x315 x314 -x313 -x312 x311 -x310 x309 x308 -x307 -x306 x305 x304 -x303 -x302 x301 x300 -x299 x298 -x297 x296
39.38/39.43 v -x295 -x294 x293 x292 -x291 x290 -x289 x288 -x287 x286 -x285 x284 -x283 x282 -x281 x280 -x279 x278 -x277 -x276 x275 x274 -x273
39.38/39.43 v -x272 x271 -x270 x269 x268 -x267 x266 -x265 x264 -x263 -x262 x261 -x260 x259 -x258 x257 -x256 x255 x254 -x253 -x252 x251 -x250
39.38/39.43 v x249 -x248 x247 x246 -x245 x244 -x243 -x242 x241 x240 -x239 x238 -x237 x236 -x235 -x234 x233 x232 -x231 x230 -x229 x228
39.38/39.43 v -x227 -x226 x225 x224 -x223 x222 -x221 x220 -x219 -x218 x217 x216 -x215 x214 -x213 x212 -x211 -x210 x209 x208 -x207 x206 -x205
39.38/39.43 v x204 -x203 -x202 x201 x200 -x199 x198 -x197 x196 -x195 -x194 x193 x192 -x191 x190 -x189 -x188 x187 -x186 x185 -x184 x183 x182
39.38/39.43 v -x181 x180 -x179 x178 -x177 x176 -x175 -x174 x173 x172 -x171 x170 -x169 x168 -x167 -x166 x165 x164 -x163 x162 -x161 x160 -x159
39.38/39.43 v -x158 x157 x156 -x155 x154 -x153 x152 -x151 -x150 x149 x148 -x147 x146 -x145 x144 -x143 -x142 x141 x140 -x139 x138 -x137
39.38/39.43 v x136 -x135 -x134 x133 x132 -x131 x130 -x129 x128 -x127 -x126 x125 x124 -x123 x122 -x121 x120 -x119 -x118 x117 x116 -x115 x114
39.38/39.43 v -x113 x112 -x111 -x110 x109 x108 -x107 x106 -x105 x104 -x103 -x102 x101 x100 -x99 x98 -x97 x96 -x95 -x94 x93 x92 -x91 x90 -x89
39.38/39.43 v x88 -x87 -x86 x85 x84 -x83 x82 -x81 x80 -x79 -x78 x77 x76 -x75 x74 -x73 x72 -x71 -x70 x69 -x68 x67 x66 -x65 x64 -x63 -x62
39.38/39.43 v x61 x60 -x59 -x58 x57 x56 -x55 -x54 x53 x52 -x51 -x50 x49 x48 -x47 -x46 x45 x44 -x43 -x42 x41 x40 -x39 -x38 x37 x36 -x35 -x34
39.38/39.43 v x33 x32 -x31 -x30 x29 x28 -x27 -x26 x25 x24 -x23 -x22 x21 x20 -x19 -x18 x17 x16 -x15 -x14 x13 x12 -x11 -x10 x9 -x8 x7 x6 -x5
39.38/39.43 v -x4 x3 -x2 x1
39.38/39.43 c SCIP Status : problem is solved [optimal solution found]
39.38/39.43 c Solving Time : 36.32
39.38/39.43 c Original Problem :
39.38/39.43 c Problem name : HOME/instance-2664714-1276472243.opb
39.38/39.43 c Variables : 682 (682 binary, 0 integer, 0 implicit integer, 0 continuous)
39.38/39.43 c Constraints : 1701 initial, 1701 maximal
39.38/39.43 c Presolved Problem :
39.38/39.43 c Problem name : t_HOME/instance-2664714-1276472243.opb
39.38/39.43 c Variables : 632 (632 binary, 0 integer, 0 implicit integer, 0 continuous)
39.38/39.43 c Constraints : 1641 initial, 1761 maximal
39.38/39.43 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
39.38/39.43 c trivial : 0.00 0 0 0 0 0 0 0 0
39.38/39.43 c dualfix : 0.00 0 0 0 0 0 0 0 0
39.38/39.43 c boundshift : 0.00 0 0 0 0 0 0 0 0
39.38/39.43 c inttobinary : 0.00 0 0 0 0 0 0 0 0
39.38/39.43 c implics : 0.00 0 0 0 0 0 0 0 0
39.38/39.43 c probing : 0.04 0 50 0 0 0 0 0 0
39.38/39.43 c linear : 0.03 0 0 0 0 0 60 60 0
39.38/39.43 c logicor : 0.05 0 0 0 0 0 0 0 0
39.38/39.43 c root node : - 233 - - 233 - - - -
39.38/39.43 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
39.38/39.43 c integral : 0 0 0 0 0 0 0 0 0 0
39.38/39.43 c logicor : 1641+ 0 616393 0 1 16132 2933936 0 0 0
39.38/39.43 c countsols : 0 0 0 0 1 0 0 0 0 0
39.38/39.43 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
39.38/39.43 c integral : 0.00 0.00 0.00 0.00 0.00
39.38/39.43 c logicor : 8.88 0.00 8.88 0.00 0.00
39.38/39.43 c countsols : 0.00 0.00 0.00 0.00 0.00
39.38/39.43 c Propagators : Time Calls Cutoffs DomReds
39.38/39.43 c vbounds : 0.27 2 0 0
39.38/39.43 c rootredcost : 0.29 0 0 0
39.38/39.43 c pseudoobj : 16.26 631530 0 0
39.38/39.43 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
39.38/39.43 c propagation : 1.39 16132 16131 16131 10.9 952 6.6 -
39.38/39.43 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
39.38/39.43 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
39.38/39.43 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
39.38/39.43 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
39.38/39.43 c applied globally : - - - 17083 10.7 - - -
39.38/39.43 c applied locally : - - - 0 0.0 - - -
39.38/39.43 c Separators : Time Calls Cutoffs DomReds Cuts Conss
39.38/39.43 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
39.38/39.43 c redcost : 0.00 0 0 0 0 0
39.38/39.43 c impliedbounds : 0.00 0 0 0 0 0
39.38/39.43 c intobj : 0.00 0 0 0 0 0
39.38/39.43 c cgmip : 0.00 0 0 0 0 0
39.38/39.43 c gomory : 0.00 0 0 0 0 0
39.38/39.43 c strongcg : 0.00 0 0 0 0 0
39.38/39.43 c cmir : 0.00 0 0 0 0 0
39.38/39.43 c flowcover : 0.00 0 0 0 0 0
39.38/39.43 c clique : 0.00 0 0 0 0 0
39.38/39.43 c zerohalf : 0.00 0 0 0 0 0
39.38/39.43 c mcf : 0.00 0 0 0 0 0
39.38/39.43 c rapidlearning : 0.00 0 0 0 0 0
39.38/39.43 c Pricers : Time Calls Vars
39.38/39.43 c problem variables: 0.00 0 0
39.38/39.43 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
39.38/39.43 c relpscost : 0.00 0 0 0 0 0 0
39.38/39.43 c pscost : 0.00 0 0 0 0 0 0
39.38/39.43 c inference : 1.35 16272 0 0 0 0 32544
39.38/39.43 c mostinf : 0.00 0 0 0 0 0 0
39.38/39.43 c leastinf : 0.00 0 0 0 0 0 0
39.38/39.43 c fullstrong : 0.00 0 0 0 0 0 0
39.38/39.43 c allfullstrong : 0.00 0 0 0 0 0 0
39.38/39.43 c random : 0.00 0 0 0 0 0 0
39.38/39.43 c Primal Heuristics : Time Calls Found
39.38/39.43 c LP solutions : 0.00 - 0
39.38/39.43 c pseudo solutions : 0.00 - 1
39.38/39.43 c oneopt : 0.02 0 0
39.38/39.43 c trivial : 0.00 2 0
39.38/39.43 c simplerounding : 0.00 0 0
39.38/39.43 c zirounding : 0.00 0 0
39.38/39.43 c rounding : 0.00 0 0
39.38/39.43 c shifting : 0.00 0 0
39.38/39.43 c intshifting : 0.00 0 0
39.38/39.43 c twoopt : 0.00 0 0
39.38/39.43 c fixandinfer : 0.00 0 0
39.38/39.43 c feaspump : 0.00 0 0
39.38/39.43 c coefdiving : 0.00 0 0
39.38/39.43 c pscostdiving : 0.00 0 0
39.38/39.43 c fracdiving : 0.00 0 0
39.38/39.43 c veclendiving : 0.00 0 0
39.38/39.43 c intdiving : 0.00 0 0
39.38/39.43 c actconsdiving : 0.00 0 0
39.38/39.43 c objpscostdiving : 0.00 0 0
39.38/39.43 c rootsoldiving : 0.00 0 0
39.38/39.43 c linesearchdiving : 0.00 0 0
39.38/39.43 c guideddiving : 0.00 0 0
39.38/39.43 c octane : 0.00 0 0
39.38/39.43 c rens : 0.00 0 0
39.38/39.43 c rins : 0.00 0 0
39.38/39.43 c localbranching : 0.00 0 0
39.38/39.43 c mutation : 0.00 0 0
39.38/39.43 c crossover : 0.00 0 0
39.38/39.43 c dins : 0.00 0 0
39.38/39.43 c undercover : 0.00 0 0
39.38/39.43 c nlp : 0.00 0 0
39.38/39.43 c trysol : 0.02 0 0
39.38/39.43 c LP : Time Calls Iterations Iter/call Iter/sec
39.38/39.43 c primal LP : 0.00 0 0 0.00 -
39.38/39.43 c dual LP : 0.00 0 0 0.00 -
39.38/39.43 c lex dual LP : 0.00 0 0 0.00 -
39.38/39.43 c barrier LP : 0.00 0 0 0.00 -
39.38/39.43 c diving/probing LP: 0.00 0 0 0.00 -
39.38/39.43 c strong branching : 0.00 0 0 0.00 -
39.38/39.43 c (at root node) : - 0 0 0.00 -
39.38/39.43 c conflict analysis: 0.00 0 0 0.00 -
39.38/39.43 c B&B Tree :
39.38/39.43 c number of runs : 1
39.38/39.43 c nodes : 24062
39.38/39.43 c nodes (total) : 24062
39.38/39.43 c nodes left : 0
39.38/39.43 c max depth : 31
39.38/39.43 c max depth (total): 31
39.38/39.43 c backtracks : 8378 (34.8%)
39.38/39.43 c delayed cutoffs : 8483
39.38/39.43 c repropagations : 23596 (1522060 domain reductions, 8343 cutoffs)
39.38/39.43 c avg switch length: 2.63
39.38/39.43 c switching time : 3.56
39.38/39.43 c Solution :
39.38/39.43 c Solutions found : 1 (1 improvements)
39.38/39.43 c First Solution : +3.41000000000000e+02 (in run 1, after 5715 nodes, 8.41 seconds, depth 21, found by <relaxation>)
39.38/39.43 c Primal Bound : +3.41000000000000e+02 (in run 1, after 5715 nodes, 8.41 seconds, depth 21, found by <relaxation>)
39.38/39.43 c Dual Bound : +3.41000000000000e+02
39.38/39.43 c Gap : 0.00 %
39.38/39.43 c Root Dual Bound : +5.00000000000000e+01
39.38/39.43 c Root Iterations : 0
39.38/39.44 c Time complete: 39.42.