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-2667476-1276406240.opb>
0.00/0.05 c original problem has 672 variables (672 bin, 0 int, 0 impl, 0 cont) and 2028 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.11 c (round 1) 112 del vars, 112 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1804 upgd conss, 892 impls, 0 clqs
0.09/0.13 c (round 2) 112 del vars, 224 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1804 upgd conss, 892 impls, 0 clqs
0.09/0.15 c (0.1s) probing: 101/560 (18.0%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.09/0.15 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.15 c presolving (3 rounds):
0.09/0.15 c 112 deleted vars, 224 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.15 c 892 implications, 0 cliques
0.09/0.15 c presolved problem has 560 variables (560 bin, 0 int, 0 impl, 0 cont) and 1804 constraints
0.09/0.15 c 24 constraints of type <knapsack>
0.09/0.15 c 1780 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.08
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.96
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 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 | 187 | - |4009k| 0 | 26 | 560 |1804 | 560 |1804 | 0 | 0 | 0 | 6.200000e+01 | -- | Inf
0.29/0.30 o 64
0.29/0.30 c F 0.2s| 1 | 0 | 777 | - |4052k| 0 | 0 | 560 |1804 | 560 |1804 | 0 | 0 | 0 | 6.200000e+01 | 6.400000e+01 | 3.23%
0.59/0.64 c 0.5s| 1 | 0 | 829 | - |4543k| 0 | 0 | 560 |2180 | 560 |1537 | 8 | 0 | 0 | 6.200000e+01 | 6.400000e+01 | 3.23%
0.59/0.64 c (run 1, node 1) restarting after 69 global fixings of integer variables
0.59/0.64 c
0.59/0.64 c (restart) converted 7 cuts from the global cut pool into linear constraints
0.59/0.64 c
0.59/0.64 c presolving:
0.59/0.66 c (round 1) 207 del vars, 346 del conss, 0 chg bounds, 17 chg sides, 0 chg coeffs, 0 upgd conss, 1850 impls, 0 clqs
0.59/0.68 c (round 2) 207 del vars, 346 del conss, 0 chg bounds, 17 chg sides, 0 chg coeffs, 313 upgd conss, 1850 impls, 0 clqs
0.59/0.69 c presolving (3 rounds):
0.59/0.69 c 207 deleted vars, 346 deleted constraints, 0 tightened bounds, 0 added holes, 17 changed sides, 0 changed coefficients
0.59/0.69 c 1850 implications, 0 cliques
0.59/0.69 c presolved problem has 353 variables (353 bin, 0 int, 0 impl, 0 cont) and 1841 constraints
0.59/0.69 c 28 constraints of type <knapsack>
0.59/0.69 c 1813 constraints of type <logicor>
0.59/0.69 c transformed objective value is always integral (scale: 1)
0.59/0.69 c Presolving Time: 0.12
0.59/0.69 c
0.69/0.71 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.71 c 0.6s| 1 | 0 | 997 | - |4019k| 0 | 16 | 353 |1841 | 353 |1259 | 0 | 0 | 0 | 6.200000e+01 | 6.400000e+01 | 3.23%
0.69/0.75 c 0.6s| 1 | 0 | 1020 | - |3863k| 0 | 18 | 353 |1529 | 353 | 846 | 5 | 0 | 0 | 6.200000e+01 | 6.400000e+01 | 3.23%
0.79/0.84 c 0.7s| 1 | 2 | 1020 | - |3863k| 0 | 18 | 353 |1529 | 353 | 846 | 5 | 0 | 17 | 6.200000e+01 | 6.400000e+01 | 3.23%
0.79/0.84 c (run 2, node 1) restarting after 74 global fixings of integer variables
0.79/0.84 c
0.79/0.84 c (restart) converted 3 cuts from the global cut pool into linear constraints
0.79/0.84 c
0.79/0.84 c presolving:
0.79/0.85 c (round 1) 149 del vars, 460 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3 upgd conss, 2428 impls, 0 clqs
0.79/0.89 c (round 2) 149 del vars, 505 del conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 3 upgd conss, 2428 impls, 0 clqs
0.79/0.89 c presolving (3 rounds):
0.79/0.89 c 149 deleted vars, 505 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 1 changed coefficients
0.79/0.89 c 2428 implications, 0 cliques
0.79/0.89 c presolved problem has 204 variables (204 bin, 0 int, 0 impl, 0 cont) and 1027 constraints
0.79/0.89 c 31 constraints of type <knapsack>
0.79/0.89 c 996 constraints of type <logicor>
0.79/0.89 c transformed objective value is always integral (scale: 1)
0.79/0.89 c Presolving Time: 0.17
0.79/0.89 c
0.89/0.91 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.91 c 0.8s| 1 | 0 | 1180 | - |3530k| 0 | 0 | 204 |1027 | 204 | 665 | 0 | 0 | 17 | 6.200000e+01 | 6.400000e+01 | 3.23%
0.89/0.91 c 0.8s| 1 | 0 | 1180 | - |3388k| 0 | 0 | 204 | 756 | 204 | 475 | 0 | 0 | 17 | 6.200000e+01 | 6.400000e+01 | 3.23%
0.89/0.91 c (run 3, node 1) restarting after 53 global fixings of integer variables
0.89/0.91 c
0.89/0.91 c presolving:
0.89/0.92 c (round 1) 82 del vars, 227 del conss, 0 chg bounds, 1 chg sides, 3 chg coeffs, 0 upgd conss, 2582 impls, 2 clqs
0.89/0.93 c (round 2) 82 del vars, 229 del conss, 0 chg bounds, 3 chg sides, 11 chg coeffs, 0 upgd conss, 2582 impls, 4 clqs
0.89/0.93 c presolving (3 rounds):
0.89/0.93 c 82 deleted vars, 229 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 11 changed coefficients
0.89/0.93 c 2582 implications, 4 cliques
0.89/0.93 c presolved problem has 122 variables (122 bin, 0 int, 0 impl, 0 cont) and 529 constraints
0.89/0.93 c 28 constraints of type <knapsack>
0.89/0.93 c 2 constraints of type <setppc>
0.89/0.93 c 499 constraints of type <logicor>
0.89/0.93 c transformed objective value is always integral (scale: 1)
0.89/0.93 c Presolving Time: 0.18
0.89/0.93 c
0.89/0.94 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.94 c 0.8s| 1 | 0 | 1273 | - |3222k| 0 | 0 | 122 | 529 | 122 | 401 | 0 | 0 | 17 | 6.200000e+01 | 6.400000e+01 | 3.23%
0.89/0.94 c 0.8s| 1 | 0 | 1273 | - |3198k| 0 | 0 | 122 | 489 | 122 | 363 | 0 | 0 | 17 | 6.200000e+01 | 6.400000e+01 | 3.23%
0.89/0.94 c (run 4, node 1) restarting after 9 global fixings of integer variables
0.89/0.94 c
0.89/0.94 c presolving:
0.89/0.94 c (round 1) 17 del vars, 40 del conss, 0 chg bounds, 1 chg sides, 3 chg coeffs, 0 upgd conss, 2614 impls, 3 clqs
0.89/0.95 c presolving (2 rounds):
0.89/0.95 c 17 deleted vars, 40 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 3 changed coefficients
0.89/0.95 c 2614 implications, 3 cliques
0.89/0.95 c presolved problem has 105 variables (105 bin, 0 int, 0 impl, 0 cont) and 450 constraints
0.89/0.95 c 27 constraints of type <knapsack>
0.89/0.95 c 2 constraints of type <setppc>
0.89/0.95 c 421 constraints of type <logicor>
0.89/0.95 c transformed objective value is always integral (scale: 1)
0.89/0.95 c Presolving Time: 0.19
0.89/0.95 c
0.89/0.96 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.96 c 0.8s| 1 | 0 | 1362 | - |3162k| 0 | 0 | 105 | 450 | 105 | 344 | 0 | 0 | 17 | 6.200000e+01 | 6.400000e+01 | 3.23%
0.89/0.96 c 0.8s| 1 | 0 | 1362 | - |3159k| 0 | 0 | 105 | 446 | 105 | 338 | 0 | 0 | 17 | 6.200000e+01 | 6.400000e+01 | 3.23%
0.89/0.96 o 62
0.89/0.96 c * 0.8s| 1 | 0 | 1362 | - |3165k| 0 | - | 105 | 446 | 105 | 338 | 0 | 0 | 17 | 6.200000e+01 | 6.200000e+01 | 0.00%
0.89/0.96 c
0.89/0.96 c SCIP Status : problem is solved [optimal solution found]
0.89/0.96 c Solving Time (sec) : 0.82
0.89/0.96 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
0.89/0.96 c Primal Bound : +6.20000000000000e+01 (2 solutions)
0.89/0.96 c Dual Bound : +6.20000000000000e+01
0.89/0.96 c Gap : 0.00 %
0.89/0.96 s OPTIMUM FOUND
0.89/0.96 v -x672 -x671 -x670 -x669 -x668 -x667 -x666 -x665 -x664 -x663 -x662 -x661 -x660 -x659 -x658 -x657 -x656 -x655 -x654 -x653 -x652 x651
0.89/0.96 v -x650 -x649 -x648 -x647 -x646 -x645 -x644 -x643 -x642 -x641 -x640 -x639 -x638 -x637 -x636 -x635 -x634 -x633 -x632 -x631 -x630
0.89/0.96 v -x629 -x628 x627 -x626 -x625 -x624 -x623 -x622 -x621 -x620 -x619 -x618 -x617 x616 -x615 -x614 -x613 -x612 -x611 -x610 -x609
0.89/0.96 v -x608 -x607 -x606 -x605 -x604 -x603 -x602 -x601 -x600 -x599 -x598 -x597 -x596 -x595 -x594 -x593 -x592 -x591 -x590 -x589 -x588
0.89/0.96 v -x587 -x586 -x585 -x584 -x583 -x582 -x581 -x580 -x579 -x578 x577 -x576 -x575 -x574 -x573 -x572 -x571 -x570 -x569 -x568 -x567
0.89/0.96 v -x566 -x565 x564 -x563 -x562 -x561 -x560 -x559 -x558 -x557 -x556 -x555 -x554 -x553 -x552 -x551 -x550 -x549 -x548 -x547 -x546
0.89/0.96 v -x545 -x544 -x543 -x542 x541 -x540 -x539 -x538 -x537 -x536 -x535 -x534 -x533 -x532 -x531 -x530 x529 -x528 -x527 -x526 -x525
0.89/0.96 v -x524 -x523 -x522 -x521 -x520 -x519 -x518 -x517 -x516 -x515 -x514 x513 -x512 -x511 -x510 -x509 -x508 -x507 -x506 -x505 -x504
0.89/0.96 v -x503 -x502 -x501 -x500 -x499 -x498 -x497 -x496 -x495 -x494 -x493 -x492 -x491 -x490 x489 -x488 -x487 -x486 -x485 -x484 -x483
0.89/0.96 v -x482 -x481 -x480 -x479 -x478 -x477 -x476 -x475 -x474 -x473 -x472 -x471 -x470 -x469 x468 -x467 -x466 -x465 -x464 -x463 -x462
0.89/0.96 v -x461 -x460 -x459 -x458 -x457 -x456 -x455 -x454 -x453 x452 -x451 -x450 -x449 -x448 -x447 -x446 -x445 -x444 -x443 -x442 -x441
0.89/0.96 v -x440 -x439 -x438 -x437 -x436 -x435 -x434 -x433 -x432 x431 -x430 -x429 -x428 x427 -x426 -x425 -x424 -x423 -x422 -x421 x420
0.89/0.96 v -x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 -x406 x405 -x404 -x403 -x402 x401 -x400 -x399
0.89/0.96 v -x398 x397 -x396 -x395 x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x382 -x381 -x380 -x379 -x378
0.89/0.96 v -x377 x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 x366 x365 x364 -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356
0.89/0.96 v -x355 -x354 -x353 -x352 -x351 -x350 x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335
0.89/0.96 v -x334 -x333 -x332 -x331 x330 -x329 -x328 -x327 x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314
0.89/0.96 v x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293
0.89/0.96 v -x292 -x291 x290 -x289 -x288 -x287 x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 x274 -x273 x272 -x271
0.89/0.96 v -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250
0.89/0.96 v -x249 -x248 -x247 x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 x234 -x233 -x232 -x231 -x230 -x229
0.89/0.96 v -x228 -x227 -x226 -x225 -x224 -x223 x222 x221 -x220 -x219 -x218 -x217 x216 -x215 -x214 -x213 x212 -x211 -x210 -x209 x208
0.89/0.96 v -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 x195 -x194 -x193 -x192 x191 -x190 -x189 -x188 -x187 -x186
0.89/0.96 v -x185 -x184 -x183 -x182 -x181 -x180 x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165
0.89/0.96 v -x164 -x163 x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 x148 -x147 -x146 -x145 -x144
0.89/0.96 v -x143 x142 -x141 -x140 x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 x128 -x127 -x126 -x125 -x124 -x123
0.89/0.96 v -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x112 x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102
0.89/0.96 v x101 x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 x81 x80 x79 -x78 -x77 -x76
0.89/0.96 v -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 x55 -x54 -x53 -x52 -x51
0.89/0.96 v -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 -x25
0.89/0.96 v -x24 -x23 x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 -x2 -x1
0.89/0.96 c SCIP Status : problem is solved [optimal solution found]
0.89/0.96 c Solving Time : 0.82
0.89/0.96 c Original Problem :
0.89/0.96 c Problem name : HOME/instance-2667476-1276406240.opb
0.89/0.96 c Variables : 672 (672 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.96 c Constraints : 2028 initial, 2028 maximal
0.89/0.96 c Presolved Problem :
0.89/0.96 c Problem name : t_HOME/instance-2667476-1276406240.opb
0.89/0.96 c Variables : 105 (105 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.96 c Constraints : 450 initial, 450 maximal
0.89/0.96 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.96 c trivial : 0.00 205 0 0 0 0 0 0 0
0.89/0.96 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c implics : 0.00 0 362 0 0 0 0 0 0
0.89/0.96 c probing : 0.01 0 0 0 0 0 0 0 0
0.89/0.96 c knapsack : 0.01 0 0 0 0 0 4 5 15
0.89/0.96 c setppc : 0.00 0 0 0 0 0 1 0 0
0.89/0.96 c linear : 0.05 0 0 0 0 0 294 17 0
0.89/0.96 c logicor : 0.11 0 0 0 0 0 1045 0 0
0.89/0.96 c root node : - 206 - - 206 - - - -
0.89/0.96 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.96 c integral : 0 0 0 5 0 0 0 0 0 2
0.89/0.96 c knapsack : 27 6 211 4 0 0 0 0 0 0
0.89/0.96 c setppc : 2 2 4 2 0 0 0 0 0 0
0.89/0.96 c logicor : 421 6 199 4 0 0 9 1 0 0
0.89/0.96 c countsols : 0 0 0 4 0 0 0 0 0 0
0.89/0.96 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.96 c integral : 0.09 0.00 0.00 0.09 0.00
0.89/0.96 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.89/0.96 c setppc : 0.00 0.00 0.00 0.00 0.00
0.89/0.96 c logicor : 0.02 0.00 0.02 0.00 0.00
0.89/0.96 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.96 c Propagators : Time Calls Cutoffs DomReds
0.89/0.96 c vbounds : 0.00 6 0 0
0.89/0.96 c rootredcost : 0.00 0 0 0
0.89/0.96 c pseudoobj : 0.00 16 0 0
0.89/0.96 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.96 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.96 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.96 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.96 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.96 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.96 c applied globally : - - - 0 0.0 - - -
0.89/0.96 c applied locally : - - - 0 0.0 - - -
0.89/0.96 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.96 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.89/0.96 c redcost : 0.00 6 0 197 0 0
0.89/0.96 c impliedbounds : 0.00 2 0 0 0 0
0.89/0.96 c intobj : 0.00 0 0 0 0 0
0.89/0.96 c cgmip : 0.00 0 0 0 0 0
0.89/0.96 c gomory : 0.00 2 0 0 106 0
0.89/0.96 c strongcg : 0.02 2 0 0 106 0
0.89/0.96 c cmir : 0.01 2 0 0 0 0
0.89/0.96 c flowcover : 0.03 2 0 0 0 0
0.89/0.96 c clique : 0.00 2 0 0 0 0
0.89/0.96 c zerohalf : 0.00 0 0 0 0 0
0.89/0.96 c mcf : 0.00 2 0 0 0 0
0.89/0.96 c rapidlearning : 0.23 1 0 0 0 376
0.89/0.96 c Pricers : Time Calls Vars
0.89/0.96 c problem variables: 0.00 0 0
0.89/0.96 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.96 c relpscost : 0.09 1 0 0 0 0 2
0.89/0.96 c pscost : 0.00 0 0 0 0 0 0
0.89/0.96 c inference : 0.00 0 0 0 0 0 0
0.89/0.96 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.96 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.96 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.96 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.96 c random : 0.00 0 0 0 0 0 0
0.89/0.96 c Primal Heuristics : Time Calls Found
0.89/0.96 c LP solutions : 0.00 - 1
0.89/0.96 c pseudo solutions : 0.00 - 0
0.89/0.96 c oneopt : 0.00 1 0
0.89/0.96 c trivial : 0.00 2 0
0.89/0.96 c simplerounding : 0.00 0 0
0.89/0.96 c zirounding : 0.00 0 0
0.89/0.96 c rounding : 0.00 3 0
0.89/0.96 c shifting : 0.01 3 0
0.89/0.96 c intshifting : 0.00 0 0
0.89/0.96 c twoopt : 0.00 0 0
0.89/0.96 c fixandinfer : 0.00 0 0
0.89/0.96 c feaspump : 0.11 1 1
0.89/0.96 c coefdiving : 0.00 0 0
0.89/0.96 c pscostdiving : 0.00 0 0
0.89/0.96 c fracdiving : 0.00 0 0
0.89/0.96 c veclendiving : 0.00 0 0
0.89/0.96 c intdiving : 0.00 0 0
0.89/0.96 c actconsdiving : 0.00 0 0
0.89/0.96 c objpscostdiving : 0.00 0 0
0.89/0.96 c rootsoldiving : 0.00 0 0
0.89/0.96 c linesearchdiving : 0.00 0 0
0.89/0.96 c guideddiving : 0.00 0 0
0.89/0.96 c octane : 0.00 0 0
0.89/0.96 c rens : 0.00 0 0
0.89/0.96 c rins : 0.00 0 0
0.89/0.96 c localbranching : 0.00 0 0
0.89/0.96 c mutation : 0.00 0 0
0.89/0.96 c crossover : 0.00 0 0
0.89/0.96 c dins : 0.00 0 0
0.89/0.96 c undercover : 0.00 0 0
0.89/0.96 c nlp : 0.00 0 0
0.89/0.96 c trysol : 0.00 0 0
0.89/0.96 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.96 c primal LP : 0.00 0 0 0.00 -
0.89/0.96 c dual LP : 0.07 7 772 110.29 11028.57
0.89/0.96 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.96 c barrier LP : 0.00 0 0 0.00 -
0.89/0.96 c diving/probing LP: 0.10 11 590 53.64 5900.00
0.89/0.96 c strong branching : 0.09 17 362 21.29 4022.22
0.89/0.96 c (at root node) : - 17 362 21.29 -
0.89/0.96 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.96 c B&B Tree :
0.89/0.96 c number of runs : 5
0.89/0.96 c nodes : 1
0.89/0.96 c nodes (total) : 5
0.89/0.96 c nodes left : 0
0.89/0.96 c max depth : 0
0.89/0.96 c max depth (total): 0
0.89/0.96 c backtracks : 0 (0.0%)
0.89/0.96 c delayed cutoffs : 0
0.89/0.96 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.89/0.96 c avg switch length: 2.00
0.89/0.96 c switching time : 0.00
0.89/0.96 c Solution :
0.89/0.96 c Solutions found : 2 (2 improvements)
0.89/0.96 c First Solution : +6.40000000000000e+01 (in run 1, after 1 nodes, 0.22 seconds, depth 0, found by <feaspump>)
0.89/0.96 c Primal Bound : +6.20000000000000e+01 (in run 5, after 1 nodes, 0.82 seconds, depth 0, found by <relaxation>)
0.89/0.96 c Dual Bound : +6.20000000000000e+01
0.89/0.96 c Gap : 0.00 %
0.89/0.96 c Root Dual Bound : +6.20000000000000e+01
0.89/0.96 c Root Iterations : 1362
0.89/0.97 c Time complete: 0.97.