0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver SoPlex 1.4.1
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-3730540-1338682922.opb>
0.00/0.01 c original problem has 540 variables (540 bin, 0 int, 0 impl, 0 cont) and 416 constraints
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 416 upgd conss, 0 impls, 38 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 38 cliques
0.00/0.02 c presolved problem has 540 variables (540 bin, 0 int, 0 impl, 0 cont) and 416 constraints
0.00/0.02 c 38 constraints of type <setppc>
0.00/0.02 c 378 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c SATUNSAT-LIN
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = c -1
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = c -1
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = c 2000
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = c 0.3
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = c -1
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = c -1
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = c 0.15
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/crossover/nodesofs = c 750
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/coefdiving/freq = c -1
0.00/0.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c presolving/probing/maxrounds = c 0
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = c FALSE
0.00/0.02 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = c 5
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = c 1
0.00/0.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = c 1
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = c 13950
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = c 1791
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = c 10000
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving problem
0.00/0.02 c
0.00/0.04 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 567 |2075k| 0 | 342 | 540 | 416 | 416 | 540 | 416 | 0 | 0 | 0 | 1.900000e+01 | -- | Inf
0.08/0.10 c 0.1s| 1 | 0 | 848 |2252k| 0 | 232 | 540 | 416 | 416 | 540 | 431 | 15 | 0 | 0 | 2.550000e+01 | -- | Inf
0.08/0.15 c 0.1s| 1 | 0 | 1177 |2545k| 0 | 40 | 540 | 416 | 416 | 540 | 444 | 28 | 0 | 0 | 3.400000e+01 | -- | Inf
0.08/0.16 c 0.1s| 1 | 0 | 1254 |2589k| 0 | 61 | 540 | 416 | 416 | 540 | 448 | 32 | 0 | 0 | 3.455556e+01 | -- | Inf
0.08/0.17 c 0.2s| 1 | 0 | 1268 |2671k| 0 | 0 | 540 | 416 | 416 | 540 | 452 | 36 | 0 | 0 | 3.600000e+01 | -- | Inf
0.08/0.17 c * 0.2s| 1 | 0 | 1268 |2677k| 0 | - | 540 | 416 | 416 | 540 | 452 | 36 | 0 | 0 | 3.600000e+01 | 3.600000e+01 | 0.00%
0.08/0.17 c
0.08/0.17 c SCIP Status : problem is solved [optimal solution found]
0.08/0.17 c Solving Time (sec) : 0.16
0.08/0.17 c Solving Nodes : 1
0.08/0.17 c Primal Bound : +3.60000000000000e+01 (1 solutions)
0.08/0.17 c Dual Bound : +3.60000000000000e+01
0.08/0.17 c Gap : 0.00 %
0.08/0.17 c NODE 1
0.08/0.17 c DUAL BOUND 36
0.08/0.17 c PRIMAL BOUND 36
0.08/0.17 c GAP 0
0.08/0.17 s SATISFIABLE
0.08/0.17 v -x205 -x202 -x210 x219 -x20 -x13 -x11 -x9 -x19 -x201 -x10 -x8 -x217 -x7 -x220 x14 -x12 -x209 -x5 -x111 -x109 -x107 -x104 -x103
0.08/0.17 v -x93 -x91 -x87 -x83 x82 -x216 -x3 -x84 -x117 -x100 -x218 -x18 -x40 -x35 -x34 -x33 -x30 -x29 -x28 -x26 -x25 -x22 -x173 -x172 -x171
0.08/0.17 v -x167 -x165 -x163 -x161 -x211 -x38 -x60 -x53 -x51 x47 -x43 -x95 -x179 -x106 -x97 -x98 -x58 -x164 -x115 -x300 -x296 -x293
0.08/0.17 v -x291 -x284 -x283 -x282 -x299 -x294 -x260 -x259 -x258 -x255 -x253 -x250 -x247 -x245 -x238 -x234 -x233 -x232 -x228 -x227 -x225
0.08/0.17 v -x224 -x221 -x290 -x86 -x292 -x288 -x287 -x207 -x46 -x162 -x45 -x116 -x32 -x55 -x235 -x285 -x237 -x57 -x212 -x44 -x1 -x286
0.08/0.17 v -x177 -x180 -x4 -x59 -x27 -x81 -x113 -x256 -x96 -x54 -x178 -x236 -x102 -x37 x80 -x79 -x78 -x76 -x74 -x72 -x69 -x66 -x65 -x64
0.08/0.17 v -x62 -x248 -x67 -x16 x289 -x42 -x88 -x49 -x249 -x120 -x213 -x108 -x77 -x114 -x140 -x139 -x137 -x135 -x131 -x129 -x128 -x127 -x121
0.08/0.17 v -x101 -x222 -x170 -x257 -x71 -x203 -x6 x175 -x229 -x52 -x125 -x423 -x422 x421 -x420 -x419 -x418 -x417 -x416 -x415 -x85 -x124
0.08/0.17 v -x90 -x70 -x112 -x204 -x119 -x75 -x15 -x31 -x166 -x254 -x105 x241 -x223 -x208 -x110 -x138 -x63 -x48 -x231 -x226 -x540 -x539
0.08/0.17 v -x538 -x537 -x536 x535 -x534 -x533 -x532 -x240 -x297 -x92 -x136 -x168 -x39 -x459 -x458 -x457 -x456 -x455 -x454 -x453 -x452
0.08/0.17 v x451 -x251 -x2 -x50 x23 -x242 -x73 -x206 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187
0.08/0.17 v x186 -x182 -x181 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x267 -x265 -x264 -x263 -x262 -x261
0.08/0.17 v -x56 -x169 -x99 -x214 -x252 x468 -x467 -x466 -x465 -x464 -x463 -x462 -x461 -x460 x132 -x183 -x184 x230 -x295 -x24 -x281 -x340
0.08/0.17 v -x339 -x338 x336 -x335 -x334 -x333 -x332 -x331 -x329 -x328 -x327 -x326 -x324 -x323 -x322 -x321 -x21 -x36 -x325 -x266 -x174
0.08/0.17 v -x441 -x440 -x439 -x438 -x437 -x436 -x435 x434 -x433 -x89 -x531 -x530 -x529 -x528 -x527 -x526 -x525 x524 -x523 -x239 -x360 -x359
0.08/0.17 v -x358 -x357 -x355 -x354 x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x378 -x377 -x376 -x375
0.08/0.17 v -x374 x373 -x372 -x371 -x370 -x122 -x246 -x477 -x476 -x475 -x474 -x473 -x472 x471 -x470 -x469 -x133 -x405 x404 -x403 -x402
0.08/0.17 v -x401 -x400 -x399 -x398 -x397 -x185 -x123 -x337 -x126 -x176 x268 -x513 -x512 -x511 -x510 -x509 -x508 -x507 -x506 -x505 -x17
0.08/0.17 v -x130 -x504 -x503 -x502 -x501 x500 -x499 -x498 -x497 -x496 -x356 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 x311
0.08/0.17 v -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 x118 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x244
0.08/0.17 v -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x147 x145 -x144 -x143 -x142 -x141 -x61 -x68 -x522 -x521
0.08/0.17 v -x520 x519 -x518 -x517 -x516 -x515 -x514 -x298 -x495 -x494 x493 -x492 -x491 -x490 -x489 -x488 -x487 -x215 -x94 -x432 -x431
0.08/0.17 v -x430 -x429 -x428 -x427 x426 -x425 -x424 -x148 -x387 -x386 -x385 -x384 -x383 -x382 -x381 -x380 x379 -x243 -x369 -x368 -x367
0.08/0.17 v -x366 x365 -x364 -x363 -x362 -x361 -x41 -x450 -x449 -x448 x447 -x446 -x445 -x444 -x443 -x442 -x330 -x486 x485 -x484 -x483 -x482
0.08/0.17 v -x481 -x480 -x479 -x478 -x134 x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 -x406 -x146
0.08/0.17 c SCIP Status : problem is solved [optimal solution found]
0.08/0.17 c Solving Time : 0.16
0.08/0.17 c Original Problem :
0.08/0.17 c Problem name : HOME/instance-3730540-1338682922.opb
0.08/0.17 c Variables : 540 (540 binary, 0 integer, 0 implicit integer, 0 continuous)
0.08/0.17 c Constraints : 416 initial, 416 maximal
0.08/0.17 c Presolved Problem :
0.08/0.17 c Problem name : t_HOME/instance-3730540-1338682922.opb
0.08/0.17 c Variables : 540 (540 binary, 0 integer, 0 implicit integer, 0 continuous)
0.08/0.17 c Constraints : 416 initial, 416 maximal
0.08/0.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.08/0.17 c trivial : 0.00 0 0 0 0 0 0 0 0
0.08/0.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.08/0.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.08/0.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.08/0.17 c implics : 0.00 0 0 0 0 0 0 0 0
0.08/0.17 c probing : 0.00 0 0 0 0 0 0 0 0
0.08/0.17 c setppc : 0.00 0 0 0 0 0 0 0 0
0.08/0.17 c logicor : 0.00 0 0 0 0 0 0 0 0
0.08/0.17 c root node : - 0 - - 0 - - - -
0.08/0.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.08/0.17 c integral : 0 0 0 1 0 0 0 0 0 0
0.08/0.17 c setppc : 38 5 1 1 0 0 0 0 0 0
0.08/0.17 c logicor : 378 5 1 1 0 0 0 0 0 0
0.08/0.17 c countsols : 0 0 0 1 0 0 0 0 0 0
0.08/0.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.08/0.17 c integral : 0.00 0.00 0.00 0.00 0.00
0.08/0.17 c setppc : 0.00 0.00 0.00 0.00 0.00
0.08/0.17 c logicor : 0.00 0.00 0.00 0.00 0.00
0.08/0.17 c countsols : 0.00 0.00 0.00 0.00 0.00
0.08/0.17 c Propagators : Time Calls Cutoffs DomReds
0.08/0.17 c rootredcost : 0.00 0 0 0
0.08/0.17 c pseudoobj : 0.00 6 0 0
0.08/0.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.08/0.17 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.08/0.17 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.08/0.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.08/0.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.08/0.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.08/0.17 c applied globally : - - - 0 0.0 - - -
0.08/0.17 c applied locally : - - - 0 0.0 - - -
0.08/0.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.08/0.17 c cut pool : 0.00 4 - - 0 - (maximal pool size: 165)
0.08/0.17 c redcost : 0.00 5 0 0 0 0
0.08/0.17 c impliedbounds : 0.00 4 0 0 0 0
0.08/0.17 c intobj : 0.00 0 0 0 0 0
0.08/0.17 c gomory : 0.02 5 0 0 815 0
0.08/0.17 c strongcg : 0.03 5 0 0 845 0
0.08/0.17 c cmir : 0.00 0 0 0 0 0
0.08/0.17 c flowcover : 0.00 0 0 0 0 0
0.08/0.17 c clique : 0.00 5 0 0 0 0
0.08/0.17 c zerohalf : 0.00 0 0 0 0 0
0.08/0.17 c mcf : 0.00 1 0 0 0 0
0.08/0.17 c Pricers : Time Calls Vars
0.08/0.17 c problem variables: 0.00 0 0
0.08/0.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.08/0.17 c pscost : 0.00 0 0 0 0 0 0
0.08/0.17 c inference : 0.00 0 0 0 0 0 0
0.08/0.17 c mostinf : 0.00 0 0 0 0 0 0
0.08/0.17 c leastinf : 0.00 0 0 0 0 0 0
0.08/0.17 c fullstrong : 0.00 0 0 0 0 0 0
0.08/0.17 c allfullstrong : 0.00 0 0 0 0 0 0
0.08/0.17 c random : 0.00 0 0 0 0 0 0
0.08/0.17 c relpscost : 0.00 0 0 0 0 0 0
0.08/0.17 c Primal Heuristics : Time Calls Found
0.08/0.17 c LP solutions : 0.00 - 1
0.08/0.17 c pseudo solutions : 0.00 - 0
0.08/0.17 c simplerounding : 0.00 0 0
0.08/0.17 c rounding : 0.00 0 0
0.08/0.17 c shifting : 0.00 0 0
0.08/0.17 c intshifting : 0.00 0 0
0.08/0.17 c oneopt : 0.00 0 0
0.08/0.17 c fixandinfer : 0.00 0 0
0.08/0.17 c feaspump : 0.00 0 0
0.08/0.17 c coefdiving : 0.00 0 0
0.08/0.17 c pscostdiving : 0.00 0 0
0.08/0.17 c fracdiving : 0.00 0 0
0.08/0.17 c veclendiving : 0.00 0 0
0.08/0.17 c intdiving : 0.00 0 0
0.08/0.17 c actconsdiving : 0.00 0 0
0.08/0.17 c objpscostdiving : 0.00 0 0
0.08/0.17 c rootsoldiving : 0.00 0 0
0.08/0.17 c linesearchdiving : 0.00 0 0
0.08/0.17 c guideddiving : 0.00 0 0
0.08/0.17 c octane : 0.00 0 0
0.08/0.17 c rens : 0.00 0 0
0.08/0.17 c rins : 0.00 0 0
0.08/0.17 c localbranching : 0.00 0 0
0.08/0.17 c mutation : 0.00 0 0
0.08/0.17 c crossover : 0.00 0 0
0.08/0.17 c dins : 0.00 0 0
0.08/0.17 c LP : Time Calls Iterations Iter/call Iter/sec
0.08/0.17 c primal LP : 0.00 0 0 0.00 -
0.08/0.17 c dual LP : 0.09 5 1268 253.60 14088.89
0.08/0.17 c barrier LP : 0.00 0 0 0.00 -
0.08/0.17 c diving/probing LP: 0.00 0 0 0.00 -
0.08/0.17 c strong branching : 0.00 0 0 0.00 -
0.08/0.17 c (at root node) : - 0 0 0.00 -
0.08/0.17 c conflict analysis: 0.00 0 0 0.00 -
0.08/0.17 c B&B Tree :
0.08/0.17 c number of runs : 1
0.08/0.17 c nodes : 1
0.08/0.17 c nodes (total) : 1
0.08/0.17 c nodes left : 0
0.08/0.17 c max depth : 0
0.08/0.17 c max depth (total): 0
0.08/0.17 c backtracks : 0 (0.0%)
0.08/0.17 c delayed cutoffs : 0
0.08/0.17 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.08/0.17 c avg switch length: 2.00
0.08/0.17 c switching time : 0.00
0.08/0.17 c Solution :
0.08/0.17 c Solutions found : 1 (1 improvements)
0.08/0.17 c Primal Bound : +3.60000000000000e+01 (in run 1, after 1 nodes, 0.16 seconds, depth 0, found by <relaxation>)
0.08/0.17 c Dual Bound : +3.60000000000000e+01
0.08/0.17 c Gap : 0.00 %
0.08/0.17 c Root Dual Bound : +3.60000000000000e+01
0.08/0.17 c Time complete: 0.17.