0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667474-1276405516.opb>
0.00/0.05 c original problem has 720 variables (720 bin, 0 int, 0 impl, 0 cont) and 2168 constraints
0.00/0.05 c problem read
0.00/0.05 c presolving settings loaded
0.00/0.06 c presolving:
0.09/0.12 c (round 1) 120 del vars, 120 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1928 upgd conss, 992 impls, 0 clqs
0.09/0.13 c (round 2) 120 del vars, 240 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1928 upgd conss, 992 impls, 0 clqs
0.09/0.16 c (0.1s) probing: 101/600 (16.8%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.09/0.16 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.16 c presolving (3 rounds):
0.09/0.16 c 120 deleted vars, 240 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.16 c 992 implications, 0 cliques
0.09/0.16 c presolved problem has 600 variables (600 bin, 0 int, 0 impl, 0 cont) and 1928 constraints
0.09/0.16 c 24 constraints of type <knapsack>
0.09/0.16 c 1904 constraints of type <logicor>
0.09/0.16 c transformed objective value is always integral (scale: 1)
0.09/0.16 c Presolving Time: 0.08
0.09/0.16 c - non default parameters ----------------------------------------------------------------------
0.09/0.16 c # SCIP version 1.2.1.2
0.09/0.16 c
0.09/0.16 c # frequency for displaying node information lines
0.09/0.16 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.16 c display/freq = 10000
0.09/0.16 c
0.09/0.16 c # maximal time in seconds to run
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.16 c limits/time = 1799.96
0.09/0.16 c
0.09/0.16 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.16 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.16 c limits/memory = 1620
0.09/0.16 c
0.09/0.16 c # should presolving try to simplify inequalities
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.16 c constraints/linear/simplifyinequalities = TRUE
0.09/0.16 c
0.09/0.16 c # should presolving try to simplify knapsacks
0.09/0.16 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.16 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.16 c
0.09/0.16 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.16 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.16 c separating/rapidlearning/freq = 0
0.09/0.16 c
0.09/0.16 c -----------------------------------------------------------------------------------------------
0.09/0.16 c start solving
0.09/0.16 c
0.09/0.18 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.18 c 0.1s| 1 | 0 | 153 | - |4278k| 0 | 12 | 600 |1928 | 600 |1928 | 0 | 0 | 0 | 6.000000e+01 | -- | Inf
0.09/0.18 o 62
0.09/0.18 c s 0.1s| 1 | 0 | 153 | - |4293k| 0 | 12 | 600 |1928 | 600 |1928 | 0 | 0 | 0 | 6.000000e+01 | 6.200000e+01 | 3.33%
0.39/0.43 c 0.3s| 1 | 0 | 169 | - |4542k| 0 | 0 | 600 |2180 | 600 |1598 | 2 | 0 | 0 | 6.000000e+01 | 6.200000e+01 | 3.33%
0.39/0.43 c (run 1, node 1) restarting after 83 global fixings of integer variables
0.39/0.43 c
0.39/0.43 c (restart) converted 2 cuts from the global cut pool into linear constraints
0.39/0.43 c
0.39/0.43 c presolving:
0.39/0.44 c (round 1) 249 del vars, 379 del conss, 0 chg bounds, 14 chg sides, 0 chg coeffs, 0 upgd conss, 2344 impls, 0 clqs
0.39/0.46 c (round 2) 249 del vars, 379 del conss, 0 chg bounds, 14 chg sides, 0 chg coeffs, 207 upgd conss, 2344 impls, 0 clqs
0.39/0.47 c presolving (3 rounds):
0.39/0.47 c 249 deleted vars, 379 deleted constraints, 0 tightened bounds, 0 added holes, 14 changed sides, 0 changed coefficients
0.39/0.47 c 2344 implications, 0 cliques
0.39/0.47 c presolved problem has 351 variables (351 bin, 0 int, 0 impl, 0 cont) and 1803 constraints
0.39/0.47 c 25 constraints of type <knapsack>
0.39/0.47 c 1778 constraints of type <logicor>
0.39/0.47 c transformed objective value is always integral (scale: 1)
0.39/0.47 c Presolving Time: 0.12
0.39/0.47 c
0.39/0.49 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.49 c 0.4s| 1 | 0 | 283 | - |4107k| 0 | 0 | 351 |1803 | 351 |1266 | 0 | 0 | 0 | 6.000000e+01 | 6.200000e+01 | 3.33%
0.39/0.49 c 0.4s| 1 | 0 | 283 | - |3865k| 0 | 0 | 351 |1362 | 351 | 695 | 0 | 0 | 0 | 6.000000e+01 | 6.200000e+01 | 3.33%
0.39/0.49 c (run 2, node 1) restarting after 107 global fixings of integer variables
0.39/0.49 c
0.39/0.50 c presolving:
0.50/0.50 c (round 1) 186 del vars, 584 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2930 impls, 0 clqs
0.50/0.52 c (round 2) 186 del vars, 585 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2930 impls, 0 clqs
0.50/0.52 c presolving (3 rounds):
0.50/0.52 c 186 deleted vars, 585 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.50/0.52 c 2930 implications, 0 cliques
0.50/0.52 c presolved problem has 165 variables (165 bin, 0 int, 0 impl, 0 cont) and 777 constraints
0.50/0.52 c 25 constraints of type <knapsack>
0.50/0.52 c 752 constraints of type <logicor>
0.50/0.52 c transformed objective value is always integral (scale: 1)
0.50/0.52 c Presolving Time: 0.15
0.50/0.52 c
0.50/0.53 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.50/0.53 c 0.4s| 1 | 0 | 362 | - |3464k| 0 | 0 | 165 | 777 | 165 | 521 | 0 | 0 | 0 | 6.000000e+01 | 6.200000e+01 | 3.33%
0.50/0.53 c 0.4s| 1 | 0 | 362 | - |3369k| 0 | 0 | 165 | 608 | 165 | 378 | 0 | 0 | 0 | 6.000000e+01 | 6.200000e+01 | 3.33%
0.50/0.53 c (run 3, node 1) restarting after 37 global fixings of integer variables
0.50/0.53 c
0.50/0.54 c presolving:
0.50/0.54 c (round 1) 62 del vars, 136 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 3024 impls, 0 clqs
0.50/0.55 c (round 2) 62 del vars, 138 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 3024 impls, 0 clqs
0.50/0.55 c presolving (3 rounds):
0.50/0.55 c 62 deleted vars, 138 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.50/0.55 c 3024 implications, 0 cliques
0.50/0.55 c presolved problem has 103 variables (103 bin, 0 int, 0 impl, 0 cont) and 470 constraints
0.50/0.55 c 25 constraints of type <knapsack>
0.50/0.55 c 445 constraints of type <logicor>
0.50/0.55 c transformed objective value is always integral (scale: 1)
0.50/0.55 c Presolving Time: 0.16
0.50/0.55 c
0.50/0.55 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.50/0.55 c 0.4s| 1 | 0 | 423 | - |3248k| 0 | 0 | 103 | 470 | 103 | 298 | 0 | 0 | 0 | 6.000000e+01 | 6.200000e+01 | 3.33%
0.50/0.55 c 0.4s| 1 | 0 | 423 | - |3211k| 0 | 0 | 103 | 402 | 103 | 292 | 0 | 0 | 0 | 6.000000e+01 | 6.200000e+01 | 3.33%
0.50/0.55 c (run 4, node 1) restarting after 9 global fixings of integer variables
0.50/0.55 c
0.50/0.56 c presolving:
0.50/0.56 c (round 1) 10 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 3026 impls, 3 clqs
0.50/0.56 c (round 2) 10 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 3026 impls, 3 clqs
0.50/0.56 c presolving (3 rounds):
0.50/0.56 c 10 deleted vars, 7 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.50/0.56 c 3026 implications, 3 cliques
0.50/0.56 c presolved problem has 93 variables (93 bin, 0 int, 0 impl, 0 cont) and 395 constraints
0.50/0.56 c 24 constraints of type <knapsack>
0.50/0.56 c 371 constraints of type <logicor>
0.50/0.56 c transformed objective value is always integral (scale: 1)
0.50/0.56 c Presolving Time: 0.16
0.50/0.56 c
0.50/0.57 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.50/0.57 c 0.5s| 1 | 0 | 492 | - |3201k| 0 | 0 | 93 | 395 | 93 | 289 | 0 | 0 | 0 | 6.000000e+01 | 6.200000e+01 | 3.33%
0.50/0.57 o 60
0.50/0.57 c * 0.5s| 1 | 0 | 492 | - |3208k| 0 | - | 93 | 395 | 93 | 289 | 0 | 0 | 0 | 6.000000e+01 | 6.000000e+01 | 0.00%
0.50/0.57 c
0.50/0.57 c SCIP Status : problem is solved [optimal solution found]
0.50/0.57 c Solving Time (sec) : 0.45
0.50/0.57 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
0.50/0.57 c Primal Bound : +6.00000000000000e+01 (2 solutions)
0.50/0.57 c Dual Bound : +6.00000000000000e+01
0.50/0.57 c Gap : 0.00 %
0.50/0.57 s OPTIMUM FOUND
0.50/0.57 v -x720 -x719 -x718 -x717 -x716 -x715 -x714 -x713 -x712 -x711 -x710 -x709 -x708 -x707 x706 -x705 -x704 -x703 -x702 -x701 -x700 -x699
0.50/0.57 v -x698 -x697 -x696 -x695 -x694 -x693 -x692 -x691 -x690 -x689 -x688 -x687 -x686 -x685 -x684 -x683 -x682 -x681 -x680 -x679 -x678
0.50/0.57 v -x677 -x676 x675 -x674 -x673 -x672 -x671 -x670 -x669 -x668 -x667 -x666 -x665 -x664 -x663 x662 -x661 -x660 -x659 -x658 -x657
0.50/0.57 v -x656 -x655 -x654 -x653 -x652 -x651 -x650 -x649 -x648 -x647 -x646 -x645 x644 -x643 -x642 -x641 x640 -x639 -x638 -x637 -x636
0.50/0.57 v -x635 -x634 -x633 -x632 -x631 -x630 -x629 -x628 -x627 -x626 -x625 -x624 -x623 -x622 -x621 -x620 -x619 -x618 -x617 -x616 -x615
0.50/0.57 v -x614 x613 -x612 -x611 -x610 -x609 -x608 -x607 -x606 -x605 -x604 -x603 -x602 -x601 -x600 -x599 -x598 -x597 -x596 -x595 -x594
0.50/0.57 v -x593 -x592 -x591 -x590 -x589 -x588 -x587 -x586 -x585 -x584 -x583 -x582 -x581 -x580 -x579 x578 -x577 -x576 -x575 -x574 -x573
0.50/0.57 v -x572 -x571 -x570 -x569 -x568 x567 -x566 -x565 -x564 -x563 -x562 -x561 -x560 -x559 -x558 -x557 -x556 -x555 -x554 -x553 -x552
0.50/0.57 v -x551 -x550 -x549 -x548 x547 -x546 -x545 x544 -x543 -x542 -x541 -x540 -x539 -x538 -x537 -x536 -x535 x534 -x533 -x532 -x531
0.50/0.57 v -x530 -x529 -x528 x527 -x526 -x525 -x524 x523 -x522 -x521 -x520 -x519 -x518 -x517 -x516 -x515 -x514 -x513 -x512 -x511 -x510
0.50/0.57 v -x509 -x508 -x507 -x506 -x505 -x504 x503 -x502 -x501 -x500 -x499 -x498 -x497 -x496 -x495 -x494 -x493 -x492 x491 -x490 -x489
0.50/0.57 v -x488 -x487 -x486 -x485 -x484 -x483 -x482 -x481 -x480 -x479 -x478 -x477 -x476 -x475 -x474 -x473 -x472 -x471 -x470 -x469 -x468
0.50/0.57 v -x467 -x466 -x465 x464 x463 -x462 -x461 -x460 -x459 -x458 -x457 -x456 -x455 -x454 -x453 -x452 -x451 -x450 -x449 -x448 -x447
0.50/0.57 v -x446 -x445 -x444 x443 -x442 -x441 -x440 -x439 -x438 -x437 -x436 -x435 -x434 -x433 -x432 -x431 x430 -x429 -x428 -x427 -x426 -x425
0.50/0.57 v -x424 -x423 -x422 -x421 -x420 -x419 -x418 -x417 x416 -x415 -x414 -x413 -x412 -x411 -x410 -x409 x408 -x407 -x406 -x405 -x404
0.50/0.57 v -x403 -x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383
0.50/0.57 v -x382 -x381 x380 -x379 -x378 -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 x366 -x365 -x364 -x363 -x362
0.50/0.57 v -x361 -x360 x359 -x358 -x357 -x356 x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 x341
0.50/0.57 v x340 -x339 -x338 -x337 -x336 -x335 x334 -x333 -x332 -x331 x330 -x329 -x328 -x327 x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319
0.50/0.57 v -x318 -x317 -x316 -x315 -x314 -x313 x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 x300 -x299 -x298
0.50/0.57 v -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 x282 -x281 -x280 -x279 -x278 -x277
0.50/0.57 v -x276 -x275 -x274 -x273 -x272 x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256
0.50/0.57 v -x255 x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 x245 -x244 -x243 -x242 x241 -x240 -x239 x238 -x237 -x236 -x235
0.50/0.57 v -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214
0.50/0.57 v -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193
0.50/0.57 v -x192 -x191 -x190 -x189 -x188 -x187 x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 x172
0.50/0.57 v -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151
0.50/0.57 v x150 x149 x148 -x147 -x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129
0.50/0.57 v x128 x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108
0.50/0.57 v x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84
0.50/0.57 v -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 x74 x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 x63 -x62 -x61 -x60 -x59
0.50/0.57 v -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 -x33
0.50/0.57 v -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
0.50/0.57 v -x6 -x5 -x4 -x3 -x2 -x1
0.50/0.57 c SCIP Status : problem is solved [optimal solution found]
0.50/0.57 c Solving Time : 0.45
0.50/0.57 c Original Problem :
0.50/0.57 c Problem name : HOME/instance-2667474-1276405516.opb
0.50/0.57 c Variables : 720 (720 binary, 0 integer, 0 implicit integer, 0 continuous)
0.50/0.57 c Constraints : 2168 initial, 2168 maximal
0.50/0.57 c Presolved Problem :
0.50/0.57 c Problem name : t_HOME/instance-2667474-1276405516.opb
0.50/0.57 c Variables : 93 (93 binary, 0 integer, 0 implicit integer, 0 continuous)
0.50/0.57 c Constraints : 395 initial, 395 maximal
0.50/0.57 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.50/0.57 c trivial : 0.00 236 0 0 0 0 0 0 0
0.50/0.57 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.50/0.57 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.50/0.57 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.50/0.57 c implics : 0.01 0 391 0 0 0 0 0 0
0.50/0.57 c probing : 0.01 0 0 0 0 0 0 0 0
0.50/0.57 c knapsack : 0.01 0 0 0 0 0 1 0 1
0.50/0.57 c linear : 0.05 0 0 0 0 0 287 14 0
0.50/0.57 c logicor : 0.08 0 0 0 0 0 1061 0 0
0.50/0.57 c root node : - 236 - - 236 - - - -
0.50/0.57 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.50/0.57 c integral : 0 0 0 5 0 0 0 0 0 0
0.50/0.57 c knapsack : 24 6 210 5 0 0 0 0 0 0
0.50/0.57 c logicor : 371 6 199 5 0 0 16 0 0 0
0.50/0.57 c countsols : 0 0 0 5 0 0 0 0 0 0
0.50/0.57 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.50/0.57 c integral : 0.00 0.00 0.00 0.00 0.00
0.50/0.57 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.50/0.57 c logicor : 0.00 0.00 0.00 0.00 0.00
0.50/0.57 c countsols : 0.00 0.00 0.00 0.00 0.00
0.50/0.57 c Propagators : Time Calls Cutoffs DomReds
0.50/0.57 c vbounds : 0.00 6 0 0
0.50/0.57 c rootredcost : 0.00 0 0 0
0.50/0.57 c pseudoobj : 0.01 15 0 0
0.50/0.57 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.50/0.57 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.50/0.57 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.50/0.57 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.50/0.57 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.50/0.57 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.50/0.57 c applied globally : - - - 0 0.0 - - -
0.50/0.57 c applied locally : - - - 0 0.0 - - -
0.50/0.57 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.50/0.57 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.50/0.57 c redcost : 0.00 6 0 220 0 0
0.50/0.57 c impliedbounds : 0.00 1 0 0 0 0
0.50/0.57 c intobj : 0.00 0 0 0 0 0
0.50/0.57 c cgmip : 0.00 0 0 0 0 0
0.50/0.57 c gomory : 0.00 1 0 0 28 0
0.50/0.57 c strongcg : 0.01 1 0 0 28 0
0.50/0.57 c cmir : 0.00 1 0 0 0 0
0.50/0.57 c flowcover : 0.02 1 0 0 0 0
0.50/0.57 c clique : 0.00 1 0 0 0 0
0.50/0.57 c zerohalf : 0.00 0 0 0 0 0
0.50/0.57 c mcf : 0.01 1 0 0 0 0
0.50/0.57 c rapidlearning : 0.16 1 0 0 0 252
0.50/0.57 c Pricers : Time Calls Vars
0.50/0.57 c problem variables: 0.00 0 0
0.50/0.57 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.50/0.57 c pscost : 0.00 0 0 0 0 0 0
0.50/0.57 c inference : 0.00 0 0 0 0 0 0
0.50/0.57 c mostinf : 0.00 0 0 0 0 0 0
0.50/0.57 c leastinf : 0.00 0 0 0 0 0 0
0.50/0.57 c fullstrong : 0.00 0 0 0 0 0 0
0.50/0.57 c allfullstrong : 0.00 0 0 0 0 0 0
0.50/0.57 c random : 0.00 0 0 0 0 0 0
0.50/0.57 c relpscost : 0.00 0 0 0 0 0 0
0.50/0.57 c Primal Heuristics : Time Calls Found
0.50/0.57 c LP solutions : 0.00 - 1
0.50/0.57 c pseudo solutions : 0.00 - 0
0.50/0.57 c oneopt : 0.00 1 0
0.50/0.57 c trivial : 0.00 2 0
0.50/0.57 c simplerounding : 0.00 0 0
0.50/0.57 c zirounding : 0.00 0 0
0.50/0.57 c rounding : 0.00 1 0
0.50/0.57 c shifting : 0.00 1 1
0.50/0.57 c intshifting : 0.00 0 0
0.50/0.57 c twoopt : 0.00 0 0
0.50/0.57 c fixandinfer : 0.00 0 0
0.50/0.57 c feaspump : 0.00 0 0
0.50/0.57 c coefdiving : 0.00 0 0
0.50/0.57 c pscostdiving : 0.00 0 0
0.50/0.57 c fracdiving : 0.00 0 0
0.50/0.57 c veclendiving : 0.00 0 0
0.50/0.57 c intdiving : 0.00 0 0
0.50/0.57 c actconsdiving : 0.00 0 0
0.50/0.57 c objpscostdiving : 0.00 0 0
0.50/0.57 c rootsoldiving : 0.00 0 0
0.50/0.57 c linesearchdiving : 0.00 0 0
0.50/0.57 c guideddiving : 0.00 0 0
0.50/0.57 c octane : 0.00 0 0
0.50/0.57 c rens : 0.00 0 0
0.50/0.57 c rins : 0.00 0 0
0.50/0.57 c localbranching : 0.00 0 0
0.50/0.57 c mutation : 0.00 0 0
0.50/0.57 c crossover : 0.00 0 0
0.50/0.57 c dins : 0.00 0 0
0.50/0.57 c undercover : 0.00 0 0
0.50/0.57 c nlp : 0.00 0 0
0.50/0.57 c trysol : 0.00 0 0
0.50/0.57 c LP : Time Calls Iterations Iter/call Iter/sec
0.50/0.57 c primal LP : 0.00 0 0 0.00 -
0.50/0.57 c dual LP : 0.04 6 492 82.00 12300.00
0.50/0.57 c lex dual LP : 0.00 0 0 0.00 -
0.50/0.57 c barrier LP : 0.00 0 0 0.00 -
0.50/0.57 c diving/probing LP: 0.00 0 0 0.00 -
0.50/0.57 c strong branching : 0.00 0 0 0.00 -
0.50/0.57 c (at root node) : - 0 0 0.00 -
0.50/0.57 c conflict analysis: 0.00 0 0 0.00 -
0.50/0.57 c B&B Tree :
0.50/0.57 c number of runs : 5
0.50/0.57 c nodes : 1
0.50/0.57 c nodes (total) : 5
0.50/0.57 c nodes left : 0
0.50/0.57 c max depth : 0
0.50/0.57 c max depth (total): 0
0.50/0.57 c backtracks : 0 (0.0%)
0.50/0.57 c delayed cutoffs : 0
0.50/0.57 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.50/0.57 c avg switch length: 2.00
0.50/0.57 c switching time : 0.00
0.50/0.57 c Solution :
0.50/0.57 c Solutions found : 2 (2 improvements)
0.50/0.57 c First Solution : +6.20000000000000e+01 (in run 1, after 1 nodes, 0.11 seconds, depth 0, found by <shifting>)
0.50/0.57 c Primal Bound : +6.00000000000000e+01 (in run 5, after 1 nodes, 0.45 seconds, depth 0, found by <relaxation>)
0.50/0.57 c Dual Bound : +6.00000000000000e+01
0.50/0.57 c Gap : 0.00 %
0.50/0.57 c Root Dual Bound : +6.00000000000000e+01
0.50/0.57 c Root Iterations : 492
0.50/0.58 c Time complete: 0.58.