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-2664899-1276680399.opb>
0.00/0.04 c original problem has 2928 variables (2928 bin, 0 int, 0 impl, 0 cont) and 3130 constraints
0.00/0.04 c problem read
0.00/0.04 c No objective function, only one solution is needed.
0.00/0.04 c presolving settings loaded
0.00/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, 20624 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 20624 implications, 400 cliques
0.49/0.50 c presolved problem has 2928 variables (2928 bin, 0 int, 0 impl, 0 cont) and 3130 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 2528 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.26
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.96
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.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.73 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.73 c 0.5s| 1 | 0 | 472 | - | 13M| 0 | 316 |2928 |3130 |2928 |5658 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.29/3.38 c 2.9s| 1 | 0 | 518 | - | 15M| 0 | 320 |2928 |3130 |2928 |5666 | 8 | 0 | 0 | 0.000000e+00 | -- | Inf
5.60/5.66 c 5.2s| 1 | 0 | 554 | - | 16M| 0 | 317 |2928 |3130 |2928 |5674 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
7.80/7.89 c 7.4s| 1 | 0 | 603 | - | 18M| 0 | 320 |2928 |3130 |2928 |5684 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
10.08/10.12 c 9.6s| 1 | 0 | 695 | - | 20M| 0 | 327 |2928 |3130 |2928 |5691 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
11.19/11.20 c 10.7s| 1 | 0 | 805 | - | 22M| 0 | 334 |2928 |3130 |2928 |5699 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
12.69/12.74 c 12.2s| 1 | 2 | 805 | - | 22M| 0 | 334 |2928 |3130 |2928 |5699 | 41 | 0 | 10 | 0.000000e+00 | -- | Inf
43.87/43.95 c *42.9s| 111 | 0 | 6885 | 55.3 | 23M| 81 | - |2928 |3133 |2928 |1183 |2141 | 3 |1130 | 0.000000e+00 | 0.000000e+00 | 0.00%
43.87/43.95 c
43.87/43.95 c SCIP Status : problem is solved [optimal solution found]
43.87/43.95 c Solving Time (sec) : 42.94
43.87/43.95 c Solving Nodes : 111
43.87/43.95 c Primal Bound : +0.00000000000000e+00 (1 solutions)
43.87/43.95 c Dual Bound : +0.00000000000000e+00
43.87/43.95 c Gap : 0.00 %
43.87/43.96 s SATISFIABLE
43.87/43.96 v -x385 -x378 x363 -x375 -x262 -x387 -x398 x331 -x303 -x394 -x240 -x255 -x271 x360 x239 -x350 -x260 -x283 -x370 -x297 x231 -x306
43.87/43.96 v -x334 -x292 -x356 -x323 x393 -x257 x349 -x388 -x305 -x301 x245 -x357 -x361 x220 -x241 -x230 -x296 x338 -x314 x310 x286 -x348
43.87/43.96 v -x312 -x246 -x329 -x307 x339 -x326 -x311 -x376 x337 -x300 -x218 -x217 -x365 -x244 -x226 -x256 -x358 -x284 -x335 -x364 -x319 -x293
43.87/43.96 v -x242 -x278 x396 x268 -x213 -x380 -x369 x346 -x281 -x395 -x327 -x373 -x330 -x308 -x333 -x397 -x270 -x263 x325 -x313 x351
43.87/43.96 v -x318 -x259 -x371 -x302 -x320 -x315 -x344 x209 -x383 x299 x252 x225 -x379 x359 -x392 x235 -x295 x219 -x264 -x279 -x275 -x304
43.87/43.96 v -x207 -x391 -x352 -x336 -x316 -x267 -x210 -x288 -x345 -x291 -x251 -x340 -x289 -x269 -x234 -x381 -x342 -x298 -x282 -x317 -x243
43.87/43.96 v -x390 x228 -x324 -x354 -x389 -x386 -x372 -x353 -x223 -x216 -x294 -x208 x224 -x236 -x214 x204 -x290 -x266 -x238 x254 x341 -x362
43.87/43.96 v x400 -x309 -x285 -x203 -x265 -x237 -x328 -x347 -x368 x253 -x384 x332 -x374 -x280 -x202 -x377 -x367 -x355 -x343 -x232 -x205
43.87/43.96 v -x206 -x215 -x287 -x229 x221 -x399 -x261 -x249 -x227 -x201 -x322 x272 -x258 -x248 -x247 x222 -x212 -x382 -x274 -x250 -x321
43.87/43.96 v -x233 x277 x273 -x211 x366 -x276 -x200 -x199 x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 x185
43.87/43.96 v x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 x167 -x166 -x165 -x164
43.87/43.96 v -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 x145 x144 -x143
43.87/43.96 v -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 x133 -x132 -x131 -x130 -x129 x128 -x127 -x126 -x125 x124 -x123 -x122 -x121
43.87/43.96 v -x120 x119 -x118 -x117 -x116 -x115 -x114 x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104 -x103 -x102 -x101 -x100
43.87/43.96 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
43.87/43.96 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
43.87/43.96 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
43.87/43.96 v -x19 -x18 -x17 x16 -x15 -x14 -x13 -x12 -x11 x10 -x9 -x8 x7 x6 -x5 -x4 -x3 x2 -x1
43.87/43.96 c SCIP Status : problem is solved [optimal solution found]
43.87/43.96 c Solving Time : 42.94
43.87/43.96 c Original Problem :
43.87/43.96 c Problem name : HOME/instance-2664899-1276680399.opb
43.87/43.96 c Variables : 2928 (2928 binary, 0 integer, 0 implicit integer, 0 continuous)
43.87/43.96 c Constraints : 3130 initial, 3130 maximal
43.87/43.96 c Presolved Problem :
43.87/43.96 c Problem name : t_HOME/instance-2664899-1276680399.opb
43.87/43.96 c Variables : 2928 (2928 binary, 0 integer, 0 implicit integer, 0 continuous)
43.87/43.96 c Constraints : 3130 initial, 3133 maximal
43.87/43.96 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
43.87/43.96 c trivial : 0.00 0 0 0 0 0 0 0 0
43.87/43.96 c dualfix : 0.00 0 0 0 0 0 0 0 0
43.87/43.96 c boundshift : 0.00 0 0 0 0 0 0 0 0
43.87/43.96 c inttobinary : 0.00 0 0 0 0 0 0 0 0
43.87/43.96 c implics : 0.00 0 0 0 0 0 0 0 0
43.87/43.96 c probing : 0.00 0 0 0 0 0 0 0 0
43.87/43.96 c knapsack : 0.00 0 0 0 0 0 0 0 0
43.87/43.96 c setppc : 0.01 0 0 0 0 0 0 0 0
43.87/43.96 c and : 0.19 0 0 0 0 0 0 0 0
43.87/43.96 c linear : 0.03 0 0 0 0 0 0 0 0
43.87/43.96 c logicor : 0.00 0 0 0 0 0 0 0 0
43.87/43.96 c root node : - 0 - - 0 - - - -
43.87/43.96 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
43.87/43.96 c integral : 0 0 0 124 0 0 20 0 0 214
43.87/43.96 c knapsack : 1 5 364 1 0 0 0 0 0 0
43.87/43.96 c setppc : 400 5 364 1 0 3 253 0 0 0
43.87/43.96 c and : 2528 112 361 1 0 0 2916 2104 0 0
43.87/43.96 c linear : 1 5 361 1 0 0 0 0 0 0
43.87/43.96 c logicor : 200+ 5 104 1 0 0 40 0 0 0
43.87/43.96 c countsols : 0 0 0 1 0 0 0 0 0 0
43.87/43.96 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
43.87/43.96 c integral : 23.33 0.00 0.00 23.33 0.00
43.87/43.96 c knapsack : 0.06 0.06 0.00 0.00 0.00
43.87/43.96 c setppc : 0.02 0.00 0.02 0.00 0.00
43.87/43.96 c and : 0.24 0.15 0.09 0.00 0.00
43.87/43.96 c linear : 0.03 0.00 0.03 0.00 0.00
43.87/43.96 c logicor : 0.00 0.00 0.00 0.00 0.00
43.87/43.96 c countsols : 0.00 0.00 0.00 0.00 0.00
43.87/43.96 c Propagators : Time Calls Cutoffs DomReds
43.87/43.96 c vbounds : 0.00 1 0 0
43.87/43.96 c rootredcost : 0.00 0 0 0
43.87/43.96 c pseudoobj : 0.00 0 0 0
43.87/43.96 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
43.87/43.96 c propagation : 0.00 3 3 3 3.0 0 0.0 -
43.87/43.96 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
43.87/43.96 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
43.87/43.96 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
43.87/43.96 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
43.87/43.96 c applied globally : - - - 3 3.0 - - -
43.87/43.96 c applied locally : - - - 0 0.0 - - -
43.87/43.96 c Separators : Time Calls Cutoffs DomReds Cuts Conss
43.87/43.96 c cut pool : 0.00 4 - - 1 - (maximal pool size: 988)
43.87/43.96 c redcost : 0.04 112 0 0 0 0
43.87/43.96 c impliedbounds : 0.00 5 0 0 16 0
43.87/43.96 c intobj : 0.00 0 0 0 0 0
43.87/43.96 c cgmip : 0.00 0 0 0 0 0
43.87/43.96 c gomory : 7.13 5 0 0 0 0
43.87/43.96 c strongcg : 2.20 5 0 0 2500 0
43.87/43.96 c cmir : 0.00 0 0 0 0 0
43.87/43.96 c flowcover : 0.00 0 0 0 0 0
43.87/43.96 c clique : 0.07 5 0 0 31 0
43.87/43.96 c zerohalf : 0.00 0 0 0 0 0
43.87/43.96 c mcf : 0.01 1 0 0 0 0
43.87/43.96 c rapidlearning : 0.36 1 0 0 0 0
43.87/43.96 c Pricers : Time Calls Vars
43.87/43.96 c problem variables: 0.00 0 0
43.87/43.96 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
43.87/43.96 c relpscost : 23.33 123 0 20 0 0 214
43.87/43.96 c pscost : 0.00 0 0 0 0 0 0
43.87/43.96 c inference : 0.00 0 0 0 0 0 0
43.87/43.96 c mostinf : 0.00 0 0 0 0 0 0
43.87/43.96 c leastinf : 0.00 0 0 0 0 0 0
43.87/43.96 c fullstrong : 0.00 0 0 0 0 0 0
43.87/43.96 c allfullstrong : 0.00 0 0 0 0 0 0
43.87/43.96 c random : 0.00 0 0 0 0 0 0
43.87/43.96 c Primal Heuristics : Time Calls Found
43.87/43.96 c LP solutions : 0.00 - 1
43.87/43.96 c pseudo solutions : 0.00 - 0
43.87/43.96 c trivial : 0.01 1 0
43.87/43.96 c simplerounding : 0.00 0 0
43.87/43.96 c zirounding : 0.00 0 0
43.87/43.96 c rounding : 0.00 0 0
43.87/43.96 c shifting : 0.00 0 0
43.87/43.96 c intshifting : 0.00 0 0
43.87/43.96 c oneopt : 0.00 0 0
43.87/43.96 c twoopt : 0.00 0 0
43.87/43.96 c fixandinfer : 0.00 0 0
43.87/43.96 c feaspump : 0.00 0 0
43.87/43.96 c coefdiving : 0.00 0 0
43.87/43.96 c pscostdiving : 0.00 0 0
43.87/43.96 c fracdiving : 0.00 0 0
43.87/43.96 c veclendiving : 0.00 0 0
43.87/43.96 c intdiving : 0.00 0 0
43.87/43.96 c actconsdiving : 0.00 0 0
43.87/43.96 c objpscostdiving : 0.00 0 0
43.87/43.96 c rootsoldiving : 0.00 0 0
43.87/43.96 c linesearchdiving : 0.00 0 0
43.87/43.96 c guideddiving : 0.00 0 0
43.87/43.96 c octane : 0.00 0 0
43.87/43.96 c rens : 0.00 0 0
43.87/43.96 c rins : 0.00 0 0
43.87/43.96 c localbranching : 0.00 0 0
43.87/43.96 c mutation : 0.00 0 0
43.87/43.96 c crossover : 0.00 0 0
43.87/43.96 c dins : 0.00 0 0
43.87/43.96 c undercover : 0.00 0 0
43.87/43.96 c nlp : 0.00 0 0
43.87/43.96 c trysol : 0.00 0 0
43.87/43.96 c LP : Time Calls Iterations Iter/call Iter/sec
43.87/43.96 c primal LP : 2.77 0 0 0.00 0.00
43.87/43.96 c dual LP : 5.98 236 6885 29.17 1151.34
43.87/43.96 c lex dual LP : 0.00 0 0 0.00 -
43.87/43.96 c barrier LP : 0.00 0 0 0.00 -
43.87/43.96 c diving/probing LP: 0.00 0 0 0.00 -
43.87/43.96 c strong branching : 23.30 1130 68528 60.64 2941.12
43.87/43.96 c (at root node) : - 10 1673 167.30 -
43.87/43.96 c conflict analysis: 0.00 0 0 0.00 -
43.87/43.96 c B&B Tree :
43.87/43.96 c number of runs : 1
43.87/43.96 c nodes : 111
43.87/43.96 c nodes (total) : 111
43.87/43.96 c nodes left : 0
43.87/43.96 c max depth : 81
43.87/43.96 c max depth (total): 81
43.87/43.96 c backtracks : 2 (1.8%)
43.87/43.96 c delayed cutoffs : 0
43.87/43.96 c repropagations : 62 (28 domain reductions, 0 cutoffs)
43.87/43.96 c avg switch length: 3.08
43.87/43.96 c switching time : 2.83
43.87/43.96 c Solution :
43.87/43.96 c Solutions found : 1 (1 improvements)
43.87/43.96 c First Solution : +0.00000000000000e+00 (in run 1, after 111 nodes, 42.93 seconds, depth 81, found by <relaxation>)
43.87/43.96 c Primal Bound : +0.00000000000000e+00 (in run 1, after 111 nodes, 42.93 seconds, depth 81, found by <relaxation>)
43.87/43.96 c Dual Bound : +0.00000000000000e+00
43.87/43.96 c Gap : 0.00 %
43.87/43.96 c Root Dual Bound : +0.00000000000000e+00
43.87/43.96 c Root Iterations : 805
0.00/44.00 c Time complete: 43.97.