0.19/0.21 c SCIP version 1.1.0.7
0.19/0.21 c LP-Solver Clp 1.8.2
0.19/0.21 c user parameter file <scip.set> not found - using default parameters
0.19/0.21 c read problem <HOME/instance-1884948-1245260845.opb>
0.19/0.21 c original problem has 483 variables (483 bin, 0 int, 0 impl, 0 cont) and 15156 constraints
0.19/0.24 c No objective function, only one solution is needed.
0.19/0.24 c start presolving problem
0.19/0.24 c presolving:
0.40/0.41 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 15156 upgd conss, 30270 impls, 0 clqs
0.40/0.43 c presolving (2 rounds):
0.40/0.43 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.40/0.43 c 30270 implications, 0 cliques
0.40/0.43 c presolved problem has 483 variables (483 bin, 0 int, 0 impl, 0 cont) and 15156 constraints
0.40/0.43 c 15156 constraints of type <logicor>
0.40/0.43 c transformed objective value is always integral (scale: 1)
0.40/0.43 c Presolving Time: 0.15
0.40/0.43 c PURESAT
0.40/0.43 c -----------------------------------------------------------------------------------------------
0.40/0.43 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.40/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.40/0.43 c separating/flowcover/freq = c -1
0.40/0.43 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.40/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.40/0.43 c separating/cmir/freq = c -1
0.40/0.43 c # additional number of allowed LP iterations
0.40/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.40/0.43 c heuristics/veclendiving/maxlpiterofs = c 1500
0.40/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.40/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.40/0.43 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.40/0.43 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.40/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.40/0.43 c heuristics/veclendiving/freq = c -1
0.40/0.43 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.40/0.44 c heuristics/simplerounding/freq = c -1
0.40/0.44 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.40/0.44 c heuristics/shifting/freq = c -1
0.40/0.44 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.40/0.44 c heuristics/rounding/freq = c -1
0.40/0.44 c # additional number of allowed LP iterations
0.40/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.40/0.44 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.40/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.40/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.40/0.44 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.40/0.44 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 20]
0.40/0.44 c heuristics/rootsoldiving/freq = c -1
0.40/0.44 c # number of nodes added to the contingent of the total nodes
0.40/0.44 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.40/0.44 c heuristics/rens/nodesofs = c 2000
0.40/0.44 c # minimum percentage of integer variables that have to be fixable
0.40/0.44 c # [type: real, range: [0,1], default: 0.5]
0.40/0.44 c heuristics/rens/minfixingrate = c 0.3
0.40/0.44 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 0]
0.40/0.44 c heuristics/rens/freq = c -1
0.40/0.44 c # additional number of allowed LP iterations
0.40/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.40/0.44 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.40/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.40/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.40/0.44 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.40/0.44 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.40/0.44 c heuristics/pscostdiving/freq = c -1
0.40/0.44 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.40/0.44 c heuristics/oneopt/freq = c -1
0.40/0.44 c # additional number of allowed LP iterations
0.40/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.40/0.44 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.40/0.44 c # maximal fraction of diving LP iterations compared to total iteration number
0.40/0.44 c # [type: real, range: [0,1], default: 0.01]
0.40/0.44 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.40/0.44 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 20]
0.40/0.44 c heuristics/objpscostdiving/freq = c -1
0.40/0.44 c # additional number of allowed LP iterations
0.40/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.40/0.44 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.40/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.40/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.40/0.44 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.40/0.44 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.40/0.44 c heuristics/linesearchdiving/freq = c -1
0.40/0.44 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.40/0.44 c heuristics/intshifting/freq = c -1
0.40/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.40/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.40/0.44 c heuristics/intdiving/maxlpiterquot = c 0.075
0.40/0.44 c # additional number of allowed LP iterations
0.40/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.40/0.44 c heuristics/guideddiving/maxlpiterofs = c 1500
0.40/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.40/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.40/0.44 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.40/0.44 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.40/0.44 c heuristics/guideddiving/freq = c -1
0.40/0.44 c # additional number of allowed LP iterations
0.40/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.40/0.44 c heuristics/fracdiving/maxlpiterofs = c 1500
0.40/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.40/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.40/0.44 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.40/0.44 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.40/0.44 c heuristics/fracdiving/freq = c -1
0.40/0.44 c # additional number of allowed LP iterations
0.40/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.40/0.44 c heuristics/feaspump/maxlpiterofs = c 2000
0.40/0.44 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 20]
0.40/0.44 c heuristics/feaspump/freq = c -1
0.40/0.44 c # minimum percentage of integer variables that have to be fixed
0.40/0.44 c # [type: real, range: [0,1], default: 0.666]
0.40/0.44 c heuristics/crossover/minfixingrate = c 0.5
0.40/0.44 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.40/0.44 c # [type: real, range: [0,1], default: 0.1]
0.40/0.44 c heuristics/crossover/nodesquot = c 0.15
0.40/0.44 c # number of nodes without incumbent change that heuristic should wait
0.40/0.44 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.40/0.44 c heuristics/crossover/nwaitingnodes = c 100
0.40/0.44 c # number of nodes added to the contingent of the total nodes
0.40/0.44 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.40/0.44 c heuristics/crossover/nodesofs = c 750
0.40/0.44 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 30]
0.40/0.44 c heuristics/crossover/freq = c -1
0.40/0.44 c # additional number of allowed LP iterations
0.40/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.40/0.44 c heuristics/coefdiving/maxlpiterofs = c 1500
0.40/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.40/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.40/0.44 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.40/0.44 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.40/0.44 c heuristics/coefdiving/freq = c -1
0.40/0.44 c # priority of node selection rule <dfs> in standard mode
0.40/0.44 c # [type: int, range: [-536870912,536870911], default: 0]
0.40/0.44 c nodeselection/dfs/stdpriority = c 1000000
0.40/0.44 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.40/0.44 c presolving/probing/maxrounds = c 0
0.40/0.44 c # should presolving try to simplify knapsacks
0.40/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.40/0.44 c constraints/knapsack/simplifyinequalities = c TRUE
0.40/0.44 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.40/0.44 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.40/0.44 c constraints/knapsack/disaggregation = c FALSE
0.40/0.44 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.40/0.44 c constraints/knapsack/maxnumcardlift = c 0
0.40/0.44 c # should presolving try to simplify inequalities
0.40/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.40/0.44 c constraints/linear/simplifyinequalities = c TRUE
0.40/0.44 c # maximal number of separation rounds in the root node (-1: unlimited)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.40/0.44 c separating/maxroundsroot = c 5
0.40/0.44 c # maximal number of separation rounds per node (-1: unlimited)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 5]
0.40/0.44 c separating/maxrounds = c 1
0.40/0.44 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.40/0.44 c # [type: char, range: {lafpsqd}, default: l]
0.40/0.44 c lp/pricing = c a
0.40/0.44 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.40/0.44 c lp/solvefreq = c 0
0.40/0.44 c # solving stops, if the given number of solutions were found (-1: no limit)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.40/0.44 c limits/solutions = c 1
0.40/0.44 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.40/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.40/0.44 c limits/memory = c 1620
0.40/0.44 c # maximal time in seconds to run
0.40/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.40/0.44 c limits/time = c 1791
0.40/0.44 c # frequency for displaying node information lines
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 100]
0.40/0.44 c display/freq = c 10000
0.40/0.44 c # should enforcement of pseudo solution be disabled?
0.40/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.40/0.44 c constraints/disableenfops = c TRUE
0.40/0.44 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: 0]
0.40/0.44 c constraints/agelimit = c 1
0.40/0.44 c # should binary conflicts be preferred?
0.40/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.40/0.44 c conflict/preferbinary = c TRUE
0.40/0.44 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.40/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.40/0.44 c conflict/interconss = c 0
0.40/0.44 c -----------------------------------------------------------------------------------------------
0.40/0.44 c start solving problem
0.40/0.44 c
0.49/0.53 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.53 c 0.3s| 1 | 0 | 42 | 17M| 0 | 42 | 483 | 15k| 15k| 483 | 15k| 0 | 0 | 0 | 2.100000e+01 | -- | Inf
0.89/0.92 c 0.6s| 1 | 0 | 154 | 17M| 0 | 38 | 483 | 15k| 15k| 483 | 15k| 3 | 0 | 0 | 2.100000e+01 | -- | Inf
1.39/1.42 c 1.1s| 1 | 0 | 377 | 17M| 0 | 38 | 483 | 15k| 15k| 483 | 15k| 12 | 0 | 0 | 2.100000e+01 | -- | Inf
1.79/1.82 c 1.5s| 1 | 0 | 521 | 17M| 0 | 30 | 483 | 15k| 15k| 483 | 15k| 20 | 0 | 0 | 2.100000e+01 | -- | Inf
2.59/2.61 c 2.3s| 1 | 0 | 850 | 17M| 0 | 27 | 483 | 15k| 15k| 483 | 15k| 29 | 0 | 0 | 2.100000e+01 | -- | Inf
4.49/4.53 c 4.2s| 1 | 0 | 1192 | 18M| 0 | 25 | 483 | 15k| 15k| 483 | 15k| 37 | 0 | 0 | 2.100000e+01 | -- | Inf
26.39/26.48 c 26.1s| 1 | 2 | 1192 | 18M| 0 | 25 | 483 | 15k| 15k| 483 | 15k| 37 | 0 | 25 | 2.100000e+01 | -- | Inf
26.88/26.94 c *26.6s| 608 | 0 | 1192 | 18M| 192 | - | 483 | 15k|7841 | 0 | 0 | 37 | 254 | 25 | 2.100000e+01 | 2.100000e+01 | 0.00%
26.88/26.95 c
26.88/26.95 c SCIP Status : problem is solved [optimal solution found]
26.88/26.95 c Solving Time (sec) : 26.58
26.88/26.95 c Solving Nodes : 608
26.88/26.95 c Primal Bound : +2.10000000000000e+01 (1 solutions)
26.88/26.95 c Dual Bound : +2.10000000000000e+01
26.88/26.95 c Gap : 0.00 %
26.88/26.96 c NODE 608
26.88/26.96 c DUAL BOUND 21
26.88/26.96 c PRIMAL BOUND 21
26.88/26.96 c GAP 0
26.88/26.96 s SATISFIABLE
26.88/26.96 v -x483 -x482 -x481 -x480 -x479 -x478 -x477 -x476 -x475 -x474 x473 -x472 -x471 -x470 -x469 -x468 -x467 -x466 -x465 -x464 -x463 -x462
26.88/26.96 v -x461 -x460 -x459 -x458 -x457 -x456 -x455 -x454 -x453 x452 -x451 -x450 -x449 -x448 -x447 -x446 -x445 -x444 -x443 -x442 -x441
26.88/26.96 v -x440 -x439 -x438 -x437 -x436 -x435 -x434 -x433 -x432 -x431 -x430 -x429 -x428 -x427 -x426 -x425 -x424 -x423 -x422 -x421 -x420
26.88/26.96 v x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 -x406 -x405 -x404 -x403 -x402 x401 -x400 -x399
26.88/26.96 v -x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 x382 -x381 -x380 -x379 -x378
26.88/26.96 v -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 -x366 x365 -x364 -x363 -x362 -x361 -x360 -x359 -x358 -x357
26.88/26.96 v -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 -x337 -x336
26.88/26.96 v -x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 -x327 -x326 -x325 x324 -x323 -x322 -x321 x320 -x319 -x318 -x317 -x316 -x315
26.88/26.96 v -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294
26.88/26.96 v -x293 -x292 -x291 -x290 -x289 -x288 x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273
26.88/26.96 v -x272 -x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252
26.88/26.96 v -x251 -x250 x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233 -x232 -x231
26.88/26.96 v -x230 x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210
26.88/26.96 v -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
26.88/26.96 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 x169 -x168
26.88/26.96 v -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
26.88/26.96 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126
26.88/26.96 v -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
26.88/26.96 v -x105 -x104 -x103 -x102 -x101 -x100 x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82
26.88/26.96 v x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56
26.88/26.96 v -x55 -x54 -x53 -x52 -x51 -x50 x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31
26.88/26.96 v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5
26.88/26.96 v -x4 -x3 -x2 -x1
26.88/26.96 c SCIP Status : problem is solved [optimal solution found]
26.88/26.96 c Solving Time : 26.58
26.88/26.96 c Original Problem :
26.88/26.96 c Problem name : HOME/instance-1884948-1245260845.opb
26.88/26.96 c Variables : 483 (483 binary, 0 integer, 0 implicit integer, 0 continuous)
26.88/26.96 c Constraints : 15156 initial, 15156 maximal
26.88/26.96 c Presolved Problem :
26.88/26.96 c Problem name : t_HOME/instance-1884948-1245260845.opb
26.88/26.96 c Variables : 483 (483 binary, 0 integer, 0 implicit integer, 0 continuous)
26.88/26.96 c Constraints : 15156 initial, 15165 maximal
26.88/26.96 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
26.88/26.96 c trivial : 0.00 0 0 0 0 0 0 0 0
26.88/26.96 c dualfix : 0.00 0 0 0 0 0 0 0 0
26.88/26.96 c boundshift : 0.00 0 0 0 0 0 0 0 0
26.88/26.96 c inttobinary : 0.00 0 0 0 0 0 0 0 0
26.88/26.96 c implics : 0.00 0 0 0 0 0 0 0 0
26.88/26.96 c probing : 0.00 0 0 0 0 0 0 0 0
26.88/26.96 c logicor : 0.05 0 0 0 0 0 0 0 0
26.88/26.96 c root node : - 0 - - 0 - - - -
26.88/26.96 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
26.88/26.96 c integral : 0 0 0 1 0 0 0 0 0 2
26.88/26.96 c logicor : 15156+ 5 1830 0 1 254 12652 0 0 0
26.88/26.96 c countsols : 0 0 0 0 1 0 0 0 0 0
26.88/26.96 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
26.88/26.96 c integral : 21.93 0.00 0.00 21.93 0.00
26.88/26.96 c logicor : 0.25 0.02 0.23 0.00 0.00
26.88/26.96 c countsols : 0.00 0.00 0.00 0.00 0.00
26.88/26.96 c Propagators : Time Calls Cutoffs DomReds
26.88/26.96 c rootredcost : 0.00 0 0 0
26.88/26.96 c pseudoobj : 0.08 2284 0 0
26.88/26.96 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
26.88/26.96 c propagation : 0.04 254 254 254 66.9 1 60.0 -
26.88/26.96 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
26.88/26.96 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
26.88/26.96 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
26.88/26.96 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
26.88/26.96 c applied globally : - - - 85 33.5 - - -
26.88/26.96 c applied locally : - - - 169 83.7 - - -
26.88/26.96 c Separators : Time Calls Cutoffs DomReds Cuts Conss
26.88/26.96 c cut pool : 0.00 4 - - 0 - (maximal pool size: 185)
26.88/26.96 c redcost : 0.00 5 0 0 0 0
26.88/26.96 c impliedbounds : 0.00 5 0 0 0 0
26.88/26.96 c intobj : 0.00 0 0 0 0 0
26.88/26.96 c gomory : 1.23 5 0 0 2433 0
26.88/26.96 c strongcg : 0.89 5 0 0 2500 0
26.88/26.96 c cmir : 0.00 0 0 0 0 0
26.88/26.96 c flowcover : 0.00 0 0 0 0 0
26.88/26.96 c clique : 0.02 5 0 0 22 0
26.88/26.96 c zerohalf : 0.00 0 0 0 0 0
26.88/26.96 c mcf : 0.02 1 0 0 0 0
26.88/26.96 c Pricers : Time Calls Vars
26.88/26.96 c problem variables: 0.00 0 0
26.88/26.96 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
26.88/26.96 c relpscost : 21.93 1 0 0 0 0 2
26.88/26.96 c pscost : 0.00 0 0 0 0 0 0
26.88/26.96 c inference : 0.01 485 0 0 0 0 970
26.88/26.96 c mostinf : 0.00 0 0 0 0 0 0
26.88/26.96 c leastinf : 0.00 0 0 0 0 0 0
26.88/26.96 c fullstrong : 0.00 0 0 0 0 0 0
26.88/26.96 c allfullstrong : 0.00 0 0 0 0 0 0
26.88/26.96 c random : 0.00 0 0 0 0 0 0
26.88/26.96 c Primal Heuristics : Time Calls Found
26.88/26.96 c LP solutions : 0.00 - 0
26.88/26.96 c pseudo solutions : 0.00 - 1
26.88/26.96 c simplerounding : 0.00 0 0
26.88/26.96 c rounding : 0.00 0 0
26.88/26.96 c shifting : 0.00 0 0
26.88/26.96 c intshifting : 0.00 0 0
26.88/26.96 c oneopt : 0.00 0 0
26.88/26.96 c fixandinfer : 0.00 0 0
26.88/26.96 c feaspump : 0.00 0 0
26.88/26.96 c coefdiving : 0.00 0 0
26.88/26.96 c pscostdiving : 0.00 0 0
26.88/26.96 c fracdiving : 0.00 0 0
26.88/26.96 c veclendiving : 0.00 0 0
26.88/26.96 c intdiving : 0.00 0 0
26.88/26.96 c actconsdiving : 0.00 0 0
26.88/26.96 c objpscostdiving : 0.00 0 0
26.88/26.96 c rootsoldiving : 0.00 0 0
26.88/26.96 c linesearchdiving : 0.00 0 0
26.88/26.96 c guideddiving : 0.00 0 0
26.88/26.96 c octane : 0.00 0 0
26.88/26.96 c rens : 0.00 0 0
26.88/26.96 c rins : 0.00 0 0
26.88/26.96 c localbranching : 0.00 0 0
26.88/26.96 c mutation : 0.00 0 0
26.88/26.96 c crossover : 0.00 0 0
26.88/26.96 c dins : 0.00 0 0
26.88/26.96 c LP : Time Calls Iterations Iter/call Iter/sec
26.88/26.96 c primal LP : 0.02 0 0 0.00 0.00
26.88/26.96 c dual LP : 1.73 6 1192 198.67 689.02
26.88/26.96 c barrier LP : 0.00 0 0 0.00 -
26.88/26.96 c diving/probing LP: 0.00 0 0 0.00 -
26.88/26.96 c strong branching : 21.93 25 8677 347.08 395.67
26.88/26.96 c (at root node) : - 25 8677 347.08 -
26.88/26.96 c conflict analysis: 0.00 0 0 0.00 -
26.88/26.96 c B&B Tree :
26.88/26.96 c number of runs : 1
26.88/26.96 c nodes : 608
26.88/26.96 c nodes (total) : 608
26.88/26.96 c nodes left : 0
26.88/26.96 c max depth : 192
26.88/26.96 c max depth (total): 192
26.88/26.96 c backtracks : 146 (24.0%)
26.88/26.96 c delayed cutoffs : 189
26.88/26.96 c repropagations : 384 (6660 domain reductions, 133 cutoffs)
26.88/26.96 c avg switch length: 2.52
26.88/26.96 c switching time : 0.07
26.88/26.96 c Solution :
26.88/26.96 c Solutions found : 1 (1 improvements)
26.88/26.96 c Primal Bound : +2.10000000000000e+01 (in run 1, after 608 nodes, 26.58 seconds, depth 179, found by <relaxation>)
26.88/26.96 c Dual Bound : +2.10000000000000e+01
26.88/26.96 c Gap : 0.00 %
26.88/26.96 c Root Dual Bound : +2.10000000000000e+01
26.98/27.01 c Time complete: 27.