0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2702924-1278576741.opb>
0.06/0.08 c original problem has 6616 variables (6616 bin, 0 int, 0 impl, 0 cont) and 6818 constraints
0.06/0.08 c problem read
0.06/0.08 c No objective function, only one solution is needed.
0.06/0.08 c presolving settings loaded
0.09/0.17 c presolving:
0.29/0.33 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 50128 impls, 400 clqs
0.39/0.44 c presolving (2 rounds):
0.39/0.44 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.44 c 50128 implications, 400 cliques
0.39/0.44 c presolved problem has 6616 variables (6616 bin, 0 int, 0 impl, 0 cont) and 6818 constraints
0.39/0.44 c 1 constraints of type <knapsack>
0.39/0.44 c 600 constraints of type <setppc>
0.39/0.44 c 6216 constraints of type <and>
0.39/0.44 c 1 constraints of type <linear>
0.39/0.44 c transformed objective value is always integral (scale: 1)
0.39/0.44 c Presolving Time: 0.31
0.39/0.44 c - non default parameters ----------------------------------------------------------------------
0.39/0.44 c # SCIP version 1.2.1.3
0.39/0.44 c
0.39/0.44 c # frequency for displaying node information lines
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.44 c display/freq = 10000
0.39/0.44 c
0.39/0.44 c # maximal time in seconds to run
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.44 c limits/time = 1789.92
0.39/0.44 c
0.39/0.44 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.44 c limits/memory = 1620
0.39/0.44 c
0.39/0.44 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.44 c limits/solutions = 1
0.39/0.44 c
0.39/0.44 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.44 c separating/maxrounds = 1
0.39/0.44 c
0.39/0.44 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.44 c separating/maxroundsroot = 5
0.39/0.44 c
0.39/0.44 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.39/0.44 c # [type: int, range: [1,2], default: 1]
0.39/0.44 c timing/clocktype = 2
0.39/0.44 c
0.39/0.44 c # should presolving try to simplify inequalities
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.44 c constraints/linear/simplifyinequalities = TRUE
0.39/0.44 c
0.39/0.44 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.44 c constraints/indicator/addCouplingCons = TRUE
0.39/0.44 c
0.39/0.44 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.44 c constraints/knapsack/disaggregation = FALSE
0.39/0.44 c
0.39/0.44 c # should presolving try to simplify knapsacks
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.44 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.44 c
0.39/0.44 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.44 c presolving/probing/maxrounds = 0
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/coefdiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.44 c heuristics/crossover/freq = -1
0.39/0.44 c
0.39/0.44 c # number of nodes added to the contingent of the total nodes
0.39/0.44 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.44 c heuristics/crossover/nodesofs = 750
0.39/0.44 c
0.39/0.44 c # number of nodes without incumbent change that heuristic should wait
0.39/0.44 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.44 c heuristics/crossover/nwaitingnodes = 100
0.39/0.44 c
0.39/0.44 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.44 c # [type: real, range: [0,1], default: 0.1]
0.39/0.44 c heuristics/crossover/nodesquot = 0.15
0.39/0.44 c
0.39/0.44 c # minimum percentage of integer variables that have to be fixed
0.39/0.44 c # [type: real, range: [0,1], default: 0.666]
0.39/0.44 c heuristics/crossover/minfixingrate = 0.5
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.44 c heuristics/feaspump/freq = -1
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/fracdiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/guideddiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/intshifting/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/linesearchdiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/nlp/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.44 c heuristics/objpscostdiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.44 c # [type: real, range: [0,1], default: 0.01]
0.39/0.44 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/oneopt/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/pscostdiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.44 c heuristics/rens/freq = -1
0.39/0.44 c
0.39/0.44 c # minimum percentage of integer variables that have to be fixable
0.39/0.44 c # [type: real, range: [0,1], default: 0.5]
0.39/0.44 c heuristics/rens/minfixingrate = 0.3
0.39/0.44 c
0.39/0.44 c # number of nodes added to the contingent of the total nodes
0.39/0.44 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.44 c heuristics/rens/nodesofs = 2000
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.44 c heuristics/rootsoldiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.44 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/rounding/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/shifting/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/simplerounding/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.44 c heuristics/trivial/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/trysol/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/veclendiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/zirounding/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.44 c separating/cmir/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.44 c separating/flowcover/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.44 c separating/rapidlearning/freq = 0
0.39/0.44 c
0.39/0.44 c -----------------------------------------------------------------------------------------------
0.39/0.44 c start solving
0.39/0.44 c
0.59/0.67 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.67 c 0.6s| 1 | 0 | 183 | - | 29M| 0 | 126 |6616 |6818 |6616 | 13k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.40/4.42 c 4.3s| 1 | 0 | 250 | - | 30M| 0 | 130 |6616 |6818 |6616 | 13k| 9 | 0 | 0 | 0.000000e+00 | -- | Inf
7.89/7.94 c 7.9s| 1 | 0 | 303 | - | 31M| 0 | 138 |6616 |6818 |6616 | 13k| 18 | 0 | 0 | 0.000000e+00 | -- | Inf
11.39/11.50 c 11.4s| 1 | 0 | 344 | - | 31M| 0 | 141 |6616 |6818 |6616 | 13k| 26 | 0 | 0 | 0.000000e+00 | -- | Inf
15.18/15.22 c 15.1s| 1 | 0 | 361 | - | 32M| 0 | 145 |6616 |6818 |6616 | 13k| 33 | 0 | 0 | 0.000000e+00 | -- | Inf
18.99/19.00 c 18.9s| 1 | 0 | 405 | - | 33M| 0 | 136 |6616 |6818 |6616 | 13k| 35 | 0 | 0 | 0.000000e+00 | -- | Inf
21.79/21.84 c 21.8s| 1 | 2 | 405 | - | 33M| 0 | 136 |6616 |6818 |6616 | 13k| 35 | 0 | 9 | 0.000000e+00 | -- | Inf
26.89/26.95 c *26.9s| 32 | 0 | 1532 | 36.4 | 35M| 29 | - |6616 |6820 |6616 | 897 | 297 | 2 | 329 | 0.000000e+00 | 0.000000e+00 | 0.00%
26.89/26.97 c
26.89/26.97 c SCIP Status : problem is solved [optimal solution found]
26.89/26.97 c Solving Time (sec) : 26.88
26.89/26.97 c Solving Nodes : 32
26.89/26.97 c Primal Bound : +0.00000000000000e+00 (1 solutions)
26.89/26.97 c Dual Bound : +0.00000000000000e+00
26.89/26.97 c Gap : 0.00 %
26.89/26.99 s SATISFIABLE
26.89/26.99 v -x318 -x373 -x308 -x277 -x395 -x322 -x320 -x391 -x235 -x280 -x358 -x292 -x250 -x361 -x312 x260 -x388 -x370 -x330 -x315 -x371 x313
26.89/26.99 v -x223 -x364 -x359 -x383 -x339 -x264 -x301 -x208 -x374 -x365 -x245 -x210 -x287 -x367 -x240 -x251 -x380 -x331 -x281 -x270 -x218
26.89/26.99 v -x352 -x326 -x257 -x234 -x344 x333 -x311 -x397 -x262 -x213 x379 -x385 -x389 -x232 x290 x336 -x355 -x214 -x228 -x246 -x302
26.89/26.99 v -x271 -x252 -x205 -x342 -x329 -x293 -x276 -x268 -x233 -x216 -x211 -x345 -x244 -x335 -x231 -x382 -x381 -x384 -x304 -x328 -x275
26.89/26.99 v -x217 -x222 -x204 -x366 -x363 -x310 -x306 -x300 -x297 -x266 -x256 -x247 -x299 -x354 -x230 -x206 -x346 -x227 -x398 -x314 -x392
26.89/26.99 v -x327 -x307 -x267 -x254 -x317 -x356 -x350 -x285 -x284 -x258 -x229 -x243 -x212 -x324 -x351 -x224 -x309 -x334 -x278 -x368 -x372
26.89/26.99 v -x272 -x236 -x305 -x387 x237 -x298 -x249 -x238 -x378 -x360 -x263 -x253 x219 -x209 -x225 -x390 -x400 -x283 -x323 -x348 -x289
26.89/26.99 v x288 -x295 -x291 -x279 -x362 x207 -x375 -x215 -x255 -x399 -x269 x201 -x396 -x393 -x357 -x353 -x349 -x337 -x332 -x321 -x319
26.89/26.99 v -x303 -x294 x282 x261 -x221 -x220 -x338 -x286 x248 -x274 -x239 -x343 -x316 -x296 -x376 -x242 -x203 -x340 -x394 -x325 -x259 -x265
26.89/26.99 v -x202 -x377 -x273 -x341 x226 -x241 -x369 -x386 -x347 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
26.89/26.99 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169
26.89/26.99 v -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
26.89/26.99 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
26.89/26.99 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
26.89/26.99 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.89/26.99 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
26.89/26.99 v -x56 -x55 -x54 x53 x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 x42 -x41 -x40 -x39 x38 -x37 -x36 -x35 -x34 -x33 -x32
26.89/26.99 v 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 -x6 x5 x4 -x3
26.89/26.99 v -x2 -x1
26.89/26.99 c SCIP Status : problem is solved [optimal solution found]
26.89/26.99 c Solving Time : 26.88
26.89/26.99 c Original Problem :
26.89/26.99 c Problem name : HOME/instance-2702924-1278576741.opb
26.89/26.99 c Variables : 6616 (6616 binary, 0 integer, 0 implicit integer, 0 continuous)
26.89/26.99 c Constraints : 6818 initial, 6818 maximal
26.89/26.99 c Presolved Problem :
26.89/26.99 c Problem name : t_HOME/instance-2702924-1278576741.opb
26.89/26.99 c Variables : 6616 (6616 binary, 0 integer, 0 implicit integer, 0 continuous)
26.89/26.99 c Constraints : 6818 initial, 6820 maximal
26.89/26.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
26.89/26.99 c trivial : 0.00 0 0 0 0 0 0 0 0
26.89/26.99 c dualfix : 0.00 0 0 0 0 0 0 0 0
26.89/26.99 c boundshift : 0.00 0 0 0 0 0 0 0 0
26.89/26.99 c inttobinary : 0.00 0 0 0 0 0 0 0 0
26.89/26.99 c implics : 0.00 0 0 0 0 0 0 0 0
26.89/26.99 c probing : 0.00 0 0 0 0 0 0 0 0
26.89/26.99 c knapsack : 0.01 0 0 0 0 0 0 0 0
26.89/26.99 c setppc : 0.01 0 0 0 0 0 0 0 0
26.89/26.99 c and : 0.18 0 0 0 0 0 0 0 0
26.89/26.99 c linear : 0.05 0 0 0 0 0 0 0 0
26.89/26.99 c logicor : 0.00 0 0 0 0 0 0 0 0
26.89/26.99 c root node : - 0 - - 0 - - - -
26.89/26.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
26.89/26.99 c integral : 0 0 0 40 0 0 7 0 0 58
26.89/26.99 c knapsack : 1 5 99 6 0 0 0 0 0 0
26.89/26.99 c setppc : 600 5 99 6 0 2 306 0 0 0
26.89/26.99 c and : 6216 34 97 6 0 0 6013 264 0 0
26.89/26.99 c linear : 1 5 97 1 0 0 0 0 0 0
26.89/26.99 c logicor : 0+ 0 2 0 0 0 2 0 0 0
26.89/26.99 c countsols : 0 0 0 1 0 0 0 0 0 0
26.89/26.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
26.89/26.99 c integral : 6.96 0.00 0.00 6.96 0.00
26.89/26.99 c knapsack : 0.05 0.05 0.00 0.00 0.00
26.89/26.99 c setppc : 0.01 0.00 0.00 0.00 0.00
26.89/26.99 c and : 0.12 0.08 0.04 0.00 0.00
26.89/26.99 c linear : 0.01 0.00 0.01 0.00 0.00
26.89/26.99 c logicor : 0.00 0.00 0.00 0.00 0.00
26.89/26.99 c countsols : 0.00 0.00 0.00 0.00 0.00
26.89/26.99 c Propagators : Time Calls Cutoffs DomReds
26.89/26.99 c vbounds : 0.00 1 0 0
26.89/26.99 c rootredcost : 0.00 0 0 0
26.89/26.99 c pseudoobj : 0.00 0 0 0
26.89/26.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
26.89/26.99 c propagation : 0.00 2 2 2 3.0 0 0.0 -
26.89/26.99 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
26.89/26.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
26.89/26.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
26.89/26.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
26.89/26.99 c applied globally : - - - 2 3.0 - - -
26.89/26.99 c applied locally : - - - 0 0.0 - - -
26.89/26.99 c Separators : Time Calls Cutoffs DomReds Cuts Conss
26.89/26.99 c cut pool : 0.00 4 - - 25 - (maximal pool size: 396)
26.89/26.99 c redcost : 0.03 34 0 0 0 0
26.89/26.99 c impliedbounds : 0.01 5 0 0 4 0
26.89/26.99 c intobj : 0.00 0 0 0 0 0
26.89/26.99 c cgmip : 0.00 0 0 0 0 0
26.89/26.99 c gomory : 14.53 5 0 0 500 0
26.89/26.99 c strongcg : 2.10 5 0 0 2500 0
26.89/26.99 c cmir : 0.00 0 0 0 0 0
26.89/26.99 c flowcover : 0.00 0 0 0 0 0
26.89/26.99 c clique : 0.06 5 0 0 25 0
26.89/26.99 c zerohalf : 0.00 0 0 0 0 0
26.89/26.99 c mcf : 0.37 2 0 0 0 0
26.89/26.99 c rapidlearning : 0.90 1 0 0 0 0
26.89/26.99 c Pricers : Time Calls Vars
26.89/26.99 c problem variables: 0.00 0 0
26.89/26.99 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
26.89/26.99 c relpscost : 6.96 34 0 7 0 0 58
26.89/26.99 c pscost : 0.00 0 0 0 0 0 0
26.89/26.99 c inference : 0.00 0 0 0 0 0 0
26.89/26.99 c mostinf : 0.00 0 0 0 0 0 0
26.89/26.99 c leastinf : 0.00 0 0 0 0 0 0
26.89/26.99 c fullstrong : 0.00 0 0 0 0 0 0
26.89/26.99 c allfullstrong : 0.00 0 0 0 0 0 0
26.89/26.99 c random : 0.00 0 0 0 0 0 0
26.89/26.99 c Primal Heuristics : Time Calls Found
26.89/26.99 c LP solutions : 0.00 - 1
26.89/26.99 c pseudo solutions : 0.00 - 0
26.89/26.99 c trivial : 0.01 1 0
26.89/26.99 c simplerounding : 0.00 0 0
26.89/26.99 c zirounding : 0.00 0 0
26.89/26.99 c rounding : 0.00 0 0
26.89/26.99 c shifting : 0.00 0 0
26.89/26.99 c intshifting : 0.00 0 0
26.89/26.99 c oneopt : 0.00 0 0
26.89/26.99 c twoopt : 0.00 0 0
26.89/26.99 c fixandinfer : 0.00 0 0
26.89/26.99 c feaspump : 0.00 0 0
26.89/26.99 c coefdiving : 0.00 0 0
26.89/26.99 c pscostdiving : 0.00 0 0
26.89/26.99 c fracdiving : 0.00 0 0
26.89/26.99 c veclendiving : 0.00 0 0
26.89/26.99 c intdiving : 0.00 0 0
26.89/26.99 c actconsdiving : 0.00 0 0
26.89/26.99 c objpscostdiving : 0.00 0 0
26.89/26.99 c rootsoldiving : 0.00 0 0
26.89/26.99 c linesearchdiving : 0.00 0 0
26.89/26.99 c guideddiving : 0.00 0 0
26.89/26.99 c octane : 0.00 0 0
26.89/26.99 c rens : 0.00 0 0
26.89/26.99 c rins : 0.00 0 0
26.89/26.99 c localbranching : 0.00 0 0
26.89/26.99 c mutation : 0.00 0 0
26.89/26.99 c crossover : 0.00 0 0
26.89/26.99 c dins : 0.00 0 0
26.89/26.99 c undercover : 0.00 0 0
26.89/26.99 c nlp : 0.00 0 0
26.89/26.99 c trysol : 0.00 0 0
26.89/26.99 c LP : Time Calls Iterations Iter/call Iter/sec
26.89/26.99 c primal LP : 0.04 0 0 0.00 0.00
26.89/26.99 c dual LP : 0.91 74 1532 20.70 1679.84
26.89/26.99 c lex dual LP : 0.00 0 0 0.00 -
26.89/26.99 c barrier LP : 0.00 0 0 0.00 -
26.89/26.99 c diving/probing LP: 0.00 0 0 0.00 -
26.89/26.99 c strong branching : 6.96 329 12611 38.33 1812.46
26.89/26.99 c (at root node) : - 9 1783 198.11 -
26.89/26.99 c conflict analysis: 0.00 0 0 0.00 -
26.89/26.99 c B&B Tree :
26.89/26.99 c number of runs : 1
26.89/26.99 c nodes : 32
26.89/26.99 c nodes (total) : 32
26.89/26.99 c nodes left : 0
26.89/26.99 c max depth : 29
26.89/26.99 c max depth (total): 29
26.89/26.99 c backtracks : 0 (0.0%)
26.89/26.99 c delayed cutoffs : 0
26.89/26.99 c repropagations : 18 (45 domain reductions, 0 cutoffs)
26.89/26.99 c avg switch length: 3.00
26.89/26.99 c switching time : 0.10
26.89/26.99 c Solution :
26.89/26.99 c Solutions found : 1 (1 improvements)
26.89/26.99 c First Solution : +0.00000000000000e+00 (in run 1, after 32 nodes, 26.87 seconds, depth 29, found by <relaxation>)
26.89/26.99 c Primal Bound : +0.00000000000000e+00 (in run 1, after 32 nodes, 26.87 seconds, depth 29, found by <relaxation>)
26.89/26.99 c Dual Bound : +0.00000000000000e+00
26.89/26.99 c Gap : 0.00 %
26.89/26.99 c Root Dual Bound : +0.00000000000000e+00
26.89/26.99 c Root Iterations : 405
26.99/27.08 c Time complete: 27.07.