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-2666304-1276679051.opb>
0.02/0.05 c original problem has 2888 variables (2888 bin, 0 int, 0 impl, 0 cont) and 3090 constraints
0.02/0.05 c problem read
0.02/0.05 c No objective function, only one solution is needed.
0.02/0.05 c presolving settings loaded
0.02/0.09 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, 20304 impls, 400 clqs
0.49/0.51 c presolving (2 rounds):
0.49/0.51 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.49/0.51 c 20304 implications, 400 cliques
0.49/0.51 c presolved problem has 2888 variables (2888 bin, 0 int, 0 impl, 0 cont) and 3090 constraints
0.49/0.51 c 1 constraints of type <knapsack>
0.49/0.51 c 400 constraints of type <setppc>
0.49/0.51 c 2488 constraints of type <and>
0.49/0.51 c 1 constraints of type <linear>
0.49/0.51 c 200 constraints of type <logicor>
0.49/0.51 c transformed objective value is always integral (scale: 1)
0.49/0.51 c Presolving Time: 0.23
0.49/0.51 c - non default parameters ----------------------------------------------------------------------
0.49/0.51 c # SCIP version 1.2.1.2
0.49/0.51 c
0.49/0.51 c # frequency for displaying node information lines
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 100]
0.49/0.51 c display/freq = 10000
0.49/0.51 c
0.49/0.51 c # maximal time in seconds to run
0.49/0.51 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.51 c limits/time = 1799.95
0.49/0.51 c
0.49/0.51 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.49/0.51 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.51 c limits/memory = 1620
0.49/0.51 c
0.49/0.51 c # solving stops, if the given number of solutions were found (-1: no limit)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.51 c limits/solutions = 1
0.49/0.51 c
0.49/0.51 c # maximal number of separation rounds per node (-1: unlimited)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 5]
0.49/0.51 c separating/maxrounds = 1
0.49/0.51 c
0.49/0.51 c # maximal number of separation rounds in the root node (-1: unlimited)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.51 c separating/maxroundsroot = 5
0.49/0.51 c
0.49/0.51 c # should presolving try to simplify inequalities
0.49/0.51 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.51 c constraints/linear/simplifyinequalities = TRUE
0.49/0.51 c
0.49/0.51 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.49/0.51 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.49/0.51 c constraints/knapsack/disaggregation = FALSE
0.49/0.51 c
0.49/0.51 c # should presolving try to simplify knapsacks
0.49/0.51 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.51 c constraints/knapsack/simplifyinequalities = TRUE
0.49/0.51 c
0.49/0.51 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.51 c presolving/probing/maxrounds = 0
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51 c heuristics/coefdiving/freq = -1
0.49/0.51 c
0.49/0.51 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51 c heuristics/coefdiving/maxlpiterquot = 0.075
0.49/0.51 c
0.49/0.51 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/coefdiving/maxlpiterofs = 1500
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 30]
0.49/0.51 c heuristics/crossover/freq = -1
0.49/0.51 c
0.49/0.51 c # number of nodes added to the contingent of the total nodes
0.49/0.51 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.51 c heuristics/crossover/nodesofs = 750
0.49/0.51 c
0.49/0.51 c # number of nodes without incumbent change that heuristic should wait
0.49/0.51 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.49/0.51 c heuristics/crossover/nwaitingnodes = 100
0.49/0.51 c
0.49/0.51 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.49/0.51 c # [type: real, range: [0,1], default: 0.1]
0.49/0.51 c heuristics/crossover/nodesquot = 0.15
0.49/0.51 c
0.49/0.51 c # minimum percentage of integer variables that have to be fixed
0.49/0.51 c # [type: real, range: [0,1], default: 0.666]
0.49/0.51 c heuristics/crossover/minfixingrate = 0.5
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.51 c heuristics/feaspump/freq = -1
0.49/0.51 c
0.49/0.51 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/feaspump/maxlpiterofs = 2000
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51 c heuristics/fracdiving/freq = -1
0.49/0.51 c
0.49/0.51 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51 c heuristics/fracdiving/maxlpiterquot = 0.075
0.49/0.51 c
0.49/0.51 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/fracdiving/maxlpiterofs = 1500
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51 c heuristics/guideddiving/freq = -1
0.49/0.51 c
0.49/0.51 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51 c heuristics/guideddiving/maxlpiterquot = 0.075
0.49/0.51 c
0.49/0.51 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/guideddiving/maxlpiterofs = 1500
0.49/0.51 c
0.49/0.51 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51 c heuristics/intdiving/maxlpiterquot = 0.075
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51 c heuristics/intshifting/freq = -1
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51 c heuristics/linesearchdiving/freq = -1
0.49/0.51 c
0.49/0.51 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.49/0.51 c
0.49/0.51 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/linesearchdiving/maxlpiterofs = 1500
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <nlp> (-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/nlp/freq = -1
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.51 c heuristics/objpscostdiving/freq = -1
0.49/0.51 c
0.49/0.51 c # maximal fraction of diving LP iterations compared to total iteration number
0.49/0.51 c # [type: real, range: [0,1], default: 0.01]
0.49/0.51 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.49/0.51 c
0.49/0.51 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/objpscostdiving/maxlpiterofs = 1500
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <oneopt> (-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/oneopt/freq = -1
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51 c heuristics/pscostdiving/freq = -1
0.49/0.51 c
0.49/0.51 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.49/0.51 c
0.49/0.51 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/pscostdiving/maxlpiterofs = 1500
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51 c heuristics/rens/freq = -1
0.49/0.51 c
0.49/0.51 c # minimum percentage of integer variables that have to be fixable
0.49/0.51 c # [type: real, range: [0,1], default: 0.5]
0.49/0.51 c heuristics/rens/minfixingrate = 0.3
0.49/0.51 c
0.49/0.51 c # number of nodes added to the contingent of the total nodes
0.49/0.51 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.51 c heuristics/rens/nodesofs = 2000
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.51 c heuristics/rootsoldiving/freq = -1
0.49/0.51 c
0.49/0.51 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.49/0.51 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.49/0.51 c
0.49/0.51 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/rootsoldiving/maxlpiterofs = 1500
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <rounding> (-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/rounding/freq = -1
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51 c heuristics/shifting/freq = -1
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <simplerounding> (-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/simplerounding/freq = -1
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51 c heuristics/trivial/freq = -1
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <trysol> (-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/trysol/freq = -1
0.49/0.51 c
0.49/0.51 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.49/0.51 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51 c heuristics/veclendiving/freq = -1
0.49/0.51 c
0.49/0.51 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51 c heuristics/veclendiving/maxlpiterquot = 0.075
0.49/0.51 c
0.49/0.51 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.75 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.75 c 0.5s| 1 | 0 | 575 | - | 13M| 0 | 324 |2888 |3090 |2888 |5578 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.59/3.69 c 3.2s| 1 | 0 | 667 | - | 15M| 0 | 330 |2888 |3090 |2888 |5597 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
4.89/4.95 c 4.4s| 1 | 0 | 727 | - | 16M| 0 | 335 |2888 |3090 |2888 |5609 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
6.19/6.21 c 5.7s| 1 | 0 | 777 | - | 18M| 0 | 351 |2888 |3090 |2888 |5617 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
7.60/7.61 c 7.0s| 1 | 0 | 874 | - | 20M| 0 | 364 |2888 |3090 |2888 |5634 | 56 | 0 | 0 | 0.000000e+00 | -- | Inf
8.99/9.06 c 8.5s| 1 | 0 | 954 | - | 21M| 0 | 358 |2888 |3090 |2888 |5643 | 65 | 0 | 0 | 0.000000e+00 | -- | Inf
11.68/11.74 c 11.1s| 1 | 2 | 954 | - | 21M| 0 | 358 |2888 |3090 |2888 |5643 | 65 | 0 | 10 | 0.000000e+00 | -- | Inf
36.09/36.10 c *35.3s| 123 | 0 | 5591 | 38.0 | 22M| 91 | - |2888 |3180 |2888 |1395 | 857 | 90 |1313 | 0.000000e+00 | 0.000000e+00 | 0.00%
36.09/36.11 c
36.09/36.11 c SCIP Status : problem is solved [optimal solution found]
36.09/36.11 c Solving Time (sec) : 35.28
36.09/36.11 c Solving Nodes : 123
36.09/36.11 c Primal Bound : +0.00000000000000e+00 (1 solutions)
36.09/36.11 c Dual Bound : +0.00000000000000e+00
36.09/36.11 c Gap : 0.00 %
36.09/36.11 s SATISFIABLE
36.09/36.11 v -x364 -x366 -x370 -x297 -x268 -x312 -x330 -x310 -x388 -x395 -x260 -x319 -x263 -x331 -x276 -x300 -x373 x374 -x358 x250 -x380 -x356
36.09/36.11 v -x292 -x315 -x361 -x332 -x293 -x281 -x378 -x371 -x247 -x321 -x233 -x359 x383 x223 -x397 -x339 x266 -x264 -x322 -x240 -x313
36.09/36.11 v x352 x326 -x257 -x218 -x367 -x280 -x234 -x344 -x285 x333 x311 -x306 -x277 -x219 -x363 -x379 -x385 -x389 -x232 -x290 -x355 -x228
36.09/36.11 v -x246 -x214 -x221 -x216 -x302 x252 -x345 x335 -x213 -x301 -x294 -x251 -x235 -x350 -x336 -x244 -x382 -x381 -x384 -x304 -x328
36.09/36.11 v -x275 -x217 -x261 -x308 -x222 -x299 -x354 -x230 -x210 -x329 x357 -x284 -x346 -x227 -x398 -x314 -x209 -x396 x365 x270 -x392
36.09/36.11 v -x327 x307 -x267 -x254 -x317 -x320 x318 -x287 x220 x243 -x212 x351 -x309 x271 -x334 -x278 -x368 x372 x272 -x305 -x206 x236 -x211
36.09/36.11 v x387 x237 -x298 -x249 -x238 -x225 -x390 -x400 -x283 x205 x324 -x303 x245 -x229 -x323 -x353 -x282 -x348 -x289 -x393 x349
36.09/36.11 v x295 -x204 -x360 -x342 -x256 x291 -x279 -x362 -x207 -x375 -x337 x215 -x255 -x399 -x288 x231 x208 -x269 -x338 -x286 -x248 -x274
36.09/36.11 v -x239 -x343 -x316 -x391 x253 x224 x296 x376 -x242 -x203 x340 -x394 -x325 -x259 -x201 x262 -x258 -x265 -x202 -x377 -x273 -x341
36.09/36.11 v -x226 -x241 -x369 -x386 -x347 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185
36.09/36.11 v -x184 -x183 -x182 -x181 -x180 -x179 x178 -x177 -x176 -x175 -x174 -x173 -x172 x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164
36.09/36.11 v -x163 -x162 -x161 x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143
36.09/36.11 v -x142 -x141 -x140 -x139 x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122
36.09/36.11 v x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 x105 x104 -x103 -x102 -x101 -x100
36.09/36.11 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
36.09/36.11 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
36.09/36.11 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
36.09/36.11 v -x19 x18 -x17 x16 -x15 -x14 -x13 -x12 x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
36.09/36.11 c SCIP Status : problem is solved [optimal solution found]
36.09/36.11 c Solving Time : 35.28
36.09/36.11 c Original Problem :
36.09/36.11 c Problem name : HOME/instance-2666304-1276679051.opb
36.09/36.11 c Variables : 2888 (2888 binary, 0 integer, 0 implicit integer, 0 continuous)
36.09/36.11 c Constraints : 3090 initial, 3090 maximal
36.09/36.11 c Presolved Problem :
36.09/36.11 c Problem name : t_HOME/instance-2666304-1276679051.opb
36.09/36.11 c Variables : 2888 (2888 binary, 0 integer, 0 implicit integer, 0 continuous)
36.09/36.11 c Constraints : 3090 initial, 3180 maximal
36.09/36.11 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
36.09/36.11 c trivial : 0.01 0 0 0 0 0 0 0 0
36.09/36.11 c dualfix : 0.00 0 0 0 0 0 0 0 0
36.09/36.11 c boundshift : 0.00 0 0 0 0 0 0 0 0
36.09/36.11 c inttobinary : 0.00 0 0 0 0 0 0 0 0
36.09/36.11 c implics : 0.01 0 0 0 0 0 0 0 0
36.09/36.11 c probing : 0.00 0 0 0 0 0 0 0 0
36.09/36.11 c knapsack : 0.01 0 0 0 0 0 0 0 0
36.09/36.11 c setppc : 0.00 0 0 0 0 0 0 0 0
36.09/36.11 c and : 0.15 0 0 0 0 0 0 0 0
36.09/36.11 c linear : 0.03 0 0 0 0 0 0 0 0
36.09/36.11 c logicor : 0.00 0 0 0 0 0 0 0 0
36.09/36.11 c root node : - 0 - - 0 - - - -
36.09/36.11 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
36.09/36.11 c integral : 0 0 0 138 0 3 51 0 0 198
36.09/36.11 c knapsack : 1 5 580 1 0 0 0 0 0 0
36.09/36.11 c setppc : 400 5 580 1 0 12 247 0 0 0
36.09/36.11 c and : 2488 113 568 1 0 1 2591 809 0 0
36.09/36.11 c linear : 1 5 567 1 0 0 0 0 0 0
36.09/36.11 c logicor : 200+ 5 176 1 0 0 50 0 0 0
36.09/36.11 c countsols : 0 0 0 1 0 0 0 0 0 0
36.09/36.11 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
36.09/36.11 c integral : 24.02 0.00 0.00 24.02 0.00
36.09/36.11 c knapsack : 0.06 0.05 0.01 0.00 0.00
36.09/36.11 c setppc : 0.01 0.00 0.01 0.00 0.00
36.09/36.11 c and : 0.15 0.09 0.06 0.00 0.00
36.09/36.11 c linear : 0.02 0.00 0.02 0.00 0.00
36.09/36.11 c logicor : 0.00 0.00 0.00 0.00 0.00
36.09/36.11 c countsols : 0.00 0.00 0.00 0.00 0.00
36.09/36.11 c Propagators : Time Calls Cutoffs DomReds
36.09/36.11 c vbounds : 0.01 1 0 0
36.09/36.11 c rootredcost : 0.00 0 0 0
36.09/36.11 c pseudoobj : 0.00 0 0 0
36.09/36.11 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
36.09/36.11 c propagation : 0.00 13 13 13 2.9 0 0.0 -
36.09/36.11 c infeasible LP : 0.01 8 8 257 115.0 4 3.0 0
36.09/36.11 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
36.09/36.11 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
36.09/36.11 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
36.09/36.11 c applied globally : - - - 90 91.2 - - -
36.09/36.11 c applied locally : - - - 0 0.0 - - -
36.09/36.11 c Separators : Time Calls Cutoffs DomReds Cuts Conss
36.09/36.11 c cut pool : 0.00 4 - - 3 - (maximal pool size: 861)
36.09/36.11 c redcost : 0.02 113 0 0 0 0
36.09/36.11 c impliedbounds : 0.00 5 0 0 45 0
36.09/36.11 c intobj : 0.00 0 0 0 0 0
36.09/36.11 c cgmip : 0.00 0 0 0 0 0
36.09/36.11 c gomory : 4.17 5 0 0 48 0
36.09/36.11 c strongcg : 2.90 5 0 0 2500 0
36.09/36.11 c cmir : 0.00 0 0 0 0 0
36.09/36.11 c flowcover : 0.00 0 0 0 0 0
36.09/36.11 c clique : 0.06 5 0 0 33 0
36.09/36.11 c zerohalf : 0.00 0 0 0 0 0
36.09/36.11 c mcf : 0.01 1 0 0 0 0
36.09/36.11 c rapidlearning : 0.38 1 0 0 0 0
36.09/36.11 c Pricers : Time Calls Vars
36.09/36.11 c problem variables: 0.00 0 0
36.09/36.11 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
36.09/36.11 c relpscost : 24.02 137 3 51 0 0 198
36.09/36.11 c pscost : 0.00 0 0 0 0 0 0
36.09/36.11 c inference : 0.00 0 0 0 0 0 0
36.09/36.11 c mostinf : 0.00 0 0 0 0 0 0
36.09/36.11 c leastinf : 0.00 0 0 0 0 0 0
36.09/36.11 c fullstrong : 0.00 0 0 0 0 0 0
36.09/36.11 c allfullstrong : 0.00 0 0 0 0 0 0
36.09/36.11 c random : 0.00 0 0 0 0 0 0
36.09/36.11 c Primal Heuristics : Time Calls Found
36.09/36.11 c LP solutions : 0.00 - 1
36.09/36.11 c pseudo solutions : 0.00 - 0
36.09/36.11 c trivial : 0.00 1 0
36.09/36.11 c simplerounding : 0.00 0 0
36.09/36.11 c zirounding : 0.00 0 0
36.09/36.11 c rounding : 0.00 0 0
36.09/36.11 c shifting : 0.00 0 0
36.09/36.11 c intshifting : 0.00 0 0
36.09/36.11 c oneopt : 0.00 0 0
36.09/36.11 c twoopt : 0.00 0 0
36.09/36.11 c fixandinfer : 0.00 0 0
36.09/36.11 c feaspump : 0.00 0 0
36.09/36.11 c coefdiving : 0.00 0 0
36.09/36.11 c pscostdiving : 0.00 0 0
36.09/36.11 c fracdiving : 0.00 0 0
36.09/36.11 c veclendiving : 0.00 0 0
36.09/36.11 c intdiving : 0.00 0 0
36.09/36.11 c actconsdiving : 0.00 0 0
36.09/36.11 c objpscostdiving : 0.00 0 0
36.09/36.11 c rootsoldiving : 0.00 0 0
36.09/36.11 c linesearchdiving : 0.00 0 0
36.09/36.11 c guideddiving : 0.00 0 0
36.09/36.11 c octane : 0.00 0 0
36.09/36.11 c rens : 0.00 0 0
36.09/36.11 c rins : 0.00 0 0
36.09/36.11 c localbranching : 0.00 0 0
36.09/36.11 c mutation : 0.00 0 0
36.09/36.11 c crossover : 0.00 0 0
36.09/36.11 c dins : 0.00 0 0
36.09/36.11 c undercover : 0.00 0 0
36.09/36.11 c nlp : 0.00 0 0
36.09/36.11 c trysol : 0.00 0 0
36.09/36.11 c LP : Time Calls Iterations Iter/call Iter/sec
36.09/36.11 c primal LP : 0.13 0 0 0.00 0.00
36.09/36.11 c dual LP : 2.57 247 5591 22.64 2175.49
36.09/36.11 c lex dual LP : 0.00 0 0 0.00 -
36.09/36.11 c barrier LP : 0.00 0 0 0.00 -
36.09/36.11 c diving/probing LP: 0.00 0 0 0.00 -
36.09/36.11 c strong branching : 23.99 1313 47925 36.50 1997.71
36.09/36.11 c (at root node) : - 10 2435 243.50 -
36.09/36.11 c conflict analysis: 0.00 0 0 0.00 -
36.09/36.11 c B&B Tree :
36.09/36.11 c number of runs : 1
36.09/36.11 c nodes : 123
36.09/36.11 c nodes (total) : 123
36.09/36.11 c nodes left : 0
36.09/36.11 c max depth : 91
36.09/36.11 c max depth (total): 91
36.09/36.11 c backtracks : 8 (6.5%)
36.09/36.11 c delayed cutoffs : 4
36.09/36.11 c repropagations : 209 (135 domain reductions, 1 cutoffs)
36.09/36.11 c avg switch length: 5.14
36.09/36.11 c switching time : 0.17
36.09/36.11 c Solution :
36.09/36.11 c Solutions found : 1 (1 improvements)
36.09/36.11 c First Solution : +0.00000000000000e+00 (in run 1, after 123 nodes, 35.27 seconds, depth 83, found by <relaxation>)
36.09/36.11 c Primal Bound : +0.00000000000000e+00 (in run 1, after 123 nodes, 35.27 seconds, depth 83, found by <relaxation>)
36.09/36.11 c Dual Bound : +0.00000000000000e+00
36.09/36.11 c Gap : 0.00 %
36.09/36.11 c Root Dual Bound : +0.00000000000000e+00
36.09/36.11 c Root Iterations : 954
36.09/36.16 c Time complete: 36.14.