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-2666355-1276683756.opb>
0.09/0.10 c original problem has 6616 variables (6616 bin, 0 int, 0 impl, 0 cont) and 6818 constraints
0.09/0.10 c problem read
0.09/0.10 c No objective function, only one solution is needed.
0.09/0.10 c presolving settings loaded
0.09/0.18 c presolving:
0.39/0.48 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.69/0.71 c presolving (2 rounds):
0.69/0.71 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.69/0.71 c 50128 implications, 400 cliques
0.69/0.71 c presolved problem has 6616 variables (6616 bin, 0 int, 0 impl, 0 cont) and 6818 constraints
0.69/0.71 c 1 constraints of type <knapsack>
0.69/0.71 c 400 constraints of type <setppc>
0.69/0.71 c 6216 constraints of type <and>
0.69/0.71 c 1 constraints of type <linear>
0.69/0.71 c 200 constraints of type <logicor>
0.69/0.71 c transformed objective value is always integral (scale: 1)
0.69/0.71 c Presolving Time: 0.38
0.69/0.71 c - non default parameters ----------------------------------------------------------------------
0.69/0.71 c # SCIP version 1.2.1.2
0.69/0.71 c
0.69/0.71 c # frequency for displaying node information lines
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 100]
0.69/0.71 c display/freq = 10000
0.69/0.71 c
0.69/0.71 c # maximal time in seconds to run
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.71 c limits/time = 1799.91
0.69/0.71 c
0.69/0.71 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.71 c limits/memory = 1620
0.69/0.71 c
0.69/0.71 c # solving stops, if the given number of solutions were found (-1: no limit)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.71 c limits/solutions = 1
0.69/0.71 c
0.69/0.71 c # maximal number of separation rounds per node (-1: unlimited)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 5]
0.69/0.71 c separating/maxrounds = 1
0.69/0.71 c
0.69/0.71 c # maximal number of separation rounds in the root node (-1: unlimited)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.71 c separating/maxroundsroot = 5
0.69/0.71 c
0.69/0.71 c # should presolving try to simplify inequalities
0.69/0.71 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.71 c constraints/linear/simplifyinequalities = TRUE
0.69/0.71 c
0.69/0.71 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.69/0.71 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.69/0.71 c constraints/knapsack/disaggregation = FALSE
0.69/0.71 c
0.69/0.71 c # should presolving try to simplify knapsacks
0.69/0.71 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.71 c constraints/knapsack/simplifyinequalities = TRUE
0.69/0.71 c
0.69/0.71 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.71 c presolving/probing/maxrounds = 0
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/coefdiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/coefdiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/coefdiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 30]
0.69/0.71 c heuristics/crossover/freq = -1
0.69/0.71 c
0.69/0.71 c # number of nodes added to the contingent of the total nodes
0.69/0.71 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.71 c heuristics/crossover/nodesofs = 750
0.69/0.71 c
0.69/0.71 c # number of nodes without incumbent change that heuristic should wait
0.69/0.71 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.69/0.71 c heuristics/crossover/nwaitingnodes = 100
0.69/0.71 c
0.69/0.71 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.69/0.71 c # [type: real, range: [0,1], default: 0.1]
0.69/0.71 c heuristics/crossover/nodesquot = 0.15
0.69/0.71 c
0.69/0.71 c # minimum percentage of integer variables that have to be fixed
0.69/0.71 c # [type: real, range: [0,1], default: 0.666]
0.69/0.71 c heuristics/crossover/minfixingrate = 0.5
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.71 c heuristics/feaspump/freq = -1
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/feaspump/maxlpiterofs = 2000
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/fracdiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/fracdiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/fracdiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/guideddiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/guideddiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/guideddiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/intdiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/intshifting/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/linesearchdiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/nlp/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.71 c heuristics/objpscostdiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.71 c # [type: real, range: [0,1], default: 0.01]
0.69/0.71 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/oneopt/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/pscostdiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/pscostdiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.71 c heuristics/rens/freq = -1
0.69/0.71 c
0.69/0.71 c # minimum percentage of integer variables that have to be fixable
0.69/0.71 c # [type: real, range: [0,1], default: 0.5]
0.69/0.71 c heuristics/rens/minfixingrate = 0.3
0.69/0.71 c
0.69/0.71 c # number of nodes added to the contingent of the total nodes
0.69/0.71 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.71 c heuristics/rens/nodesofs = 2000
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.71 c heuristics/rootsoldiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.71 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/rounding/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/shifting/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/simplerounding/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.71 c heuristics/trivial/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/trysol/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.71 c heuristics/veclendiving/freq = -1
0.69/0.71 c
0.69/0.71 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.71 c heuristics/veclendiving/maxlpiterquot = 0.075
0.69/0.71 c
0.69/0.71 c # additional number of allowed LP iterations
0.69/0.71 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.71 c heuristics/veclendiving/maxlpiterofs = 1500
0.69/0.71 c
0.69/0.71 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.71 c heuristics/zirounding/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.71 c separating/cmir/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.71 c separating/flowcover/freq = -1
0.69/0.71 c
0.69/0.71 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.69/0.71 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.71 c separating/rapidlearning/freq = 0
0.69/0.71 c
0.69/0.71 c -----------------------------------------------------------------------------------------------
0.69/0.71 c start solving
0.69/0.71 c
0.89/0.95 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.95 c 0.6s| 1 | 0 | 202 | - | 30M| 0 | 118 |6616 |6818 |6616 | 13k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.59/4.62 c 4.0s| 1 | 0 | 251 | - | 30M| 0 | 129 |6616 |6818 |6616 | 13k| 11 | 0 | 0 | 0.000000e+00 | -- | Inf
7.98/8.03 c 7.4s| 1 | 0 | 283 | - | 31M| 0 | 132 |6616 |6818 |6616 | 13k| 19 | 0 | 0 | 0.000000e+00 | -- | Inf
11.28/11.34 c 10.7s| 1 | 0 | 320 | - | 31M| 0 | 144 |6616 |6818 |6616 | 13k| 27 | 0 | 0 | 0.000000e+00 | -- | Inf
14.98/15.06 c 14.4s| 1 | 0 | 336 | - | 32M| 0 | 149 |6616 |6818 |6616 | 13k| 35 | 0 | 0 | 0.000000e+00 | -- | Inf
18.88/18.90 c 18.2s| 1 | 0 | 369 | - | 33M| 0 | 151 |6616 |6818 |6616 | 13k| 42 | 0 | 0 | 0.000000e+00 | -- | Inf
20.89/20.93 c 20.2s| 1 | 2 | 369 | - | 33M| 0 | 151 |6616 |6818 |6616 | 13k| 42 | 0 | 9 | 0.000000e+00 | -- | Inf
26.39/26.46 c *25.7s| 30 | 0 | 1392 | 35.3 | 35M| 27 | - |6616 |6820 |6616 | 878 | 237 | 2 | 330 | 0.000000e+00 | 0.000000e+00 | 0.00%
26.39/26.48 c
26.39/26.48 c SCIP Status : problem is solved [optimal solution found]
26.39/26.48 c Solving Time (sec) : 25.70
26.39/26.48 c Solving Nodes : 30
26.39/26.48 c Primal Bound : +0.00000000000000e+00 (1 solutions)
26.39/26.48 c Dual Bound : +0.00000000000000e+00
26.39/26.48 c Gap : 0.00 %
26.39/26.49 s SATISFIABLE
26.39/26.49 v -x318 -x373 -x308 -x277 -x395 -x322 -x320 -x391 -x235 -x280 -x358 -x292 -x250 -x361 -x312 -x260 -x388 -x370 -x330 x315 -x371 -x313
26.39/26.49 v x223 -x364 -x359 -x383 -x339 -x264 -x301 -x208 -x374 -x365 -x245 -x210 -x287 -x367 -x240 -x251 -x380 -x331 -x281 -x270 -x218
26.39/26.49 v -x352 -x326 -x257 -x234 -x344 x333 -x311 -x397 -x262 -x213 -x379 -x385 -x389 -x232 -x290 -x336 -x355 -x214 -x228 -x246 -x302
26.39/26.49 v -x271 x252 -x205 -x342 -x329 -x293 -x276 -x268 -x233 -x216 -x211 -x345 -x244 -x335 -x231 -x382 -x381 -x384 -x304 -x328 -x275
26.39/26.49 v -x217 -x222 -x204 -x366 -x363 -x310 -x306 -x300 -x297 -x266 -x256 -x247 -x299 -x354 -x230 -x206 -x346 -x227 -x398 -x314 -x392
26.39/26.49 v -x327 -x307 -x267 -x254 -x317 -x356 -x350 x285 -x284 -x258 -x229 -x243 -x212 -x324 -x351 -x224 -x309 -x334 -x278 -x368 -x372
26.39/26.49 v -x272 -x236 -x305 -x387 -x237 -x298 x249 -x238 -x378 -x360 x263 -x253 -x219 -x209 -x225 -x390 -x400 -x283 -x323 -x348 -x289
26.39/26.49 v -x288 -x295 -x291 -x279 x362 -x207 -x375 -x215 -x255 -x399 -x269 -x201 -x396 -x393 x357 -x353 -x349 -x337 -x332 -x321 -x319
26.39/26.49 v -x303 -x294 -x282 x261 -x221 x220 -x338 -x286 -x248 -x274 -x239 -x343 x316 -x296 -x376 -x242 -x203 -x340 x394 -x325 -x259
26.39/26.49 v x265 -x202 -x377 -x273 -x341 -x226 -x241 -x369 x386 -x347 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
26.39/26.49 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169
26.39/26.49 v -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
26.39/26.49 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
26.39/26.49 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
26.39/26.49 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.39/26.49 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.39/26.49 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 x31
26.39/26.49 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 -x4 -x3
26.39/26.49 v -x2 -x1
26.39/26.49 c SCIP Status : problem is solved [optimal solution found]
26.39/26.49 c Solving Time : 25.70
26.39/26.49 c Original Problem :
26.39/26.49 c Problem name : HOME/instance-2666355-1276683756.opb
26.39/26.49 c Variables : 6616 (6616 binary, 0 integer, 0 implicit integer, 0 continuous)
26.39/26.49 c Constraints : 6818 initial, 6818 maximal
26.39/26.49 c Presolved Problem :
26.39/26.49 c Problem name : t_HOME/instance-2666355-1276683756.opb
26.39/26.49 c Variables : 6616 (6616 binary, 0 integer, 0 implicit integer, 0 continuous)
26.39/26.49 c Constraints : 6818 initial, 6820 maximal
26.39/26.49 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
26.39/26.49 c trivial : 0.00 0 0 0 0 0 0 0 0
26.39/26.49 c dualfix : 0.01 0 0 0 0 0 0 0 0
26.39/26.49 c boundshift : 0.00 0 0 0 0 0 0 0 0
26.39/26.49 c inttobinary : 0.00 0 0 0 0 0 0 0 0
26.39/26.49 c implics : 0.00 0 0 0 0 0 0 0 0
26.39/26.49 c probing : 0.00 0 0 0 0 0 0 0 0
26.39/26.49 c knapsack : 0.00 0 0 0 0 0 0 0 0
26.39/26.49 c setppc : 0.01 0 0 0 0 0 0 0 0
26.39/26.49 c and : 0.24 0 0 0 0 0 0 0 0
26.39/26.49 c linear : 0.05 0 0 0 0 0 0 0 0
26.39/26.49 c logicor : 0.00 0 0 0 0 0 0 0 0
26.39/26.49 c root node : - 0 - - 0 - - - -
26.39/26.49 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
26.39/26.49 c integral : 0 0 0 39 0 0 8 0 0 54
26.39/26.49 c knapsack : 1 5 105 6 0 0 0 0 0 0
26.39/26.49 c setppc : 400 5 105 6 0 2 271 0 0 0
26.39/26.49 c and : 6216 32 103 6 0 0 5763 198 0 0
26.39/26.49 c linear : 1 5 103 1 0 0 0 0 0 0
26.39/26.49 c logicor : 200+ 5 29 1 0 0 17 0 0 0
26.39/26.49 c countsols : 0 0 0 1 0 0 0 0 0 0
26.39/26.49 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
26.39/26.49 c integral : 6.54 0.00 0.00 6.54 0.00
26.39/26.49 c knapsack : 0.05 0.05 0.00 0.00 0.00
26.39/26.49 c setppc : 0.02 0.00 0.02 0.00 0.00
26.39/26.49 c and : 0.15 0.13 0.02 0.00 0.00
26.39/26.49 c linear : 0.00 0.00 0.00 0.00 0.00
26.39/26.49 c logicor : 0.01 0.00 0.01 0.00 0.00
26.39/26.49 c countsols : 0.00 0.00 0.00 0.00 0.00
26.39/26.49 c Propagators : Time Calls Cutoffs DomReds
26.39/26.49 c vbounds : 0.00 1 0 0
26.39/26.49 c rootredcost : 0.00 0 0 0
26.39/26.49 c pseudoobj : 0.00 0 0 0
26.39/26.49 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
26.39/26.49 c propagation : 0.01 2 2 2 3.0 0 0.0 -
26.39/26.49 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
26.39/26.49 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
26.39/26.49 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
26.39/26.49 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
26.39/26.49 c applied globally : - - - 2 3.0 - - -
26.39/26.49 c applied locally : - - - 0 0.0 - - -
26.39/26.49 c Separators : Time Calls Cutoffs DomReds Cuts Conss
26.39/26.49 c cut pool : 0.00 4 - - 6 - (maximal pool size: 378)
26.39/26.49 c redcost : 0.00 32 0 0 0 0
26.39/26.49 c impliedbounds : 0.02 5 0 0 2 0
26.39/26.49 c intobj : 0.00 0 0 0 0 0
26.39/26.49 c cgmip : 0.00 0 0 0 0 0
26.39/26.49 c gomory : 13.72 5 0 0 0 0
26.39/26.49 c strongcg : 2.21 5 0 0 2500 0
26.39/26.49 c cmir : 0.00 0 0 0 0 0
26.39/26.49 c flowcover : 0.00 0 0 0 0 0
26.39/26.49 c clique : 0.07 5 0 0 31 0
26.39/26.49 c zerohalf : 0.00 0 0 0 0 0
26.39/26.49 c mcf : 0.53 3 0 0 5 0
26.39/26.49 c rapidlearning : 0.71 1 0 0 0 0
26.39/26.49 c Pricers : Time Calls Vars
26.39/26.49 c problem variables: 0.00 0 0
26.39/26.49 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
26.39/26.49 c relpscost : 6.54 33 0 8 0 0 54
26.39/26.49 c pscost : 0.00 0 0 0 0 0 0
26.39/26.49 c inference : 0.00 0 0 0 0 0 0
26.39/26.49 c mostinf : 0.00 0 0 0 0 0 0
26.39/26.50 c leastinf : 0.00 0 0 0 0 0 0
26.39/26.50 c fullstrong : 0.00 0 0 0 0 0 0
26.39/26.50 c allfullstrong : 0.00 0 0 0 0 0 0
26.39/26.50 c random : 0.00 0 0 0 0 0 0
26.39/26.50 c Primal Heuristics : Time Calls Found
26.39/26.50 c LP solutions : 0.01 - 1
26.39/26.50 c pseudo solutions : 0.00 - 0
26.39/26.50 c trivial : 0.01 1 0
26.39/26.50 c simplerounding : 0.00 0 0
26.39/26.50 c zirounding : 0.00 0 0
26.39/26.50 c rounding : 0.00 0 0
26.39/26.50 c shifting : 0.00 0 0
26.39/26.50 c intshifting : 0.00 0 0
26.39/26.50 c oneopt : 0.00 0 0
26.39/26.50 c twoopt : 0.00 0 0
26.39/26.50 c fixandinfer : 0.00 0 0
26.39/26.50 c feaspump : 0.00 0 0
26.39/26.50 c coefdiving : 0.00 0 0
26.39/26.50 c pscostdiving : 0.00 0 0
26.39/26.50 c fracdiving : 0.00 0 0
26.39/26.50 c veclendiving : 0.00 0 0
26.39/26.50 c intdiving : 0.00 0 0
26.39/26.50 c actconsdiving : 0.00 0 0
26.39/26.50 c objpscostdiving : 0.00 0 0
26.39/26.50 c rootsoldiving : 0.00 0 0
26.39/26.50 c linesearchdiving : 0.00 0 0
26.39/26.50 c guideddiving : 0.00 0 0
26.39/26.50 c octane : 0.00 0 0
26.39/26.50 c rens : 0.00 0 0
26.39/26.50 c rins : 0.00 0 0
26.39/26.50 c localbranching : 0.00 0 0
26.39/26.50 c mutation : 0.00 0 0
26.39/26.50 c crossover : 0.00 0 0
26.39/26.50 c dins : 0.00 0 0
26.39/26.50 c undercover : 0.00 0 0
26.39/26.50 c nlp : 0.00 0 0
26.39/26.50 c trysol : 0.00 0 0
26.39/26.50 c LP : Time Calls Iterations Iter/call Iter/sec
26.39/26.50 c primal LP : 0.03 0 0 0.00 0.00
26.39/26.50 c dual LP : 0.88 71 1392 19.61 1581.82
26.39/26.50 c lex dual LP : 0.00 0 0 0.00 -
26.39/26.50 c barrier LP : 0.00 0 0 0.00 -
26.39/26.50 c diving/probing LP: 0.00 0 0 0.00 -
26.39/26.50 c strong branching : 6.51 330 12196 36.96 1873.43
26.39/26.50 c (at root node) : - 9 1220 135.56 -
26.39/26.50 c conflict analysis: 0.00 0 0 0.00 -
26.39/26.50 c B&B Tree :
26.39/26.50 c number of runs : 1
26.39/26.50 c nodes : 30
26.39/26.50 c nodes (total) : 30
26.39/26.50 c nodes left : 0
26.39/26.50 c max depth : 27
26.39/26.50 c max depth (total): 27
26.39/26.50 c backtracks : 0 (0.0%)
26.39/26.50 c delayed cutoffs : 0
26.39/26.50 c repropagations : 12 (44 domain reductions, 0 cutoffs)
26.39/26.50 c avg switch length: 2.67
26.39/26.50 c switching time : 0.07
26.39/26.50 c Solution :
26.39/26.50 c Solutions found : 1 (1 improvements)
26.39/26.50 c First Solution : +0.00000000000000e+00 (in run 1, after 30 nodes, 25.68 seconds, depth 27, found by <relaxation>)
26.39/26.50 c Primal Bound : +0.00000000000000e+00 (in run 1, after 30 nodes, 25.68 seconds, depth 27, found by <relaxation>)
26.39/26.50 c Dual Bound : +0.00000000000000e+00
26.39/26.50 c Gap : 0.00 %
26.39/26.50 c Root Dual Bound : +0.00000000000000e+00
26.39/26.50 c Root Iterations : 369
26.48/26.59 c Time complete: 26.57.