0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2666187-1276589888.opb>
0.00/0.02 c original problem has 594 variables (594 bin, 0 int, 0 impl, 0 cont) and 530 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 o 594
0.00/0.03 c feasible solution found by trivial heuristic, objective value 5.940000e+02
0.00/0.03 c presolving:
0.00/0.04 c (round 1) 0 del vars, 113 del conss, 0 chg bounds, 113 chg sides, 0 chg coeffs, 0 upgd conss, 58 impls, 0 clqs
0.00/0.04 c (round 2) 15 del vars, 121 del conss, 0 chg bounds, 113 chg sides, 0 chg coeffs, 0 upgd conss, 58 impls, 0 clqs
0.00/0.04 c (round 3) 19 del vars, 122 del conss, 0 chg bounds, 113 chg sides, 0 chg coeffs, 0 upgd conss, 58 impls, 0 clqs
0.00/0.05 c (round 4) 19 del vars, 122 del conss, 0 chg bounds, 113 chg sides, 0 chg coeffs, 408 upgd conss, 58 impls, 0 clqs
0.00/0.06 c (0.0s) probing: 101/575 (17.6%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.06 c presolving (5 rounds):
0.00/0.06 c 19 deleted vars, 122 deleted constraints, 0 tightened bounds, 0 added holes, 113 changed sides, 0 changed coefficients
0.00/0.06 c 58 implications, 0 cliques
0.00/0.06 c presolved problem has 575 variables (575 bin, 0 int, 0 impl, 0 cont) and 408 constraints
0.00/0.06 c 408 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.02
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 1.2.1.2
0.00/0.06 c
0.00/0.06 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c conflict/interconss = 0
0.00/0.06 c
0.00/0.06 c # should binary conflicts be preferred?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c conflict/preferbinary = TRUE
0.00/0.06 c
0.00/0.06 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c constraints/agelimit = 1
0.00/0.06 c
0.00/0.06 c # should enforcement of pseudo solution be disabled?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/disableenfops = TRUE
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1799.99
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 1620
0.00/0.06 c
0.00/0.06 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c lp/solvefreq = 0
0.00/0.06 c
0.00/0.06 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.00/0.06 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.06 c lp/pricing = a
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # priority of node selection rule <dfs> in standard mode
0.00/0.06 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.06 c nodeselection/dfs/stdpriority = 1000000
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/0.06 o 581
0.00/0.06 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.06 c t 0.0s| 1 | 0 | 0 | - |1457k| 0 | - | 575 | 408 | 0 | 0 | 0 | 0 | 0 | -- | 5.810000e+02 | Inf
0.00/0.07 o 148
0.00/0.07 c b 0.0s| 1 | 0 | 0 | - |1837k| 0 | - | 575 | 408 | 575 | 408 | 0 | 0 | 0 | -- | 1.480000e+02 | Inf
0.00/0.09 c 0.1s| 1 | 0 | 402 | - |1829k| 0 | 136 | 575 | 408 | 575 | 408 | 0 | 0 | 0 | 1.085000e+02 | 1.480000e+02 | 36.41%
0.19/0.23 c 0.2s| 1 | 0 | 430 | - |2633k| 0 | 139 | 575 | 408 | 575 | 411 | 3 | 0 | 0 | 1.090000e+02 | 1.480000e+02 | 35.78%
0.29/0.39 c 0.3s| 1 | 0 | 462 | - |3146k| 0 | 155 | 575 | 408 | 575 | 412 | 4 | 0 | 0 | 1.090000e+02 | 1.480000e+02 | 35.78%
0.59/0.64 c 0.6s| 1 | 0 | 540 | - |4243k| 0 | 189 | 575 | 408 | 575 | 413 | 5 | 0 | 0 | 1.090000e+02 | 1.480000e+02 | 35.78%
0.79/0.80 c 0.8s| 1 | 0 | 556 | - |4279k| 0 | 180 | 575 | 408 | 575 | 414 | 6 | 0 | 0 | 1.090000e+02 | 1.480000e+02 | 35.78%
0.89/0.97 c 0.9s| 1 | 0 | 617 | - |4298k| 0 | 189 | 575 | 408 | 575 | 416 | 8 | 0 | 0 | 1.090000e+02 | 1.480000e+02 | 35.78%
1.49/1.55 o 109
1.49/1.55 c E 1.4s| 1 | 0 | 617 | - |4331k| 0 | - | 575 | 408 | 575 | 416 | 8 | 0 | 0 | 1.090000e+02 | 1.090000e+02 | 0.00%
1.49/1.56 c 1.4s| 1 | 0 | 617 | - |4331k| 0 | - | 575 | 408 | 575 | 416 | 8 | 0 | 0 | 1.090000e+02 | 1.090000e+02 | 0.00%
1.49/1.56 c
1.49/1.56 c SCIP Status : problem is solved [optimal solution found]
1.49/1.56 c Solving Time (sec) : 1.45
1.49/1.56 c Solving Nodes : 1
1.49/1.56 c Primal Bound : +1.09000000000000e+02 (12 solutions)
1.49/1.56 c Dual Bound : +1.09000000000000e+02
1.49/1.56 c Gap : 0.00 %
1.49/1.56 s OPTIMUM FOUND
1.49/1.56 v x594 -x593 -x592 x591 -x590 -x589 -x588 -x587 -x586 -x585 -x584 -x583 -x582 -x581 -x580 -x579 -x578 -x577 -x576 -x575 -x574 x573
1.49/1.56 v -x572 x571 x570 -x569 -x568 -x567 -x566 -x565 x564 -x563 -x562 -x561 -x560 -x559 -x558 -x557 -x556 -x555 -x554 -x553 -x552
1.49/1.56 v -x551 x550 -x549 -x548 -x547 -x546 -x545 -x544 -x543 -x542 -x541 -x540 x539 -x538 x537 -x536 -x535 -x534 -x533 -x532 -x531 -x530
1.49/1.56 v -x529 x528 -x527 -x526 -x525 x524 -x523 x522 -x521 x520 -x519 -x518 x517 -x516 -x515 -x514 -x513 -x512 -x511 x510 -x509 -x508
1.49/1.56 v -x507 -x506 x505 x504 x503 -x502 -x501 x500 -x499 -x498 -x497 -x496 -x495 -x494 -x493 -x492 -x491 -x490 -x489 x488 -x487
1.49/1.56 v -x486 x485 -x484 -x483 -x482 -x481 -x480 -x479 -x478 -x477 -x476 -x475 -x474 -x473 -x472 -x471 -x470 -x469 x468 -x467 -x466
1.49/1.56 v x465 -x464 -x463 -x462 -x461 -x460 -x459 -x458 -x457 -x456 -x455 x454 -x453 x452 -x451 x450 -x449 -x448 -x447 -x446 -x445 -x444
1.49/1.56 v -x443 -x442 -x441 -x440 -x439 -x438 x437 -x436 -x435 -x434 -x433 -x432 x431 -x430 -x429 -x428 -x427 -x426 -x425 -x424 -x423
1.49/1.56 v -x422 -x421 -x420 -x419 -x418 -x417 -x416 -x415 -x414 x413 -x412 -x411 -x410 -x409 -x408 -x407 x406 -x405 -x404 -x403 x402
1.49/1.56 v x401 -x400 -x399 x398 -x397 -x396 -x395 -x394 x393 -x392 -x391 x390 -x389 -x388 -x387 x386 -x385 -x384 -x383 -x382 -x381 -x380
1.49/1.56 v -x379 x378 x377 -x376 -x375 x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 x366 -x365 -x364 x363 -x362 -x361 -x360 -x359 -x358
1.49/1.56 v x357 -x356 -x355 -x354 x353 -x352 x351 -x350 -x349 x348 -x347 -x346 -x345 -x344 -x343 -x342 x341 -x340 -x339 -x338 -x337
1.49/1.56 v -x336 x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 x327 x326 -x325 -x324 -x323 -x322 -x321 x320 -x319 -x318 -x317 -x316 x315
1.49/1.56 v -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 x294
1.49/1.56 v -x293 -x292 x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 x281 -x280 -x279 -x278 -x277 x276 x275 -x274 x273 -x272
1.49/1.56 v x271 -x270 -x269 -x268 x267 -x266 -x265 x264 -x263 -x262 x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 x252 x251 -x250
1.49/1.56 v -x249 -x248 -x247 -x246 -x245 -x244 -x243 x242 -x241 x240 x239 -x238 -x237 x236 x235 -x234 -x233 -x232 -x231 -x230 -x229
1.49/1.56 v -x228 -x227 -x226 -x225 x224 -x223 x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 x209 -x208 -x207
1.49/1.56 v x206 -x205 -x204 -x203 -x202 -x201 x200 x199 -x198 -x197 x196 x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 x187 -x186
1.49/1.56 v -x185 -x184 x183 -x182 -x181 -x180 -x179 x178 -x177 x176 -x175 -x174 x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 x165 -x164
1.49/1.56 v -x163 -x162 -x161 -x160 x159 x158 -x157 -x156 -x155 -x154 x153 -x152 -x151 x150 -x149 x148 -x147 -x146 -x145 -x144 -x143 -x142
1.49/1.56 v -x141 x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 x123 -x122 -x121
1.49/1.56 v x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104 -x103 -x102 -x101 -x100
1.49/1.56 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
1.49/1.56 v -x73 -x72 -x71 x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 x49
1.49/1.56 v -x48 x47 -x46 -x45 -x44 x43 -x42 -x41 x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 -x32 -x31 x30 -x29 -x28 x27 -x26 -x25 x24 -x23 -x22
1.49/1.56 v -x21 -x20 x19 -x18 x17 -x16 -x15 -x14 -x13 x12 -x11 -x10 -x9 -x8 x7 x6 -x5 -x4 -x3 -x2 -x1
1.49/1.56 c SCIP Status : problem is solved [optimal solution found]
1.49/1.56 c Solving Time : 1.45
1.49/1.56 c Original Problem :
1.49/1.56 c Problem name : HOME/instance-2666187-1276589888.opb
1.49/1.56 c Variables : 594 (594 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.56 c Constraints : 530 initial, 530 maximal
1.49/1.56 c Presolved Problem :
1.49/1.56 c Problem name : t_HOME/instance-2666187-1276589888.opb
1.49/1.56 c Variables : 575 (575 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.56 c Constraints : 408 initial, 408 maximal
1.49/1.56 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.49/1.56 c trivial : 0.00 0 0 0 0 0 0 0 0
1.49/1.56 c dualfix : 0.01 11 0 0 0 0 0 0 0
1.49/1.56 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.49/1.56 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.49/1.56 c implics : 0.00 0 0 0 0 0 0 0 0
1.49/1.56 c probing : 0.00 0 0 0 0 0 0 0 0
1.49/1.56 c linear : 0.00 0 8 0 0 0 122 113 0
1.49/1.56 c logicor : 0.01 0 0 0 0 0 0 0 0
1.49/1.56 c root node : - 0 - - 0 - - - -
1.49/1.56 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.49/1.56 c integral : 0 0 0 0 0 0 0 0 0 0
1.49/1.56 c logicor : 408 6 87 0 0 0 0 0 0 0
1.49/1.56 c countsols : 0 0 0 0 0 0 0 0 0 0
1.49/1.56 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.49/1.56 c integral : 0.00 0.00 0.00 0.00 0.00
1.49/1.56 c logicor : 0.00 0.00 0.00 0.00 0.00
1.49/1.56 c countsols : 0.00 0.00 0.00 0.00 0.00
1.49/1.56 c Propagators : Time Calls Cutoffs DomReds
1.49/1.56 c vbounds : 0.00 2 0 0
1.49/1.56 c rootredcost : 0.00 0 0 0
1.49/1.56 c pseudoobj : 0.00 3 0 0
1.49/1.56 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.56 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.56 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.56 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.56 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.56 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.56 c applied globally : - - - 0 0.0 - - -
1.49/1.56 c applied locally : - - - 0 0.0 - - -
1.49/1.56 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.56 c cut pool : 0.00 5 - - 8 - (maximal pool size: 269)
1.49/1.56 c redcost : 0.00 6 0 0 0 0
1.49/1.56 c impliedbounds : 0.00 6 0 0 0 0
1.49/1.56 c intobj : 0.00 0 0 0 0 0
1.49/1.56 c cgmip : 0.00 0 0 0 0 0
1.49/1.56 c gomory : 0.47 6 0 0 715 0
1.49/1.56 c strongcg : 0.34 6 0 0 621 0
1.49/1.56 c cmir : 0.04 6 0 0 0 0
1.49/1.56 c flowcover : 0.10 6 0 0 0 0
1.49/1.56 c clique : 0.00 1 0 0 0 0
1.49/1.56 c zerohalf : 0.00 0 0 0 0 0
1.49/1.56 c mcf : 0.00 1 0 0 0 0
1.49/1.56 c rapidlearning : 0.00 0 0 0 0 0
1.49/1.56 c Pricers : Time Calls Vars
1.49/1.56 c problem variables: 0.00 0 0
1.49/1.56 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.56 c pscost : 0.00 0 0 0 0 0 0
1.49/1.56 c inference : 0.00 0 0 0 0 0 0
1.49/1.56 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.56 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.56 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.56 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.56 c random : 0.00 0 0 0 0 0 0
1.49/1.56 c relpscost : 0.00 0 0 0 0 0 0
1.49/1.56 c Primal Heuristics : Time Calls Found
1.49/1.56 c LP solutions : 0.00 - 0
1.49/1.56 c pseudo solutions : 0.00 - 0
1.49/1.56 c crossover : 0.00 0 0
1.49/1.56 c oneopt : 0.01 2 1
1.49/1.56 c trivial : 0.00 2 3
1.49/1.56 c simplerounding : 0.00 6 6
1.49/1.56 c zirounding : 0.00 1 1
1.49/1.56 c rounding : 0.02 6 0
1.49/1.56 c shifting : 0.02 6 0
1.49/1.56 c intshifting : 0.00 0 0
1.49/1.56 c twoopt : 0.00 0 0
1.49/1.56 c fixandinfer : 0.00 0 0
1.49/1.56 c feaspump : 0.00 0 0
1.49/1.56 c coefdiving : 0.00 0 0
1.49/1.56 c pscostdiving : 0.00 0 0
1.49/1.56 c fracdiving : 0.00 0 0
1.49/1.56 c veclendiving : 0.00 0 0
1.49/1.56 c intdiving : 0.00 0 0
1.49/1.56 c actconsdiving : 0.00 0 0
1.49/1.56 c objpscostdiving : 0.00 0 0
1.49/1.56 c rootsoldiving : 0.00 0 0
1.49/1.56 c linesearchdiving : 0.00 0 0
1.49/1.56 c guideddiving : 0.00 0 0
1.49/1.56 c octane : 0.00 0 0
1.49/1.56 c rens : 0.37 1 1
1.49/1.56 c rins : 0.00 0 0
1.49/1.56 c localbranching : 0.00 0 0
1.49/1.56 c mutation : 0.00 0 0
1.49/1.56 c dins : 0.00 0 0
1.49/1.56 c undercover : 0.00 0 0
1.49/1.56 c nlp : 0.00 0 0
1.49/1.56 c trysol : 0.00 0 0
1.49/1.56 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.56 c primal LP : 0.00 0 0 0.00 -
1.49/1.56 c dual LP : 0.05 6 617 102.83 12340.00
1.49/1.56 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.56 c barrier LP : 0.00 0 0 0.00 -
1.49/1.56 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.56 c strong branching : 0.00 0 0 0.00 -
1.49/1.56 c (at root node) : - 0 0 0.00 -
1.49/1.56 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.56 c B&B Tree :
1.49/1.56 c number of runs : 1
1.49/1.56 c nodes : 1
1.49/1.56 c nodes (total) : 1
1.49/1.56 c nodes left : 0
1.49/1.56 c max depth : 0
1.49/1.56 c max depth (total): 0
1.49/1.56 c backtracks : 0 (0.0%)
1.49/1.56 c delayed cutoffs : 0
1.49/1.56 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.49/1.56 c avg switch length: 2.00
1.49/1.56 c switching time : 0.00
1.49/1.56 c Solution :
1.49/1.56 c Solutions found : 12 (4 improvements)
1.49/1.56 c First Solution : +5.94000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.49/1.56 c Primal Bound : +1.09000000000000e+02 (in run 1, after 1 nodes, 1.44 seconds, depth 0, found by <rens>)
1.49/1.56 c Dual Bound : +1.09000000000000e+02
1.49/1.56 c Gap : 0.00 %
1.49/1.56 c Root Dual Bound : +1.09000000000000e+02
1.49/1.56 c Root Iterations : 617
1.49/1.57 c Time complete: 1.57.