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-2666336-1276681595.opb>
0.09/0.10 c original problem has 6620 variables (6620 bin, 0 int, 0 impl, 0 cont) and 6822 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, 50160 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 50160 implications, 400 cliques
0.69/0.71 c presolved problem has 6620 variables (6620 bin, 0 int, 0 impl, 0 cont) and 6822 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 6220 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.37
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.96 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.96 c 0.6s| 1 | 0 | 217 | - | 30M| 0 | 125 |6620 |6822 |6620 | 13k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.59/4.64 c 4.1s| 1 | 0 | 288 | - | 30M| 0 | 134 |6620 |6822 |6620 | 13k| 17 | 0 | 0 | 0.000000e+00 | -- | Inf
8.09/8.15 c 7.5s| 1 | 0 | 367 | - | 31M| 0 | 134 |6620 |6822 |6620 | 13k| 26 | 0 | 0 | 0.000000e+00 | -- | Inf
12.59/12.60 c 12.0s| 1 | 0 | 562 | - | 31M| 0 | 131 |6620 |6822 |6620 | 13k| 37 | 0 | 0 | 0.000000e+00 | -- | Inf
15.40/15.42 c 14.8s| 1 | 0 | 723 | - | 32M| 0 | 148 |6620 |6822 |6620 | 13k| 65 | 0 | 0 | 0.000000e+00 | -- | Inf
18.89/18.99 c 18.3s| 1 | 0 | 821 | - | 32M| 0 | 161 |6620 |6822 |6620 | 13k| 92 | 0 | 0 | 0.000000e+00 | -- | Inf
24.28/24.34 c 23.6s| 1 | 2 | 821 | - | 32M| 0 | 161 |6620 |6822 |6620 | 13k| 92 | 0 | 10 | 0.000000e+00 | -- | Inf
30.38/30.40 c *29.6s| 30 | 0 | 2183 | 47.0 | 34M| 29 | - |6620 |6822 |6620 |1066 | 419 | 0 | 367 | 0.000000e+00 | 0.000000e+00 | 0.00%
30.38/30.42 c
30.38/30.42 c SCIP Status : problem is solved [optimal solution found]
30.38/30.42 c Solving Time (sec) : 29.61
30.38/30.42 c Solving Nodes : 30
30.38/30.42 c Primal Bound : +0.00000000000000e+00 (1 solutions)
30.38/30.42 c Dual Bound : +0.00000000000000e+00
30.38/30.42 c Gap : 0.00 %
30.38/30.43 s SATISFIABLE
30.38/30.43 v -x384 -x335 -x334 -x301 -x233 -x289 -x295 -x375 -x290 -x325 -x256 -x237 -x247 -x396 -x328 -x388 -x312 -x215 -x394 -x226 -x313 -x377
30.38/30.43 v -x326 -x216 -x258 -x305 -x251 -x381 -x308 -x266 -x271 -x259 -x229 -x220 -x302 -x336 x354 -x207 -x364 -x338 -x286 -x248 -x230
30.38/30.43 v -x272 -x365 -x340 -x293 -x268 -x279 -x353 -x332 -x352 -x345 -x314 -x285 -x254 -x243 -x240 -x213 -x267 -x321 -x280 -x269
30.38/30.43 v -x372 -x323 -x303 -x270 x244 -x232 -x221 -x342 -x273 -x275 -x306 -x355 -x390 x235 -x284 x212 -x347 -x393 -x379 -x351 -x330 -x298
30.38/30.43 v -x288 -x281 -x222 -x210 -x300 -x219 -x319 -x309 -x282 -x224 -x252 -x304 -x385 -x395 -x348 -x333 -x296 -x242 -x236 -x227 -x225
30.38/30.43 v -x218 -x205 -x371 -x311 -x391 -x369 -x318 -x257 -x317 -x322 -x344 x363 -x206 -x349 -x324 -x310 -x361 -x367 -x400 -x246 -x202
30.38/30.43 v -x341 -x287 -x263 -x260 -x249 -x241 -x239 -x234 -x217 -x204 -x245 -x276 -x315 -x357 -x366 x261 -x307 -x329 -x358 -x398 -x274
30.38/30.43 v x378 -x253 -x397 -x362 -x383 -x387 -x214 x264 -x297 -x231 -x211 -x201 -x399 -x386 -x382 -x360 -x359 -x356 -x339 x337 -x327
30.38/30.43 v -x292 -x283 -x277 -x223 -x209 -x208 -x392 -x316 -x370 -x373 -x203 -x331 x368 x374 -x255 -x250 -x238 -x294 -x350 x380 -x343
30.38/30.43 v x228 -x346 -x278 -x265 x299 -x262 -x376 x389 -x320 -x291 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
30.38/30.43 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169
30.38/30.43 v -x168 -x167 -x166 -x165 -x164 -x163 x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148 -x147
30.38/30.43 v -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
30.38/30.43 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
30.38/30.43 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
30.38/30.43 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
30.38/30.43 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
30.38/30.43 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
30.38/30.43 v -x2 -x1
30.38/30.43 c SCIP Status : problem is solved [optimal solution found]
30.38/30.43 c Solving Time : 29.61
30.38/30.43 c Original Problem :
30.38/30.43 c Problem name : HOME/instance-2666336-1276681595.opb
30.38/30.43 c Variables : 6620 (6620 binary, 0 integer, 0 implicit integer, 0 continuous)
30.38/30.43 c Constraints : 6822 initial, 6822 maximal
30.38/30.43 c Presolved Problem :
30.38/30.43 c Problem name : t_HOME/instance-2666336-1276681595.opb
30.38/30.43 c Variables : 6620 (6620 binary, 0 integer, 0 implicit integer, 0 continuous)
30.38/30.43 c Constraints : 6822 initial, 6822 maximal
30.38/30.43 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
30.38/30.43 c trivial : 0.01 0 0 0 0 0 0 0 0
30.38/30.43 c dualfix : 0.00 0 0 0 0 0 0 0 0
30.38/30.43 c boundshift : 0.00 0 0 0 0 0 0 0 0
30.38/30.43 c inttobinary : 0.00 0 0 0 0 0 0 0 0
30.38/30.43 c implics : 0.00 0 0 0 0 0 0 0 0
30.38/30.43 c probing : 0.00 0 0 0 0 0 0 0 0
30.38/30.43 c knapsack : 0.00 0 0 0 0 0 0 0 0
30.38/30.43 c setppc : 0.01 0 0 0 0 0 0 0 0
30.38/30.43 c and : 0.25 0 0 0 0 0 0 0 0
30.38/30.43 c linear : 0.05 0 0 0 0 0 0 0 0
30.38/30.43 c logicor : 0.00 0 0 0 0 0 0 0 0
30.38/30.43 c root node : - 0 - - 0 - - - -
30.38/30.43 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
30.38/30.43 c integral : 0 0 0 38 0 0 11 0 0 58
30.38/30.43 c knapsack : 1 5 87 1 0 0 0 0 0 0
30.38/30.43 c setppc : 400 5 87 1 0 0 234 0 0 0
30.38/30.43 c and : 6220 34 87 1 0 0 5618 372 0 0
30.38/30.43 c linear : 1 5 87 1 0 0 0 0 0 0
30.38/30.43 c logicor : 200 5 20 1 0 0 13 0 0 0
30.38/30.43 c countsols : 0 0 0 1 0 0 0 0 0 0
30.38/30.43 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
30.38/30.43 c integral : 10.32 0.00 0.00 10.32 0.00
30.38/30.43 c knapsack : 0.05 0.05 0.00 0.00 0.00
30.38/30.43 c setppc : 0.01 0.01 0.00 0.00 0.00
30.38/30.43 c and : 0.11 0.09 0.02 0.00 0.00
30.38/30.43 c linear : 0.00 0.00 0.00 0.00 0.00
30.38/30.43 c logicor : 0.00 0.00 0.00 0.00 0.00
30.38/30.43 c countsols : 0.00 0.00 0.00 0.00 0.00
30.38/30.43 c Propagators : Time Calls Cutoffs DomReds
30.38/30.43 c vbounds : 0.00 1 0 0
30.38/30.43 c rootredcost : 0.00 0 0 0
30.38/30.43 c pseudoobj : 0.00 0 0 0
30.38/30.43 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
30.38/30.43 c propagation : 0.00 0 0 0 0.0 0 0.0 -
30.38/30.43 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
30.38/30.43 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
30.38/30.43 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
30.38/30.43 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
30.38/30.43 c applied globally : - - - 0 0.0 - - -
30.38/30.43 c applied locally : - - - 0 0.0 - - -
30.38/30.43 c Separators : Time Calls Cutoffs DomReds Cuts Conss
30.38/30.43 c cut pool : 0.00 4 - - 0 - (maximal pool size: 448)
30.38/30.43 c redcost : 0.02 34 0 0 0 0
30.38/30.43 c impliedbounds : 0.01 5 0 0 47 0
30.38/30.43 c intobj : 0.00 0 0 0 0 0
30.38/30.43 c cgmip : 0.00 0 0 0 0 0
30.38/30.43 c gomory : 12.72 5 0 0 503 0
30.38/30.43 c strongcg : 2.17 5 0 0 2500 0
30.38/30.43 c cmir : 0.00 0 0 0 0 0
30.38/30.43 c flowcover : 0.00 0 0 0 0 0
30.38/30.43 c clique : 0.05 5 0 0 31 0
30.38/30.43 c zerohalf : 0.00 0 0 0 0 0
30.38/30.43 c mcf : 0.86 5 0 0 71 0
30.38/30.43 c rapidlearning : 0.72 1 0 0 0 0
30.38/30.43 c Pricers : Time Calls Vars
30.38/30.43 c problem variables: 0.00 0 0
30.38/30.43 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
30.38/30.43 c relpscost : 10.32 37 0 11 0 0 58
30.38/30.43 c pscost : 0.00 0 0 0 0 0 0
30.38/30.43 c inference : 0.00 0 0 0 0 0 0
30.38/30.43 c mostinf : 0.00 0 0 0 0 0 0
30.38/30.43 c leastinf : 0.00 0 0 0 0 0 0
30.38/30.43 c fullstrong : 0.00 0 0 0 0 0 0
30.38/30.43 c allfullstrong : 0.00 0 0 0 0 0 0
30.38/30.43 c random : 0.00 0 0 0 0 0 0
30.38/30.43 c Primal Heuristics : Time Calls Found
30.38/30.43 c LP solutions : 0.00 - 1
30.38/30.43 c pseudo solutions : 0.00 - 0
30.38/30.43 c trivial : 0.01 1 0
30.38/30.43 c simplerounding : 0.00 0 0
30.38/30.43 c zirounding : 0.00 0 0
30.38/30.43 c rounding : 0.00 0 0
30.38/30.43 c shifting : 0.00 0 0
30.38/30.43 c intshifting : 0.00 0 0
30.38/30.43 c oneopt : 0.00 0 0
30.38/30.43 c twoopt : 0.00 0 0
30.38/30.43 c fixandinfer : 0.00 0 0
30.38/30.43 c feaspump : 0.00 0 0
30.38/30.43 c coefdiving : 0.00 0 0
30.38/30.43 c pscostdiving : 0.00 0 0
30.38/30.43 c fracdiving : 0.00 0 0
30.38/30.43 c veclendiving : 0.00 0 0
30.38/30.43 c intdiving : 0.00 0 0
30.38/30.43 c actconsdiving : 0.00 0 0
30.38/30.43 c objpscostdiving : 0.00 0 0
30.38/30.43 c rootsoldiving : 0.00 0 0
30.38/30.43 c linesearchdiving : 0.00 0 0
30.38/30.43 c guideddiving : 0.00 0 0
30.38/30.43 c octane : 0.00 0 0
30.38/30.43 c rens : 0.00 0 0
30.38/30.43 c rins : 0.00 0 0
30.38/30.43 c localbranching : 0.00 0 0
30.38/30.43 c mutation : 0.00 0 0
30.38/30.43 c crossover : 0.00 0 0
30.38/30.43 c dins : 0.00 0 0
30.38/30.43 c undercover : 0.00 0 0
30.38/30.43 c nlp : 0.00 0 0
30.38/30.43 c trysol : 0.00 0 0
30.38/30.43 c LP : Time Calls Iterations Iter/call Iter/sec
30.38/30.43 c primal LP : 0.04 0 0 0.00 0.00
30.38/30.43 c dual LP : 1.66 68 2183 32.10 1315.06
30.38/30.43 c lex dual LP : 0.00 0 0 0.00 -
30.38/30.43 c barrier LP : 0.00 0 0 0.00 -
30.38/30.43 c diving/probing LP: 0.00 0 0 0.00 -
30.38/30.43 c strong branching : 10.29 367 13419 36.56 1304.08
30.38/30.43 c (at root node) : - 10 2981 298.10 -
30.38/30.43 c conflict analysis: 0.00 0 0 0.00 -
30.38/30.43 c B&B Tree :
30.38/30.43 c number of runs : 1
30.38/30.43 c nodes : 30
30.38/30.43 c nodes (total) : 30
30.38/30.43 c nodes left : 0
30.38/30.43 c max depth : 29
30.38/30.43 c max depth (total): 29
30.38/30.43 c backtracks : 0 (0.0%)
30.38/30.43 c delayed cutoffs : 0
30.38/30.43 c repropagations : 0 (0 domain reductions, 0 cutoffs)
30.38/30.43 c avg switch length: 2.00
30.38/30.43 c switching time : 0.07
30.38/30.43 c Solution :
30.38/30.43 c Solutions found : 1 (1 improvements)
30.38/30.43 c First Solution : +0.00000000000000e+00 (in run 1, after 30 nodes, 29.60 seconds, depth 29, found by <relaxation>)
30.38/30.43 c Primal Bound : +0.00000000000000e+00 (in run 1, after 30 nodes, 29.60 seconds, depth 29, found by <relaxation>)
30.38/30.43 c Dual Bound : +0.00000000000000e+00
30.38/30.43 c Gap : 0.00 %
30.38/30.43 c Root Dual Bound : +0.00000000000000e+00
30.38/30.43 c Root Iterations : 821
30.48/30.53 c Time complete: 30.52.