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-2666210-1276593478.opb>
0.00/0.03 c original problem has 652 variables (652 bin, 0 int, 0 impl, 0 cont) and 759 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.00/0.04 o 652
0.00/0.04 c feasible solution found by trivial heuristic, objective value 6.520000e+02
0.00/0.04 c presolving:
0.00/0.06 c (round 1) 0 del vars, 368 del conss, 0 chg bounds, 351 chg sides, 0 chg coeffs, 0 upgd conss, 28 impls, 0 clqs
0.00/0.07 c (round 2) 37 del vars, 374 del conss, 0 chg bounds, 351 chg sides, 0 chg coeffs, 0 upgd conss, 28 impls, 0 clqs
0.00/0.07 c (round 3) 44 del vars, 384 del conss, 0 chg bounds, 351 chg sides, 0 chg coeffs, 0 upgd conss, 28 impls, 0 clqs
0.00/0.07 c (round 4) 45 del vars, 386 del conss, 0 chg bounds, 351 chg sides, 0 chg coeffs, 0 upgd conss, 28 impls, 0 clqs
0.07/0.08 c (round 5) 46 del vars, 386 del conss, 0 chg bounds, 351 chg sides, 0 chg coeffs, 373 upgd conss, 28 impls, 0 clqs
0.07/0.09 c (0.0s) probing: 101/606 (16.7%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.07/0.09 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.07/0.09 c presolving (6 rounds):
0.07/0.09 c 46 deleted vars, 386 deleted constraints, 0 tightened bounds, 0 added holes, 351 changed sides, 0 changed coefficients
0.07/0.09 c 28 implications, 0 cliques
0.07/0.09 c presolved problem has 606 variables (606 bin, 0 int, 0 impl, 0 cont) and 373 constraints
0.07/0.09 c 373 constraints of type <logicor>
0.07/0.09 c transformed objective value is always integral (scale: 1)
0.07/0.09 c Presolving Time: 0.03
0.07/0.09 c - non default parameters ----------------------------------------------------------------------
0.07/0.09 c # SCIP version 1.2.1.2
0.07/0.09 c
0.07/0.09 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.07/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.07/0.09 c conflict/interconss = 0
0.07/0.09 c
0.07/0.09 c # should binary conflicts be preferred?
0.07/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.09 c conflict/preferbinary = TRUE
0.07/0.09 c
0.07/0.09 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.07/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.07/0.09 c constraints/agelimit = 1
0.07/0.09 c
0.07/0.09 c # should enforcement of pseudo solution be disabled?
0.07/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.09 c constraints/disableenfops = TRUE
0.07/0.09 c
0.07/0.09 c # frequency for displaying node information lines
0.07/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.07/0.09 c display/freq = 10000
0.07/0.09 c
0.07/0.09 c # maximal time in seconds to run
0.07/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.07/0.09 c limits/time = 1799.98
0.07/0.09 c
0.07/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.07/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.07/0.09 c limits/memory = 1620
0.07/0.09 c
0.07/0.09 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.07/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.07/0.09 c lp/solvefreq = 0
0.07/0.09 c
0.07/0.09 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.07/0.09 c # [type: char, range: {lafpsqd}, default: l]
0.07/0.09 c lp/pricing = a
0.07/0.09 c
0.07/0.09 c # should presolving try to simplify inequalities
0.07/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.09 c constraints/linear/simplifyinequalities = TRUE
0.07/0.09 c
0.07/0.09 c # should presolving try to simplify knapsacks
0.07/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.07/0.09 c
0.07/0.09 c # priority of node selection rule <dfs> in standard mode
0.07/0.09 c # [type: int, range: [-536870912,536870911], default: 0]
0.07/0.09 c nodeselection/dfs/stdpriority = 1000000
0.07/0.09 c
0.07/0.09 c -----------------------------------------------------------------------------------------------
0.07/0.09 c start solving
0.07/0.09 c
0.07/0.09 o 613
0.07/0.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.07/0.09 c t 0.0s| 1 | 0 | 0 | - |1882k| 0 | - | 606 | 373 | 0 | 0 | 0 | 0 | 0 | -- | 6.130000e+02 | Inf
0.07/0.09 o 128
0.07/0.09 c b 0.0s| 1 | 0 | 0 | - |2281k| 0 | - | 606 | 373 | 606 | 373 | 0 | 0 | 0 | -- | 1.280000e+02 | Inf
0.09/0.11 c 0.1s| 1 | 0 | 362 | - |2273k| 0 | 88 | 606 | 373 | 606 | 373 | 0 | 0 | 0 | 8.900000e+01 | 1.280000e+02 | 43.82%
0.09/0.19 c 0.1s| 1 | 0 | 471 | - |2542k| 0 | 85 | 606 | 373 | 606 | 377 | 4 | 0 | 0 | 8.900000e+01 | 1.280000e+02 | 43.82%
0.09/0.19 o 128
0.09/0.19 c s 0.1s| 1 | 0 | 471 | - |2558k| 0 | 85 | 606 | 373 | 606 | 377 | 4 | 0 | 0 | 8.900000e+01 | 1.280000e+02 | 43.82%
0.09/0.19 o 92
0.09/0.19 c b 0.1s| 1 | 0 | 471 | - |2574k| 0 | 85 | 606 | 373 | 606 | 377 | 4 | 0 | 0 | 8.900000e+01 | 9.200000e+01 | 3.37%
0.19/0.27 c 0.2s| 1 | 0 | 528 | - |2890k| 0 | 95 | 606 | 373 | 606 | 381 | 8 | 0 | 0 | 8.903333e+01 | 9.200000e+01 | 3.33%
0.29/0.37 c 0.3s| 1 | 0 | 556 | - |3476k| 0 | 88 | 606 | 373 | 606 | 383 | 10 | 0 | 0 | 8.919048e+01 | 9.200000e+01 | 3.15%
0.39/0.47 c 0.4s| 1 | 0 | 612 | - |3940k| 0 | 79 | 606 | 373 | 606 | 385 | 12 | 0 | 0 | 8.933333e+01 | 9.200000e+01 | 2.99%
0.49/0.57 c 0.5s| 1 | 0 | 664 | - |4117k| 0 | 93 | 606 | 373 | 606 | 387 | 14 | 0 | 0 | 8.936134e+01 | 9.200000e+01 | 2.95%
0.59/0.69 c 0.6s| 1 | 0 | 665 | - |4582k| 0 | 0 | 606 | 373 | 606 | 388 | 15 | 0 | 0 | 9.000000e+01 | 9.200000e+01 | 2.22%
0.59/0.69 o 90
0.59/0.69 c * 0.6s| 1 | 0 | 665 | - |4590k| 0 | - | 606 | 373 | 606 | 388 | 15 | 0 | 0 | 9.000000e+01 | 9.000000e+01 | 0.00%
0.59/0.69 c
0.59/0.69 c SCIP Status : problem is solved [optimal solution found]
0.59/0.69 c Solving Time (sec) : 0.63
0.59/0.69 c Solving Nodes : 1
0.59/0.69 c Primal Bound : +9.00000000000000e+01 (13 solutions)
0.59/0.69 c Dual Bound : +9.00000000000000e+01
0.59/0.69 c Gap : 0.00 %
0.69/0.70 s OPTIMUM FOUND
0.69/0.70 v -x652 -x651 -x650 -x649 -x648 -x647 -x646 x645 -x644 x643 -x642 x641 -x640 x639 x638 -x637 -x636 x635 -x634 x633 x632 x631 x630
0.69/0.70 v x629 -x628 x627 -x626 x625 -x624 -x623 -x622 -x621 -x620 -x619 -x618 x617 -x616 x615 x614 -x613 -x612 -x611 -x610 x609 -x608
0.69/0.70 v -x607 -x606 x605 -x604 -x603 x602 -x601 -x600 -x599 -x598 -x597 -x596 x595 x594 -x593 -x592 -x591 -x590 -x589 -x588 x587 -x586
0.69/0.70 v -x585 -x584 -x583 -x582 -x581 -x580 -x579 -x578 -x577 -x576 -x575 -x574 -x573 x572 -x571 -x570 -x569 -x568 -x567 x566 -x565
0.69/0.70 v -x564 -x563 -x562 -x561 -x560 -x559 -x558 -x557 -x556 -x555 -x554 -x553 x552 -x551 -x550 -x549 -x548 -x547 -x546 -x545 x544
0.69/0.70 v -x543 -x542 -x541 -x540 -x539 x538 -x537 x536 -x535 -x534 -x533 -x532 -x531 -x530 -x529 -x528 -x527 -x526 -x525 -x524 -x523
0.69/0.70 v -x522 x521 -x520 -x519 x518 -x517 -x516 -x515 x514 -x513 -x512 -x511 -x510 -x509 -x508 -x507 -x506 -x505 -x504 -x503 -x502 -x501
0.69/0.70 v -x500 -x499 x498 -x497 -x496 -x495 -x494 -x493 -x492 x491 x490 -x489 -x488 -x487 -x486 x485 -x484 -x483 -x482 -x481 -x480
0.69/0.70 v -x479 -x478 x477 -x476 -x475 -x474 -x473 -x472 x471 -x470 -x469 -x468 -x467 -x466 -x465 -x464 -x463 -x462 -x461 -x460 -x459
0.69/0.70 v -x458 -x457 -x456 -x455 -x454 x453 x452 -x451 x450 -x449 -x448 -x447 -x446 x445 -x444 -x443 -x442 -x441 -x440 -x439 -x438 -x437
0.69/0.70 v -x436 -x435 -x434 -x433 -x432 -x431 -x430 -x429 x428 x427 x426 -x425 -x424 -x423 x422 -x421 -x420 -x419 -x418 -x417 -x416
0.69/0.70 v -x415 x414 -x413 x412 -x411 -x410 -x409 x408 -x407 -x406 -x405 -x404 -x403 -x402 -x401 -x400 -x399 -x398 -x397 x396 -x395 -x394
0.69/0.70 v -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 x383 -x382 -x381 -x380 -x379 -x378 -x377 -x376 -x375 -x374 -x373
0.69/0.70 v -x372 -x371 -x370 -x369 -x368 -x367 -x366 -x365 -x364 -x363 -x362 -x361 x360 -x359 -x358 x357 x356 -x355 -x354 -x353 -x352
0.69/0.70 v -x351 -x350 x349 x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 x332 -x331 -x330
0.69/0.70 v x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 -x309
0.69/0.70 v x308 -x307 x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288
0.69/0.70 v -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 x271 -x270 -x269 -x268 -x267
0.69/0.70 v -x266 x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246
0.69/0.70 v -x245 x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 x236 x235 -x234 -x233 x232 -x231 -x230 x229 -x228 -x227 -x226 -x225 -x224
0.69/0.70 v -x223 -x222 -x221 -x220 -x219 x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 x208 -x207 -x206 -x205 -x204 -x203
0.69/0.70 v -x202 -x201 -x200 -x199 -x198 -x197 -x196 x195 -x194 -x193 -x192 -x191 -x190 -x189 x188 -x187 -x186 -x185 -x184 x183 -x182
0.69/0.70 v x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161
0.69/0.70 v x160 x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 x142 -x141 -x140 -x139
0.69/0.70 v -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 x121 x120 x119 -x118
0.69/0.70 v -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97
0.69/0.70 v x96 x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 x81 -x80 -x79 -x78 -x77 -x76 x75 -x74 -x73 x72 -x71
0.69/0.70 v -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 x49 -x48 -x47 -x46
0.69/0.70 v -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21
0.69/0.70 v -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 x11 -x10 -x9 x8 -x7 -x6 -x5 -x4 x3 -x2 x1
0.69/0.70 c SCIP Status : problem is solved [optimal solution found]
0.69/0.70 c Solving Time : 0.63
0.69/0.70 c Original Problem :
0.69/0.70 c Problem name : HOME/instance-2666210-1276593478.opb
0.69/0.70 c Variables : 652 (652 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.70 c Constraints : 759 initial, 759 maximal
0.69/0.70 c Presolved Problem :
0.69/0.70 c Problem name : t_HOME/instance-2666210-1276593478.opb
0.69/0.70 c Variables : 606 (606 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.70 c Constraints : 373 initial, 373 maximal
0.69/0.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.70 c trivial : 0.00 0 0 0 0 0 0 0 0
0.69/0.70 c dualfix : 0.00 39 0 0 0 0 0 0 0
0.69/0.70 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.70 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.70 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.70 c probing : 0.00 0 0 0 0 0 0 0 0
0.69/0.70 c linear : 0.02 0 7 0 0 0 386 351 0
0.69/0.70 c logicor : 0.01 0 0 0 0 0 0 0 0
0.69/0.70 c root node : - 0 - - 0 - - - -
0.69/0.70 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.70 c integral : 0 0 0 1 0 0 0 0 0 0
0.69/0.70 c logicor : 373 7 91 1 0 0 0 0 0 0
0.69/0.70 c countsols : 0 0 0 1 0 0 0 0 0 0
0.69/0.70 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.70 c integral : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c Propagators : Time Calls Cutoffs DomReds
0.69/0.70 c vbounds : 0.00 2 0 0
0.69/0.70 c rootredcost : 0.00 0 0 0
0.69/0.70 c pseudoobj : 0.00 7 0 0
0.69/0.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.70 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.70 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.70 c applied globally : - - - 0 0.0 - - -
0.69/0.70 c applied locally : - - - 0 0.0 - - -
0.69/0.70 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.70 c cut pool : 0.02 6 - - 47 - (maximal pool size: 253)
0.69/0.70 c redcost : 0.00 7 0 0 0 0
0.69/0.70 c impliedbounds : 0.00 6 0 0 0 0
0.69/0.70 c intobj : 0.00 0 0 0 0 0
0.69/0.70 c cgmip : 0.00 0 0 0 0 0
0.69/0.70 c gomory : 0.21 6 0 0 935 0
0.69/0.70 c strongcg : 0.20 6 0 0 867 0
0.69/0.70 c cmir : 0.03 6 0 0 0 0
0.69/0.70 c flowcover : 0.05 6 0 0 0 0
0.69/0.70 c clique : 0.00 1 0 0 0 0
0.69/0.70 c zerohalf : 0.00 0 0 0 0 0
0.69/0.70 c mcf : 0.00 1 0 0 0 0
0.69/0.70 c rapidlearning : 0.00 0 0 0 0 0
0.69/0.70 c Pricers : Time Calls Vars
0.69/0.70 c problem variables: 0.00 0 0
0.69/0.70 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.70 c pscost : 0.00 0 0 0 0 0 0
0.69/0.70 c inference : 0.00 0 0 0 0 0 0
0.69/0.70 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.70 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.70 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.70 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.70 c random : 0.00 0 0 0 0 0 0
0.69/0.70 c relpscost : 0.00 0 0 0 0 0 0
0.69/0.70 c Primal Heuristics : Time Calls Found
0.69/0.70 c LP solutions : 0.00 - 1
0.69/0.70 c pseudo solutions : 0.00 - 0
0.69/0.70 c crossover : 0.00 0 0
0.69/0.70 c oneopt : 0.00 4 2
0.69/0.70 c trivial : 0.00 2 3
0.69/0.70 c simplerounding : 0.00 6 6
0.69/0.70 c zirounding : 0.00 0 0
0.69/0.70 c rounding : 0.00 6 0
0.69/0.70 c shifting : 0.01 6 1
0.69/0.70 c intshifting : 0.00 0 0
0.69/0.70 c twoopt : 0.00 0 0
0.69/0.70 c fixandinfer : 0.00 0 0
0.69/0.70 c feaspump : 0.00 0 0
0.69/0.70 c coefdiving : 0.00 0 0
0.69/0.70 c pscostdiving : 0.00 0 0
0.69/0.70 c fracdiving : 0.00 0 0
0.69/0.70 c veclendiving : 0.00 0 0
0.69/0.70 c intdiving : 0.00 0 0
0.69/0.70 c actconsdiving : 0.00 0 0
0.69/0.70 c objpscostdiving : 0.00 0 0
0.69/0.70 c rootsoldiving : 0.00 0 0
0.69/0.70 c linesearchdiving : 0.00 0 0
0.69/0.70 c guideddiving : 0.00 0 0
0.69/0.70 c octane : 0.00 0 0
0.69/0.70 c rens : 0.00 0 0
0.69/0.70 c rins : 0.00 0 0
0.69/0.70 c localbranching : 0.00 0 0
0.69/0.70 c mutation : 0.00 0 0
0.69/0.70 c dins : 0.00 0 0
0.69/0.70 c undercover : 0.00 0 0
0.69/0.70 c nlp : 0.00 0 0
0.69/0.70 c trysol : 0.00 0 0
0.69/0.70 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.70 c primal LP : 0.00 0 0 0.00 -
0.69/0.70 c dual LP : 0.04 7 665 95.00 16625.00
0.69/0.70 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.70 c barrier LP : 0.00 0 0 0.00 -
0.69/0.70 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.70 c strong branching : 0.00 0 0 0.00 -
0.69/0.70 c (at root node) : - 0 0 0.00 -
0.69/0.70 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.70 c B&B Tree :
0.69/0.70 c number of runs : 1
0.69/0.70 c nodes : 1
0.69/0.70 c nodes (total) : 1
0.69/0.70 c nodes left : 0
0.69/0.70 c max depth : 0
0.69/0.70 c max depth (total): 0
0.69/0.70 c backtracks : 0 (0.0%)
0.69/0.70 c delayed cutoffs : 0
0.69/0.70 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.70 c avg switch length: 2.00
0.69/0.70 c switching time : 0.00
0.69/0.70 c Solution :
0.69/0.70 c Solutions found : 13 (6 improvements)
0.69/0.70 c First Solution : +6.52000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.69/0.70 c Primal Bound : +9.00000000000000e+01 (in run 1, after 1 nodes, 0.63 seconds, depth 0, found by <relaxation>)
0.69/0.70 c Dual Bound : +9.00000000000000e+01
0.69/0.70 c Gap : 0.00 %
0.69/0.70 c Root Dual Bound : +9.00000000000000e+01
0.69/0.70 c Root Iterations : 665
0.69/0.71 c Time complete: 0.71.