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-2664840-1276675336.opb>
0.01/0.04 c original problem has 2924 variables (2924 bin, 0 int, 0 impl, 0 cont) and 3126 constraints
0.01/0.04 c problem read
0.01/0.04 c No objective function, only one solution is needed.
0.01/0.04 c presolving settings loaded
0.01/0.08 c presolving:
0.29/0.31 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 20592 impls, 400 clqs
0.49/0.50 c presolving (2 rounds):
0.49/0.50 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.49/0.50 c 20592 implications, 400 cliques
0.49/0.50 c presolved problem has 2924 variables (2924 bin, 0 int, 0 impl, 0 cont) and 3126 constraints
0.49/0.50 c 1 constraints of type <knapsack>
0.49/0.50 c 400 constraints of type <setppc>
0.49/0.50 c 2524 constraints of type <and>
0.49/0.50 c 1 constraints of type <linear>
0.49/0.50 c 200 constraints of type <logicor>
0.49/0.50 c transformed objective value is always integral (scale: 1)
0.49/0.50 c Presolving Time: 0.24
0.49/0.50 c - non default parameters ----------------------------------------------------------------------
0.49/0.50 c # SCIP version 1.2.1.2
0.49/0.50 c
0.49/0.50 c # frequency for displaying node information lines
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 100]
0.49/0.50 c display/freq = 10000
0.49/0.50 c
0.49/0.50 c # maximal time in seconds to run
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.50 c limits/time = 1799.97
0.49/0.50 c
0.49/0.50 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.50 c limits/memory = 1620
0.49/0.50 c
0.49/0.50 c # solving stops, if the given number of solutions were found (-1: no limit)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.50 c limits/solutions = 1
0.49/0.50 c
0.49/0.50 c # maximal number of separation rounds per node (-1: unlimited)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 5]
0.49/0.50 c separating/maxrounds = 1
0.49/0.50 c
0.49/0.50 c # maximal number of separation rounds in the root node (-1: unlimited)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.50 c separating/maxroundsroot = 5
0.49/0.50 c
0.49/0.50 c # should presolving try to simplify inequalities
0.49/0.50 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.50 c constraints/linear/simplifyinequalities = TRUE
0.49/0.50 c
0.49/0.50 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.49/0.50 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.49/0.50 c constraints/knapsack/disaggregation = FALSE
0.49/0.50 c
0.49/0.50 c # should presolving try to simplify knapsacks
0.49/0.50 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.50 c constraints/knapsack/simplifyinequalities = TRUE
0.49/0.50 c
0.49/0.50 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.50 c presolving/probing/maxrounds = 0
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/coefdiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/coefdiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/coefdiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 30]
0.49/0.50 c heuristics/crossover/freq = -1
0.49/0.50 c
0.49/0.50 c # number of nodes added to the contingent of the total nodes
0.49/0.50 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.50 c heuristics/crossover/nodesofs = 750
0.49/0.50 c
0.49/0.50 c # number of nodes without incumbent change that heuristic should wait
0.49/0.50 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.49/0.50 c heuristics/crossover/nwaitingnodes = 100
0.49/0.50 c
0.49/0.50 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.49/0.50 c # [type: real, range: [0,1], default: 0.1]
0.49/0.50 c heuristics/crossover/nodesquot = 0.15
0.49/0.50 c
0.49/0.50 c # minimum percentage of integer variables that have to be fixed
0.49/0.50 c # [type: real, range: [0,1], default: 0.666]
0.49/0.50 c heuristics/crossover/minfixingrate = 0.5
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.50 c heuristics/feaspump/freq = -1
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/feaspump/maxlpiterofs = 2000
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/fracdiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/fracdiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/fracdiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/guideddiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/guideddiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/guideddiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/intdiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/intshifting/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/linesearchdiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50 c heuristics/nlp/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.50 c heuristics/objpscostdiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to total iteration number
0.49/0.50 c # [type: real, range: [0,1], default: 0.01]
0.49/0.50 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50 c heuristics/oneopt/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/pscostdiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/pscostdiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.50 c heuristics/rens/freq = -1
0.49/0.50 c
0.49/0.50 c # minimum percentage of integer variables that have to be fixable
0.49/0.50 c # [type: real, range: [0,1], default: 0.5]
0.49/0.50 c heuristics/rens/minfixingrate = 0.3
0.49/0.50 c
0.49/0.50 c # number of nodes added to the contingent of the total nodes
0.49/0.50 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.50 c heuristics/rens/nodesofs = 2000
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.50 c heuristics/rootsoldiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.49/0.50 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50 c heuristics/rounding/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/shifting/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50 c heuristics/simplerounding/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.50 c heuristics/trivial/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50 c heuristics/trysol/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/veclendiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/veclendiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.51 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51 c heuristics/veclendiving/maxlpiterofs = 1500
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.51 c heuristics/zirounding/freq = -1
0.49/0.51 c
0.49/0.51 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51 c separating/cmir/freq = -1
0.49/0.51 c
0.49/0.51 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51 c separating/flowcover/freq = -1
0.49/0.51 c
0.49/0.51 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.51 c separating/rapidlearning/freq = 0
0.49/0.51 c
0.49/0.51 c -----------------------------------------------------------------------------------------------
0.49/0.51 c start solving
0.49/0.51 c
0.69/0.71 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.71 c 0.5s| 1 | 0 | 444 | - | 13M| 0 | 305 |2924 |3126 |2924 |5650 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.20/3.22 c 2.7s| 1 | 0 | 494 | - | 15M| 0 | 281 |2924 |3126 |2924 |5656 | 6 | 0 | 0 | 0.000000e+00 | -- | Inf
5.09/5.13 c 4.6s| 1 | 0 | 592 | - | 16M| 0 | 303 |2924 |3126 |2924 |5666 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
7.28/7.40 c 6.9s| 1 | 0 | 665 | - | 18M| 0 | 322 |2924 |3126 |2924 |5675 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
8.58/8.62 c 8.1s| 1 | 0 | 725 | - | 21M| 0 | 311 |2924 |3126 |2924 |5683 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
9.59/9.69 c 9.2s| 1 | 0 | 812 | - | 23M| 0 | 321 |2924 |3126 |2924 |5691 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
11.00/11.08 c 10.6s| 1 | 2 | 812 | - | 23M| 0 | 321 |2924 |3126 |2924 |5691 | 41 | 0 | 9 | 0.000000e+00 | -- | Inf
33.18/33.24 c *32.5s| 70 | 0 | 5353 | 65.8 | 23M| 66 | - |2924 |3129 |2924 |1306 |1577 | 3 | 762 | 0.000000e+00 | 0.000000e+00 | 0.00%
33.18/33.24 c
33.18/33.24 c SCIP Status : problem is solved [optimal solution found]
33.18/33.24 c Solving Time (sec) : 32.46
33.18/33.24 c Solving Nodes : 70
33.18/33.24 c Primal Bound : +0.00000000000000e+00 (1 solutions)
33.18/33.24 c Dual Bound : +0.00000000000000e+00
33.18/33.24 c Gap : 0.00 %
33.18/33.25 s SATISFIABLE
33.18/33.25 v x337 -x254 -x326 -x298 -x375 -x353 -x329 -x311 -x351 -x391 x235 -x400 -x393 -x398 -x312 -x293 -x336 -x331 -x259 -x304 x366 -x349
33.18/33.25 v -x276 -x341 -x281 x396 -x359 -x228 -x399 -x346 -x255 -x244 -x322 -x358 -x270 -x219 -x314 -x266 -x347 -x371 -x279 -x372 -x260
33.18/33.25 v -x382 -x333 -x216 -x277 -x243 -x269 x324 -x320 -x267 -x237 -x352 -x387 -x310 -x335 -x214 -x261 -x356 -x263 -x274 -x385 -x381
33.18/33.25 v -x265 -x316 -x213 -x253 -x278 -x227 -x357 -x290 -x289 -x288 -x285 -x251 -x313 -x379 -x294 -x210 x272 x241 x378 -x249 x209 -x389
33.18/33.25 v -x286 x250 x234 -x224 x264 -x306 -x361 -x268 -x388 -x334 -x383 -x380 -x330 x271 -x247 -x301 -x239 -x291 -x362 x354 -x258
33.18/33.25 v x256 x230 x211 -x308 -x340 -x392 x232 x394 -x206 x397 -x363 -x309 -x297 -x282 -x238 x218 x207 x296 -x287 -x222 -x368 -x348 -x390
33.18/33.25 v -x370 -x292 -x246 x217 -x248 -x344 -x273 -x299 -x343 -x332 x245 -x376 x377 -x373 -x307 -x295 -x240 -x236 -x262 -x223 x325
33.18/33.25 v -x395 -x220 -x300 x203 -x367 -x257 x233 -x208 x305 x221 -x321 -x283 -x323 -x319 x374 -x369 x202 -x360 x339 -x280 x252 -x231
33.18/33.25 v -x225 -x212 -x205 -x318 -x350 -x342 -x303 x215 x204 -x365 -x315 x355 -x201 -x384 -x328 x317 -x242 -x345 -x386 x229 -x226 -x338
33.18/33.25 v -x364 -x327 -x275 -x284 -x302 x200 -x199 x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 x185
33.18/33.25 v -x184 -x183 -x182 -x181 x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 x170 -x169 -x168 -x167 -x166 -x165 -x164
33.18/33.25 v -x163 -x162 -x161 -x160 x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143
33.18/33.25 v -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 x128 -x127 x126 -x125 -x124 -x123 -x122 -x121
33.18/33.25 v -x120 -x119 -x118 -x117 x116 -x115 -x114 -x113 x112 -x111 -x110 x109 -x108 -x107 -x106 -x105 -x104 -x103 x102 -x101 -x100
33.18/33.25 v x99 -x98 x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 x88 -x87 -x86 -x85 -x84 x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 x75 x74
33.18/33.25 v -x73 -x72 -x71 -x70 x69 x68 x67 -x66 x65 -x64 x63 x62 -x61 -x60 x59 x58 -x57 -x56 -x55 x54 -x53 -x52 -x51 -x50 -x49 x48 x47
33.18/33.25 v x46 -x45 x44 x43 -x42 -x41 -x40 x39 x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 x28 x27 x26 -x25 -x24 -x23 x22 -x21 -x20
33.18/33.25 v x19 -x18 -x17 -x16 -x15 -x14 x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
33.18/33.25 c SCIP Status : problem is solved [optimal solution found]
33.18/33.25 c Solving Time : 32.46
33.18/33.25 c Original Problem :
33.18/33.25 c Problem name : HOME/instance-2664840-1276675336.opb
33.18/33.25 c Variables : 2924 (2924 binary, 0 integer, 0 implicit integer, 0 continuous)
33.18/33.25 c Constraints : 3126 initial, 3126 maximal
33.18/33.25 c Presolved Problem :
33.18/33.25 c Problem name : t_HOME/instance-2664840-1276675336.opb
33.18/33.25 c Variables : 2924 (2924 binary, 0 integer, 0 implicit integer, 0 continuous)
33.18/33.25 c Constraints : 3126 initial, 3129 maximal
33.18/33.25 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
33.18/33.25 c trivial : 0.00 0 0 0 0 0 0 0 0
33.18/33.25 c dualfix : 0.00 0 0 0 0 0 0 0 0
33.18/33.25 c boundshift : 0.00 0 0 0 0 0 0 0 0
33.18/33.25 c inttobinary : 0.00 0 0 0 0 0 0 0 0
33.18/33.25 c implics : 0.00 0 0 0 0 0 0 0 0
33.18/33.25 c probing : 0.00 0 0 0 0 0 0 0 0
33.18/33.25 c knapsack : 0.01 0 0 0 0 0 0 0 0
33.18/33.25 c setppc : 0.00 0 0 0 0 0 0 0 0
33.18/33.25 c and : 0.18 0 0 0 0 0 0 0 0
33.18/33.25 c linear : 0.03 0 0 0 0 0 0 0 0
33.18/33.25 c logicor : 0.01 0 0 0 0 0 0 0 0
33.18/33.25 c root node : - 0 - - 0 - - - -
33.18/33.25 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
33.18/33.25 c integral : 0 0 0 77 0 0 12 0 0 132
33.18/33.25 c knapsack : 1 5 289 3 0 0 0 0 0 0
33.18/33.25 c setppc : 400 5 289 3 0 3 259 0 0 0
33.18/33.25 c and : 2524 71 286 3 0 0 2443 1539 0 0
33.18/33.25 c linear : 1 5 286 1 0 0 0 0 0 0
33.18/33.25 c logicor : 200+ 5 104 1 0 0 26 0 0 0
33.18/33.25 c countsols : 0 0 0 1 0 0 0 0 0 0
33.18/33.25 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
33.18/33.25 c integral : 17.44 0.00 0.00 17.44 0.00
33.18/33.25 c knapsack : 0.06 0.05 0.01 0.00 0.00
33.18/33.25 c setppc : 0.00 0.00 0.00 0.00 0.00
33.18/33.25 c and : 0.10 0.08 0.02 0.00 0.00
33.18/33.25 c linear : 0.03 0.00 0.03 0.00 0.00
33.18/33.25 c logicor : 0.01 0.00 0.01 0.00 0.00
33.18/33.25 c countsols : 0.00 0.00 0.00 0.00 0.00
33.18/33.25 c Propagators : Time Calls Cutoffs DomReds
33.18/33.25 c vbounds : 0.00 1 0 0
33.18/33.25 c rootredcost : 0.00 0 0 0
33.18/33.25 c pseudoobj : 0.00 0 0 0
33.18/33.25 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
33.18/33.25 c propagation : 0.00 3 3 3 3.0 0 0.0 -
33.18/33.25 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
33.18/33.25 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
33.18/33.25 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
33.18/33.25 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
33.18/33.25 c applied globally : - - - 3 3.0 - - -
33.18/33.25 c applied locally : - - - 0 0.0 - - -
33.18/33.25 c Separators : Time Calls Cutoffs DomReds Cuts Conss
33.18/33.25 c cut pool : 0.00 4 - - 2 - (maximal pool size: 951)
33.18/33.25 c redcost : 0.00 71 0 0 0 0
33.18/33.25 c impliedbounds : 0.02 5 0 0 10 0
33.18/33.25 c intobj : 0.00 0 0 0 0 0
33.18/33.25 c cgmip : 0.00 0 0 0 0 0
33.18/33.25 c gomory : 5.52 5 0 0 104 0
33.18/33.25 c strongcg : 2.27 5 0 0 2500 0
33.18/33.25 c cmir : 0.00 0 0 0 0 0
33.18/33.25 c flowcover : 0.00 0 0 0 0 0
33.18/33.25 c clique : 0.06 5 0 0 31 0
33.18/33.25 c zerohalf : 0.00 0 0 0 0 0
33.18/33.25 c mcf : 0.01 1 0 0 0 0
33.18/33.25 c rapidlearning : 0.38 1 0 0 0 0
33.18/33.25 c Pricers : Time Calls Vars
33.18/33.25 c problem variables: 0.00 0 0
33.18/33.25 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
33.18/33.25 c relpscost : 17.44 74 0 12 0 0 132
33.18/33.25 c pscost : 0.00 0 0 0 0 0 0
33.18/33.25 c inference : 0.00 0 0 0 0 0 0
33.18/33.25 c mostinf : 0.00 0 0 0 0 0 0
33.18/33.25 c leastinf : 0.00 0 0 0 0 0 0
33.18/33.25 c fullstrong : 0.00 0 0 0 0 0 0
33.18/33.25 c allfullstrong : 0.00 0 0 0 0 0 0
33.18/33.25 c random : 0.00 0 0 0 0 0 0
33.18/33.25 c Primal Heuristics : Time Calls Found
33.18/33.25 c LP solutions : 0.00 - 1
33.18/33.25 c pseudo solutions : 0.00 - 0
33.18/33.25 c trivial : 0.00 1 0
33.18/33.25 c simplerounding : 0.00 0 0
33.18/33.25 c zirounding : 0.00 0 0
33.18/33.25 c rounding : 0.00 0 0
33.18/33.25 c shifting : 0.00 0 0
33.18/33.25 c intshifting : 0.00 0 0
33.18/33.25 c oneopt : 0.00 0 0
33.18/33.25 c twoopt : 0.00 0 0
33.18/33.25 c fixandinfer : 0.00 0 0
33.18/33.25 c feaspump : 0.00 0 0
33.18/33.25 c coefdiving : 0.00 0 0
33.18/33.25 c pscostdiving : 0.00 0 0
33.18/33.25 c fracdiving : 0.00 0 0
33.18/33.25 c veclendiving : 0.00 0 0
33.18/33.25 c intdiving : 0.00 0 0
33.18/33.25 c actconsdiving : 0.00 0 0
33.18/33.25 c objpscostdiving : 0.00 0 0
33.18/33.25 c rootsoldiving : 0.00 0 0
33.18/33.25 c linesearchdiving : 0.00 0 0
33.18/33.25 c guideddiving : 0.00 0 0
33.18/33.25 c octane : 0.00 0 0
33.18/33.25 c rens : 0.00 0 0
33.18/33.25 c rins : 0.00 0 0
33.18/33.25 c localbranching : 0.00 0 0
33.18/33.25 c mutation : 0.00 0 0
33.18/33.25 c crossover : 0.00 0 0
33.18/33.25 c dins : 0.00 0 0
33.18/33.25 c undercover : 0.00 0 0
33.18/33.25 c nlp : 0.00 0 0
33.18/33.25 c trysol : 0.00 0 0
33.18/33.25 c LP : Time Calls Iterations Iter/call Iter/sec
33.18/33.25 c primal LP : 1.74 0 0 0.00 0.00
33.18/33.25 c dual LP : 4.23 148 5353 36.17 1265.48
33.18/33.25 c lex dual LP : 0.00 0 0 0.00 -
33.18/33.25 c barrier LP : 0.00 0 0 0.00 -
33.18/33.25 c diving/probing LP: 0.00 0 0 0.00 -
33.18/33.25 c strong branching : 17.41 762 49604 65.10 2849.17
33.18/33.25 c (at root node) : - 9 1520 168.89 -
33.18/33.25 c conflict analysis: 0.00 0 0 0.00 -
33.18/33.25 c B&B Tree :
33.18/33.25 c number of runs : 1
33.18/33.25 c nodes : 70
33.18/33.25 c nodes (total) : 70
33.18/33.25 c nodes left : 0
33.18/33.25 c max depth : 66
33.18/33.25 c max depth (total): 66
33.18/33.25 c backtracks : 0 (0.0%)
33.18/33.25 c delayed cutoffs : 0
33.18/33.25 c repropagations : 94 (47 domain reductions, 0 cutoffs)
33.18/33.25 c avg switch length: 4.60
33.18/33.25 c switching time : 1.76
33.18/33.25 c Solution :
33.18/33.25 c Solutions found : 1 (1 improvements)
33.18/33.25 c First Solution : +0.00000000000000e+00 (in run 1, after 70 nodes, 32.45 seconds, depth 66, found by <relaxation>)
33.18/33.25 c Primal Bound : +0.00000000000000e+00 (in run 1, after 70 nodes, 32.45 seconds, depth 66, found by <relaxation>)
33.18/33.25 c Dual Bound : +0.00000000000000e+00
33.18/33.25 c Gap : 0.00 %
33.18/33.25 c Root Dual Bound : +0.00000000000000e+00
33.18/33.25 c Root Iterations : 812
33.18/33.29 c Time complete: 33.27.