0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2664844-1276675819.opb>
0.00/0.08 c original problem has 6604 variables (6604 bin, 0 int, 0 impl, 0 cont) and 6806 constraints
0.00/0.08 c problem read
0.00/0.08 c No objective function, only one solution is needed.
0.00/0.08 c presolving settings loaded
0.09/0.17 c presolving:
0.39/0.46 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 50032 impls, 400 clqs
0.59/0.69 c presolving (2 rounds):
0.59/0.69 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.59/0.69 c 50032 implications, 400 cliques
0.59/0.69 c presolved problem has 6604 variables (6604 bin, 0 int, 0 impl, 0 cont) and 6806 constraints
0.59/0.69 c 1 constraints of type <knapsack>
0.59/0.69 c 400 constraints of type <setppc>
0.59/0.69 c 6204 constraints of type <and>
0.59/0.69 c 1 constraints of type <linear>
0.59/0.69 c 200 constraints of type <logicor>
0.59/0.69 c transformed objective value is always integral (scale: 1)
0.59/0.69 c Presolving Time: 0.36
0.59/0.69 c - non default parameters ----------------------------------------------------------------------
0.59/0.69 c # SCIP version 1.2.1.2
0.59/0.69 c
0.59/0.69 c # frequency for displaying node information lines
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 100]
0.59/0.69 c display/freq = 10000
0.59/0.69 c
0.59/0.69 c # maximal time in seconds to run
0.59/0.69 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.69 c limits/time = 1799.92
0.59/0.69 c
0.59/0.69 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.69 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.69 c limits/memory = 1620
0.59/0.69 c
0.59/0.69 c # solving stops, if the given number of solutions were found (-1: no limit)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.69 c limits/solutions = 1
0.59/0.69 c
0.59/0.69 c # maximal number of separation rounds per node (-1: unlimited)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 5]
0.59/0.69 c separating/maxrounds = 1
0.59/0.69 c
0.59/0.69 c # maximal number of separation rounds in the root node (-1: unlimited)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.69 c separating/maxroundsroot = 5
0.59/0.69 c
0.59/0.69 c # should presolving try to simplify inequalities
0.59/0.69 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.69 c constraints/linear/simplifyinequalities = TRUE
0.59/0.69 c
0.59/0.69 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.59/0.69 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.59/0.69 c constraints/knapsack/disaggregation = FALSE
0.59/0.69 c
0.59/0.69 c # should presolving try to simplify knapsacks
0.59/0.69 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.69 c constraints/knapsack/simplifyinequalities = TRUE
0.59/0.69 c
0.59/0.69 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.69 c presolving/probing/maxrounds = 0
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.69 c heuristics/coefdiving/freq = -1
0.59/0.69 c
0.59/0.69 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.69 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.69 c heuristics/coefdiving/maxlpiterquot = 0.075
0.59/0.69 c
0.59/0.69 c # additional number of allowed LP iterations
0.59/0.69 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.69 c heuristics/coefdiving/maxlpiterofs = 1500
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 30]
0.59/0.69 c heuristics/crossover/freq = -1
0.59/0.69 c
0.59/0.69 c # number of nodes added to the contingent of the total nodes
0.59/0.69 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.69 c heuristics/crossover/nodesofs = 750
0.59/0.69 c
0.59/0.69 c # number of nodes without incumbent change that heuristic should wait
0.59/0.69 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.59/0.69 c heuristics/crossover/nwaitingnodes = 100
0.59/0.69 c
0.59/0.69 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.59/0.69 c # [type: real, range: [0,1], default: 0.1]
0.59/0.69 c heuristics/crossover/nodesquot = 0.15
0.59/0.69 c
0.59/0.69 c # minimum percentage of integer variables that have to be fixed
0.59/0.69 c # [type: real, range: [0,1], default: 0.666]
0.59/0.69 c heuristics/crossover/minfixingrate = 0.5
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.69 c heuristics/feaspump/freq = -1
0.59/0.69 c
0.59/0.69 c # additional number of allowed LP iterations
0.59/0.69 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.69 c heuristics/feaspump/maxlpiterofs = 2000
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.69 c heuristics/fracdiving/freq = -1
0.59/0.69 c
0.59/0.69 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.69 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.69 c heuristics/fracdiving/maxlpiterquot = 0.075
0.59/0.69 c
0.59/0.69 c # additional number of allowed LP iterations
0.59/0.69 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.69 c heuristics/fracdiving/maxlpiterofs = 1500
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.69 c heuristics/guideddiving/freq = -1
0.59/0.69 c
0.59/0.69 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.69 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.69 c heuristics/guideddiving/maxlpiterquot = 0.075
0.59/0.69 c
0.59/0.69 c # additional number of allowed LP iterations
0.59/0.69 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.69 c heuristics/guideddiving/maxlpiterofs = 1500
0.59/0.69 c
0.59/0.69 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.69 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.69 c heuristics/intdiving/maxlpiterquot = 0.075
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.69 c heuristics/intshifting/freq = -1
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.69 c heuristics/linesearchdiving/freq = -1
0.59/0.69 c
0.59/0.69 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.69 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.69 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.59/0.69 c
0.59/0.69 c # additional number of allowed LP iterations
0.59/0.69 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.69 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.69 c heuristics/nlp/freq = -1
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.69 c heuristics/objpscostdiving/freq = -1
0.59/0.69 c
0.59/0.69 c # maximal fraction of diving LP iterations compared to total iteration number
0.59/0.69 c # [type: real, range: [0,1], default: 0.01]
0.59/0.69 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.59/0.69 c
0.59/0.69 c # additional number of allowed LP iterations
0.59/0.69 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.69 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.69 c heuristics/oneopt/freq = -1
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.69 c heuristics/pscostdiving/freq = -1
0.59/0.69 c
0.59/0.69 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.69 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.69 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.59/0.69 c
0.59/0.69 c # additional number of allowed LP iterations
0.59/0.69 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.69 c heuristics/pscostdiving/maxlpiterofs = 1500
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.69 c heuristics/rens/freq = -1
0.59/0.69 c
0.59/0.69 c # minimum percentage of integer variables that have to be fixable
0.59/0.69 c # [type: real, range: [0,1], default: 0.5]
0.59/0.69 c heuristics/rens/minfixingrate = 0.3
0.59/0.69 c
0.59/0.69 c # number of nodes added to the contingent of the total nodes
0.59/0.69 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.69 c heuristics/rens/nodesofs = 2000
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.69 c heuristics/rootsoldiving/freq = -1
0.59/0.69 c
0.59/0.69 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.69 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.59/0.69 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.59/0.69 c
0.59/0.69 c # additional number of allowed LP iterations
0.59/0.69 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.69 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.69 c heuristics/rounding/freq = -1
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.69 c heuristics/shifting/freq = -1
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.69 c heuristics/simplerounding/freq = -1
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.69 c heuristics/trivial/freq = -1
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.69 c heuristics/trysol/freq = -1
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.69 c heuristics/veclendiving/freq = -1
0.59/0.69 c
0.59/0.69 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.69 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.69 c heuristics/veclendiving/maxlpiterquot = 0.075
0.59/0.69 c
0.59/0.69 c # additional number of allowed LP iterations
0.59/0.69 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.69 c heuristics/veclendiving/maxlpiterofs = 1500
0.59/0.69 c
0.59/0.69 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.69 c heuristics/zirounding/freq = -1
0.59/0.69 c
0.59/0.69 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.69 c separating/cmir/freq = -1
0.59/0.69 c
0.59/0.69 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.69 c separating/flowcover/freq = -1
0.59/0.69 c
0.59/0.69 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.59/0.69 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.69 c separating/rapidlearning/freq = 0
0.59/0.69 c
0.59/0.69 c -----------------------------------------------------------------------------------------------
0.59/0.69 c start solving
0.69/0.70 c
0.79/0.85 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.85 c 0.5s| 1 | 0 | 124 | - | 29M| 0 | 87 |6604 |6806 |6604 | 13k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.19/3.25 c 2.6s| 1 | 0 | 156 | - | 30M| 0 | 91 |6604 |6806 |6604 | 13k| 8 | 0 | 0 | 0.000000e+00 | -- | Inf
4.69/4.71 c 4.1s| 1 | 0 | 186 | - | 30M| 0 | 91 |6604 |6806 |6604 | 13k| 14 | 0 | 0 | 0.000000e+00 | -- | Inf
6.49/6.56 c 5.9s| 1 | 0 | 219 | - | 31M| 0 | 94 |6604 |6806 |6604 | 13k| 20 | 0 | 0 | 0.000000e+00 | -- | Inf
8.29/8.33 c 7.7s| 1 | 0 | 266 | - | 32M| 0 | 94 |6604 |6806 |6604 | 13k| 28 | 0 | 0 | 0.000000e+00 | -- | Inf
10.19/10.27 c 9.6s| 1 | 0 | 299 | - | 32M| 0 | 100 |6604 |6806 |6604 | 13k| 32 | 0 | 0 | 0.000000e+00 | -- | Inf
12.10/12.18 c 11.4s| 1 | 2 | 299 | - | 32M| 0 | 100 |6604 |6806 |6604 | 13k| 32 | 0 | 13 | 0.000000e+00 | -- | Inf
15.39/15.47 c *14.7s| 26 | 0 | 1077 | 31.1 | 34M| 25 | - |6604 |6806 |6604 | 800 | 449 | 0 | 278 | 0.000000e+00 | 0.000000e+00 | 0.00%
15.39/15.48 c
15.39/15.48 c SCIP Status : problem is solved [optimal solution found]
15.39/15.48 c Solving Time (sec) : 14.71
15.39/15.48 c Solving Nodes : 26
15.39/15.48 c Primal Bound : +0.00000000000000e+00 (1 solutions)
15.39/15.48 c Dual Bound : +0.00000000000000e+00
15.39/15.48 c Gap : 0.00 %
15.39/15.50 s SATISFIABLE
15.39/15.50 v -x375 x317 x361 -x286 -x342 -x224 -x249 x359 -x390 -x297 -x299 -x251 -x256 -x319 x273 x231 -x360 -x348 -x240 -x382 -x334 -x332
15.39/15.50 v -x269 -x237 -x362 x217 -x321 -x349 -x278 -x239 -x398 -x265 x343 -x391 -x300 -x264 -x370 -x339 -x377 -x207 -x392 -x353 -x234 -x238
15.39/15.50 v -x352 -x233 -x388 -x315 -x229 -x356 -x322 -x206 -x395 -x380 -x345 -x289 x221 -x246 -x219 -x350 -x309 -x304 -x272 -x329 -x225
15.39/15.50 v -x284 -x366 -x354 -x335 -x312 -x208 -x276 -x372 -x232 -x220 -x245 -x290 -x242 -x253 -x318 -x303 -x298 -x204 -x344 -x310
15.39/15.50 v -x267 -x266 -x255 -x236 -x396 -x295 -x213 -x340 -x261 -x333 -x400 x355 -x252 -x389 -x277 x209 -x288 -x351 -x244 -x365 -x386 -x367
15.39/15.50 v x347 -x323 -x294 -x271 -x254 -x248 -x226 -x218 -x216 -x215 -x346 -x258 -x314 -x247 -x328 -x326 -x306 -x282 x397 -x274 -x357
15.39/15.50 v -x381 -x292 -x214 -x202 -x307 -x305 -x302 -x301 -x296 -x279 -x210 -x205 -x371 -x325 -x399 -x338 -x385 -x320 -x374 -x243 -x257
15.39/15.50 v -x270 -x259 -x223 x203 -x330 -x268 x324 x263 -x331 -x201 -x393 -x379 -x376 -x358 -x313 -x311 -x308 -x285 -x283 -x281 -x280
15.39/15.50 v -x275 -x262 -x241 -x235 -x211 -x383 -x230 -x368 -x369 -x212 -x337 -x373 -x227 -x341 -x327 -x364 -x260 -x291 -x228 -x363 -x222
15.39/15.50 v -x250 -x293 -x387 -x336 -x394 -x316 -x378 -x287 -x384 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
15.39/15.50 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 x172 -x171 -x170 -x169 -x168
15.39/15.50 v -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
15.39/15.50 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
15.39/15.50 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
15.39/15.50 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
15.39/15.50 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
15.39/15.50 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
15.39/15.50 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
15.39/15.50 v -x2 x1
15.39/15.50 c SCIP Status : problem is solved [optimal solution found]
15.39/15.50 c Solving Time : 14.71
15.39/15.50 c Original Problem :
15.39/15.50 c Problem name : HOME/instance-2664844-1276675819.opb
15.39/15.50 c Variables : 6604 (6604 binary, 0 integer, 0 implicit integer, 0 continuous)
15.39/15.50 c Constraints : 6806 initial, 6806 maximal
15.39/15.50 c Presolved Problem :
15.39/15.50 c Problem name : t_HOME/instance-2664844-1276675819.opb
15.39/15.50 c Variables : 6604 (6604 binary, 0 integer, 0 implicit integer, 0 continuous)
15.39/15.50 c Constraints : 6806 initial, 6806 maximal
15.39/15.50 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
15.39/15.50 c trivial : 0.00 0 0 0 0 0 0 0 0
15.39/15.50 c dualfix : 0.01 0 0 0 0 0 0 0 0
15.39/15.50 c boundshift : 0.00 0 0 0 0 0 0 0 0
15.39/15.50 c inttobinary : 0.00 0 0 0 0 0 0 0 0
15.39/15.50 c implics : 0.01 0 0 0 0 0 0 0 0
15.39/15.50 c probing : 0.00 0 0 0 0 0 0 0 0
15.39/15.50 c knapsack : 0.00 0 0 0 0 0 0 0 0
15.39/15.50 c setppc : 0.01 0 0 0 0 0 0 0 0
15.39/15.50 c and : 0.23 0 0 0 0 0 0 0 0
15.39/15.50 c linear : 0.05 0 0 0 0 0 0 0 0
15.39/15.50 c logicor : 0.00 0 0 0 0 0 0 0 0
15.39/15.50 c root node : - 0 - - 0 - - - -
15.39/15.50 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
15.39/15.50 c integral : 0 0 0 39 0 0 10 0 0 50
15.39/15.50 c knapsack : 1 5 82 6 0 0 0 0 0 0
15.39/15.50 c setppc : 400 5 82 6 0 0 233 0 0 0
15.39/15.50 c and : 6204 30 82 6 0 0 5597 418 0 0
15.39/15.50 c linear : 1 5 82 1 0 0 0 0 0 0
15.39/15.50 c logicor : 200 5 17 1 0 0 12 0 0 0
15.39/15.50 c countsols : 0 0 0 1 0 0 0 0 0 0
15.39/15.50 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
15.39/15.50 c integral : 3.72 0.00 0.00 3.72 0.00
15.39/15.50 c knapsack : 0.05 0.05 0.00 0.00 0.00
15.39/15.50 c setppc : 0.01 0.00 0.01 0.00 0.00
15.39/15.50 c and : 0.17 0.11 0.04 0.02 0.00
15.39/15.50 c linear : 0.01 0.00 0.01 0.00 0.00
15.39/15.50 c logicor : 0.00 0.00 0.00 0.00 0.00
15.39/15.50 c countsols : 0.00 0.00 0.00 0.00 0.00
15.39/15.50 c Propagators : Time Calls Cutoffs DomReds
15.39/15.50 c vbounds : 0.00 1 0 0
15.39/15.50 c rootredcost : 0.00 0 0 0
15.39/15.50 c pseudoobj : 0.00 0 0 0
15.39/15.50 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
15.39/15.50 c propagation : 0.00 0 0 0 0.0 0 0.0 -
15.39/15.50 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
15.39/15.50 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
15.39/15.50 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
15.39/15.50 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
15.39/15.50 c applied globally : - - - 0 0.0 - - -
15.39/15.50 c applied locally : - - - 0 0.0 - - -
15.39/15.50 c Separators : Time Calls Cutoffs DomReds Cuts Conss
15.39/15.50 c cut pool : 0.01 4 - - 13 - (maximal pool size: 289)
15.39/15.50 c redcost : 0.03 30 0 0 0 0
15.39/15.50 c impliedbounds : 0.00 5 0 0 4 0
15.39/15.50 c intobj : 0.00 0 0 0 0 0
15.39/15.50 c cgmip : 0.00 0 0 0 0 0
15.39/15.50 c gomory : 6.42 5 0 0 4 0
15.39/15.50 c strongcg : 1.42 5 0 0 2500 0
15.39/15.50 c cmir : 0.00 0 0 0 0 0
15.39/15.50 c flowcover : 0.00 0 0 0 0 0
15.39/15.50 c clique : 0.04 5 0 0 23 0
15.39/15.50 c zerohalf : 0.00 0 0 0 0 0
15.39/15.50 c mcf : 0.29 2 0 0 0 0
15.39/15.50 c rapidlearning : 0.67 1 0 0 0 0
15.39/15.50 c Pricers : Time Calls Vars
15.39/15.50 c problem variables: 0.00 0 0
15.39/15.50 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
15.39/15.50 c relpscost : 3.72 33 0 10 0 0 50
15.39/15.50 c pscost : 0.00 0 0 0 0 0 0
15.39/15.50 c inference : 0.00 0 0 0 0 0 0
15.39/15.50 c mostinf : 0.00 0 0 0 0 0 0
15.39/15.50 c leastinf : 0.00 0 0 0 0 0 0
15.39/15.50 c fullstrong : 0.00 0 0 0 0 0 0
15.39/15.50 c allfullstrong : 0.00 0 0 0 0 0 0
15.39/15.50 c random : 0.00 0 0 0 0 0 0
15.39/15.50 c Primal Heuristics : Time Calls Found
15.39/15.50 c LP solutions : 0.01 - 1
15.39/15.50 c pseudo solutions : 0.00 - 0
15.39/15.50 c trivial : 0.02 1 0
15.39/15.50 c simplerounding : 0.00 0 0
15.39/15.50 c zirounding : 0.00 0 0
15.39/15.50 c rounding : 0.00 0 0
15.39/15.50 c shifting : 0.00 0 0
15.39/15.50 c intshifting : 0.00 0 0
15.39/15.50 c oneopt : 0.00 0 0
15.39/15.50 c twoopt : 0.00 0 0
15.39/15.50 c fixandinfer : 0.00 0 0
15.39/15.50 c feaspump : 0.00 0 0
15.39/15.50 c coefdiving : 0.00 0 0
15.39/15.50 c pscostdiving : 0.00 0 0
15.39/15.50 c fracdiving : 0.00 0 0
15.39/15.50 c veclendiving : 0.00 0 0
15.39/15.50 c intdiving : 0.00 0 0
15.39/15.50 c actconsdiving : 0.00 0 0
15.39/15.50 c objpscostdiving : 0.00 0 0
15.39/15.50 c rootsoldiving : 0.00 0 0
15.39/15.50 c linesearchdiving : 0.00 0 0
15.39/15.50 c guideddiving : 0.00 0 0
15.39/15.50 c octane : 0.00 0 0
15.39/15.50 c rens : 0.00 0 0
15.39/15.50 c rins : 0.00 0 0
15.39/15.50 c localbranching : 0.00 0 0
15.39/15.50 c mutation : 0.00 0 0
15.39/15.50 c crossover : 0.00 0 0
15.39/15.50 c dins : 0.00 0 0
15.39/15.50 c undercover : 0.00 0 0
15.39/15.50 c nlp : 0.00 0 0
15.39/15.50 c trysol : 0.00 0 0
15.39/15.50 c LP : Time Calls Iterations Iter/call Iter/sec
15.39/15.50 c primal LP : 0.29 0 0 0.00 0.00
15.39/15.50 c dual LP : 0.81 69 1077 15.61 1329.63
15.39/15.50 c lex dual LP : 0.00 0 0 0.00 -
15.39/15.50 c barrier LP : 0.00 0 0 0.00 -
15.39/15.50 c diving/probing LP: 0.00 0 0 0.00 -
15.39/15.50 c strong branching : 3.72 278 7604 27.35 2044.09
15.39/15.50 c (at root node) : - 13 1798 138.31 -
15.39/15.50 c conflict analysis: 0.00 0 0 0.00 -
15.39/15.50 c B&B Tree :
15.39/15.50 c number of runs : 1
15.39/15.50 c nodes : 26
15.39/15.50 c nodes (total) : 26
15.39/15.50 c nodes left : 0
15.39/15.50 c max depth : 25
15.39/15.50 c max depth (total): 25
15.39/15.50 c backtracks : 0 (0.0%)
15.39/15.50 c delayed cutoffs : 0
15.39/15.50 c repropagations : 0 (0 domain reductions, 0 cutoffs)
15.39/15.50 c avg switch length: 2.00
15.39/15.50 c switching time : 0.31
15.39/15.50 c Solution :
15.39/15.50 c Solutions found : 1 (1 improvements)
15.39/15.50 c First Solution : +0.00000000000000e+00 (in run 1, after 26 nodes, 14.69 seconds, depth 25, found by <relaxation>)
15.39/15.50 c Primal Bound : +0.00000000000000e+00 (in run 1, after 26 nodes, 14.69 seconds, depth 25, found by <relaxation>)
15.39/15.50 c Dual Bound : +0.00000000000000e+00
15.39/15.50 c Gap : 0.00 %
15.39/15.50 c Root Dual Bound : +0.00000000000000e+00
15.39/15.50 c Root Iterations : 299
15.49/15.60 c Time complete: 15.58.