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-2666360-1276684123.opb>
0.09/0.10 c original problem has 6660 variables (6660 bin, 0 int, 0 impl, 0 cont) and 6862 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.19 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, 50480 impls, 400 clqs
0.69/0.70 c presolving (2 rounds):
0.69/0.70 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.69/0.70 c 50480 implications, 400 cliques
0.69/0.70 c presolved problem has 6660 variables (6660 bin, 0 int, 0 impl, 0 cont) and 6862 constraints
0.69/0.70 c 1 constraints of type <knapsack>
0.69/0.70 c 400 constraints of type <setppc>
0.69/0.70 c 6260 constraints of type <and>
0.69/0.70 c 1 constraints of type <linear>
0.69/0.70 c 200 constraints of type <logicor>
0.69/0.70 c transformed objective value is always integral (scale: 1)
0.69/0.70 c Presolving Time: 0.36
0.69/0.70 c - non default parameters ----------------------------------------------------------------------
0.69/0.70 c # SCIP version 1.2.1.2
0.69/0.70 c
0.69/0.70 c # frequency for displaying node information lines
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 100]
0.69/0.70 c display/freq = 10000
0.69/0.70 c
0.69/0.70 c # maximal time in seconds to run
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.70 c limits/time = 1799.9
0.69/0.70 c
0.69/0.70 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.70 c limits/memory = 1620
0.69/0.70 c
0.69/0.70 c # solving stops, if the given number of solutions were found (-1: no limit)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c limits/solutions = 1
0.69/0.70 c
0.69/0.70 c # maximal number of separation rounds per node (-1: unlimited)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 5]
0.69/0.70 c separating/maxrounds = 1
0.69/0.70 c
0.69/0.70 c # maximal number of separation rounds in the root node (-1: unlimited)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c separating/maxroundsroot = 5
0.69/0.70 c
0.69/0.70 c # should presolving try to simplify inequalities
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.70 c constraints/linear/simplifyinequalities = TRUE
0.69/0.70 c
0.69/0.70 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.69/0.70 c constraints/knapsack/disaggregation = FALSE
0.69/0.70 c
0.69/0.70 c # should presolving try to simplify knapsacks
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.70 c constraints/knapsack/simplifyinequalities = TRUE
0.69/0.70 c
0.69/0.70 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c presolving/probing/maxrounds = 0
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/coefdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/coefdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/coefdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 30]
0.69/0.70 c heuristics/crossover/freq = -1
0.69/0.70 c
0.69/0.70 c # number of nodes added to the contingent of the total nodes
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.70 c heuristics/crossover/nodesofs = 750
0.69/0.70 c
0.69/0.70 c # number of nodes without incumbent change that heuristic should wait
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.69/0.70 c heuristics/crossover/nwaitingnodes = 100
0.69/0.70 c
0.69/0.70 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.69/0.70 c # [type: real, range: [0,1], default: 0.1]
0.69/0.70 c heuristics/crossover/nodesquot = 0.15
0.69/0.70 c
0.69/0.70 c # minimum percentage of integer variables that have to be fixed
0.69/0.70 c # [type: real, range: [0,1], default: 0.666]
0.69/0.70 c heuristics/crossover/minfixingrate = 0.5
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/feaspump/freq = -1
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/feaspump/maxlpiterofs = 2000
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/fracdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/fracdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/fracdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/guideddiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/guideddiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/guideddiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/intdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/intshifting/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/linesearchdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/nlp/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/objpscostdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.70 c # [type: real, range: [0,1], default: 0.01]
0.69/0.70 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/oneopt/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/pscostdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/pscostdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/rens/freq = -1
0.69/0.70 c
0.69/0.70 c # minimum percentage of integer variables that have to be fixable
0.69/0.70 c # [type: real, range: [0,1], default: 0.5]
0.69/0.70 c heuristics/rens/minfixingrate = 0.3
0.69/0.70 c
0.69/0.70 c # number of nodes added to the contingent of the total nodes
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.70 c heuristics/rens/nodesofs = 2000
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/rootsoldiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.70 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/rounding/freq = -1
0.69/0.70 c
0.69/0.70 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.97 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.97 c 0.6s| 1 | 0 | 252 | - | 30M| 0 | 123 |6660 |6862 |6660 | 13k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.59/4.65 c 4.0s| 1 | 0 | 322 | - | 30M| 0 | 134 |6660 |6862 |6660 | 13k| 10 | 0 | 0 | 0.000000e+00 | -- | Inf
8.39/8.43 c 7.8s| 1 | 0 | 396 | - | 31M| 0 | 144 |6660 |6862 |6660 | 13k| 19 | 0 | 0 | 0.000000e+00 | -- | Inf
12.28/12.34 c 11.7s| 1 | 0 | 429 | - | 31M| 0 | 146 |6660 |6862 |6660 | 13k| 26 | 0 | 0 | 0.000000e+00 | -- | Inf
16.39/16.48 c 15.8s| 1 | 0 | 529 | - | 32M| 0 | 156 |6660 |6862 |6660 | 13k| 34 | 0 | 0 | 0.000000e+00 | -- | Inf
20.48/20.57 c 19.9s| 1 | 0 | 568 | - | 33M| 0 | 159 |6660 |6862 |6660 | 13k| 41 | 0 | 0 | 0.000000e+00 | -- | Inf
20.68/20.75 c 20.0s| 1 | 0 | 577 | - | 33M| 0 | 156 |6660 |6862 |6660 | 13k| 43 | 0 | 0 | 0.000000e+00 | -- | Inf
24.78/24.87 c 24.1s| 1 | 2 | 577 | - | 33M| 0 | 156 |6660 |6862 |6660 | 13k| 43 | 0 | 9 | 0.000000e+00 | -- | Inf
33.78/33.80 c *32.9s| 47 | 0 | 2404 | 39.7 | 35M| 40 | - |6660 |6868 |6660 |1085 | 872 | 6 | 536 | 0.000000e+00 | 0.000000e+00 | 0.00%
33.78/33.81 c
33.78/33.81 c SCIP Status : problem is solved [optimal solution found]
33.78/33.81 c Solving Time (sec) : 32.95
33.78/33.81 c Solving Nodes : 47
33.78/33.81 c Primal Bound : +0.00000000000000e+00 (1 solutions)
33.78/33.81 c Dual Bound : +0.00000000000000e+00
33.78/33.81 c Gap : 0.00 %
33.78/33.83 s SATISFIABLE
33.78/33.83 v -x371 -x383 -x336 -x224 x320 -x326 -x282 -x353 -x272 -x295 -x351 -x216 -x375 -x311 -x400 -x354 -x236 -x256 -x234 -x289 -x316 -x307
33.78/33.83 v -x242 -x328 -x366 -x209 -x349 -x346 x293 -x277 -x218 -x276 -x281 x396 -x359 -x261 -x208 -x337 -x252 -x285 -x243 -x230 -x358
33.78/33.83 v -x225 x241 -x331 -x254 -x211 -x347 -x330 x382 -x333 -x206 -x398 -x288 -x274 -x255 -x246 -x228 -x324 -x237 -x352 -x387 -x360
33.78/33.83 v -x310 -x271 -x391 -x363 -x357 -x339 -x329 -x259 -x258 -x217 -x385 x389 -x265 -x313 -x379 -x397 -x380 -x356 -x341 -x298 -x279
33.78/33.83 v -x269 -x260 -x251 -x235 -x214 -x213 -x286 -x378 -x249 x264 -x306 -x361 -x268 -x233 -x247 -x301 -x203 -x381 -x334 -x270 -x266
33.78/33.83 v -x250 -x239 x297 -x291 -x370 -x362 -x308 -x340 -x392 -x232 -x394 x373 x317 -x207 x296 -x287 -x222 -x368 -x348 -x390 -x388 -x372
33.78/33.83 v -x367 -x314 -x312 -x304 -x294 -x292 -x290 -x278 -x248 -x244 -x227 -x219 -x212 -x210 -x344 -x273 -x299 -x343 -x332 -x245
33.78/33.83 v -x376 -x377 -x223 -x384 -x325 -x395 -x220 -x300 -x257 -x305 -x231 -x221 -x321 -x283 -x323 -x201 -x399 -x393 -x335 -x322 -x309
33.78/33.83 v -x267 -x263 x262 x253 -x240 -x238 -x319 -x374 -x280 -x369 -x205 -x318 x350 -x202 -x342 -x303 -x215 -x204 -x365 -x315 -x355 x345
33.78/33.83 v -x386 -x229 -x226 -x338 -x364 -x327 -x275 -x284 -x302 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
33.78/33.83 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169
33.78/33.83 v -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
33.78/33.83 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
33.78/33.83 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
33.78/33.83 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
33.78/33.83 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
33.78/33.83 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
33.78/33.83 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
33.78/33.83 v x2 -x1
33.78/33.83 c SCIP Status : problem is solved [optimal solution found]
33.78/33.83 c Solving Time : 32.95
33.78/33.83 c Original Problem :
33.78/33.83 c Problem name : HOME/instance-2666360-1276684123.opb
33.78/33.83 c Variables : 6660 (6660 binary, 0 integer, 0 implicit integer, 0 continuous)
33.78/33.83 c Constraints : 6862 initial, 6862 maximal
33.78/33.83 c Presolved Problem :
33.78/33.83 c Problem name : t_HOME/instance-2666360-1276684123.opb
33.78/33.83 c Variables : 6660 (6660 binary, 0 integer, 0 implicit integer, 0 continuous)
33.78/33.83 c Constraints : 6862 initial, 6868 maximal
33.78/33.83 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
33.78/33.83 c trivial : 0.00 0 0 0 0 0 0 0 0
33.78/33.83 c dualfix : 0.00 0 0 0 0 0 0 0 0
33.78/33.83 c boundshift : 0.00 0 0 0 0 0 0 0 0
33.78/33.83 c inttobinary : 0.00 0 0 0 0 0 0 0 0
33.78/33.83 c implics : 0.00 0 0 0 0 0 0 0 0
33.78/33.83 c probing : 0.00 0 0 0 0 0 0 0 0
33.78/33.83 c knapsack : 0.01 0 0 0 0 0 0 0 0
33.78/33.83 c setppc : 0.01 0 0 0 0 0 0 0 0
33.78/33.83 c and : 0.23 0 0 0 0 0 0 0 0
33.78/33.83 c linear : 0.05 0 0 0 0 0 0 0 0
33.78/33.83 c logicor : 0.00 0 0 0 0 0 0 0 0
33.78/33.83 c root node : - 0 - - 0 - - - -
33.78/33.83 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
33.78/33.83 c integral : 0 0 0 60 0 0 23 0 0 80
33.78/33.83 c knapsack : 1 5 193 7 0 0 0 0 0 0
33.78/33.83 c setppc : 400 5 193 7 0 6 541 0 0 0
33.78/33.83 c and : 6260 45 187 7 0 0 5602 833 0 0
33.78/33.83 c linear : 1 5 187 1 0 0 0 0 0 0
33.78/33.83 c logicor : 200+ 5 55 1 0 0 19 0 0 0
33.78/33.83 c countsols : 0 0 0 1 0 0 0 0 0 0
33.78/33.83 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
33.78/33.83 c integral : 11.47 0.00 0.00 11.47 0.00
33.78/33.83 c knapsack : 0.06 0.06 0.00 0.00 0.00
33.78/33.83 c setppc : 0.00 0.00 0.00 0.00 0.00
33.78/33.83 c and : 0.14 0.10 0.03 0.01 0.00
33.78/33.83 c linear : 0.03 0.00 0.03 0.00 0.00
33.78/33.83 c logicor : 0.01 0.00 0.01 0.00 0.00
33.78/33.83 c countsols : 0.00 0.00 0.00 0.00 0.00
33.78/33.83 c Propagators : Time Calls Cutoffs DomReds
33.78/33.83 c vbounds : 0.00 1 0 0
33.78/33.83 c rootredcost : 0.00 0 0 0
33.78/33.83 c pseudoobj : 0.00 0 0 0
33.78/33.83 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
33.78/33.83 c propagation : 0.00 6 6 6 3.0 0 0.0 -
33.78/33.83 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
33.78/33.83 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
33.78/33.83 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
33.78/33.83 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
33.78/33.83 c applied globally : - - - 6 3.0 - - -
33.78/33.83 c applied locally : - - - 0 0.0 - - -
33.78/33.83 c Separators : Time Calls Cutoffs DomReds Cuts Conss
33.78/33.83 c cut pool : 0.01 4 - - 10 - (maximal pool size: 372)
33.78/33.83 c redcost : 0.04 45 0 0 0 0
33.78/33.83 c impliedbounds : 0.01 5 0 0 10 0
33.78/33.83 c intobj : 0.00 0 0 0 0 0
33.78/33.83 c cgmip : 0.00 0 0 0 0 0
33.78/33.83 c gomory : 14.99 5 0 0 0 0
33.78/33.83 c strongcg : 2.26 5 0 0 2500 0
33.78/33.83 c cmir : 0.00 0 0 0 0 0
33.78/33.83 c flowcover : 0.00 0 0 0 0 0
33.78/33.83 c clique : 0.05 5 0 0 32 0
33.78/33.83 c zerohalf : 0.00 0 0 0 0 0
33.78/33.83 c mcf : 0.71 4 0 0 24 0
33.78/33.83 c rapidlearning : 0.68 1 0 0 0 0
33.78/33.83 c Pricers : Time Calls Vars
33.78/33.83 c problem variables: 0.00 0 0
33.78/33.83 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
33.78/33.83 c relpscost : 11.47 53 0 23 0 0 80
33.78/33.83 c pscost : 0.00 0 0 0 0 0 0
33.78/33.83 c inference : 0.00 0 0 0 0 0 0
33.78/33.83 c mostinf : 0.00 0 0 0 0 0 0
33.78/33.83 c leastinf : 0.00 0 0 0 0 0 0
33.78/33.83 c fullstrong : 0.00 0 0 0 0 0 0
33.78/33.83 c allfullstrong : 0.00 0 0 0 0 0 0
33.78/33.83 c random : 0.00 0 0 0 0 0 0
33.78/33.83 c Primal Heuristics : Time Calls Found
33.78/33.83 c LP solutions : 0.00 - 1
33.78/33.83 c pseudo solutions : 0.00 - 0
33.78/33.83 c trivial : 0.01 1 0
33.78/33.83 c simplerounding : 0.00 0 0
33.78/33.83 c zirounding : 0.00 0 0
33.78/33.83 c rounding : 0.00 0 0
33.78/33.83 c shifting : 0.00 0 0
33.78/33.83 c intshifting : 0.00 0 0
33.78/33.83 c oneopt : 0.00 0 0
33.78/33.83 c twoopt : 0.00 0 0
33.78/33.83 c fixandinfer : 0.00 0 0
33.78/33.83 c feaspump : 0.00 0 0
33.78/33.83 c coefdiving : 0.00 0 0
33.78/33.83 c pscostdiving : 0.00 0 0
33.78/33.83 c fracdiving : 0.00 0 0
33.78/33.83 c veclendiving : 0.00 0 0
33.78/33.83 c intdiving : 0.00 0 0
33.78/33.83 c actconsdiving : 0.00 0 0
33.78/33.83 c objpscostdiving : 0.00 0 0
33.78/33.83 c rootsoldiving : 0.00 0 0
33.78/33.83 c linesearchdiving : 0.00 0 0
33.78/33.83 c guideddiving : 0.00 0 0
33.78/33.83 c octane : 0.00 0 0
33.78/33.83 c rens : 0.00 0 0
33.78/33.83 c rins : 0.00 0 0
33.78/33.83 c localbranching : 0.00 0 0
33.78/33.83 c mutation : 0.00 0 0
33.78/33.83 c crossover : 0.00 0 0
33.78/33.83 c dins : 0.00 0 0
33.78/33.83 c undercover : 0.00 0 0
33.78/33.83 c nlp : 0.00 0 0
33.78/33.83 c trysol : 0.00 0 0
33.78/33.83 c LP : Time Calls Iterations Iter/call Iter/sec
33.78/33.83 c primal LP : 0.04 0 0 0.00 0.00
33.78/33.83 c dual LP : 1.42 106 2404 22.68 1692.96
33.78/33.83 c lex dual LP : 0.00 0 0 0.00 -
33.78/33.83 c barrier LP : 0.00 0 0 0.00 -
33.78/33.83 c diving/probing LP: 0.00 0 0 0.00 -
33.78/33.83 c strong branching : 11.47 536 19606 36.58 1709.33
33.78/33.83 c (at root node) : - 9 2652 294.67 -
33.78/33.83 c conflict analysis: 0.00 0 0 0.00 -
33.78/33.83 c B&B Tree :
33.78/33.83 c number of runs : 1
33.78/33.83 c nodes : 47
33.78/33.83 c nodes (total) : 47
33.78/33.83 c nodes left : 0
33.78/33.83 c max depth : 40
33.78/33.83 c max depth (total): 40
33.78/33.83 c backtracks : 0 (0.0%)
33.78/33.83 c delayed cutoffs : 0
33.78/33.83 c repropagations : 59 (181 domain reductions, 0 cutoffs)
33.78/33.83 c avg switch length: 4.26
33.78/33.83 c switching time : 0.14
33.78/33.83 c Solution :
33.78/33.83 c Solutions found : 1 (1 improvements)
33.78/33.83 c First Solution : +0.00000000000000e+00 (in run 1, after 47 nodes, 32.94 seconds, depth 40, found by <relaxation>)
33.78/33.83 c Primal Bound : +0.00000000000000e+00 (in run 1, after 47 nodes, 32.94 seconds, depth 40, found by <relaxation>)
33.78/33.83 c Dual Bound : +0.00000000000000e+00
33.78/33.83 c Gap : 0.00 %
33.78/33.83 c Root Dual Bound : +0.00000000000000e+00
33.78/33.83 c Root Iterations : 577
33.87/33.93 c Time complete: 33.91.