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-2664862-1276677654.opb>
0.00/0.04 c original problem has 2882 variables (2882 bin, 0 int, 0 impl, 0 cont) and 3084 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.07 c presolving:
0.19/0.29 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 20256 impls, 400 clqs
0.39/0.47 c presolving (2 rounds):
0.39/0.47 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.47 c 20256 implications, 400 cliques
0.39/0.47 c presolved problem has 2882 variables (2882 bin, 0 int, 0 impl, 0 cont) and 3084 constraints
0.39/0.47 c 1 constraints of type <knapsack>
0.39/0.47 c 400 constraints of type <setppc>
0.39/0.47 c 2482 constraints of type <and>
0.39/0.47 c 1 constraints of type <linear>
0.39/0.47 c 200 constraints of type <logicor>
0.39/0.47 c transformed objective value is always integral (scale: 1)
0.39/0.47 c Presolving Time: 0.23
0.39/0.47 c - non default parameters ----------------------------------------------------------------------
0.39/0.47 c # SCIP version 1.2.1.2
0.39/0.47 c
0.39/0.47 c # frequency for displaying node information lines
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.47 c display/freq = 10000
0.39/0.47 c
0.39/0.47 c # maximal time in seconds to run
0.39/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.47 c limits/time = 1799.96
0.39/0.47 c
0.39/0.47 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.47 c limits/memory = 1620
0.39/0.47 c
0.39/0.47 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.47 c limits/solutions = 1
0.39/0.47 c
0.39/0.47 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.47 c separating/maxrounds = 1
0.39/0.47 c
0.39/0.47 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.47 c separating/maxroundsroot = 5
0.39/0.47 c
0.39/0.47 c # should presolving try to simplify inequalities
0.39/0.47 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.47 c constraints/linear/simplifyinequalities = TRUE
0.39/0.47 c
0.39/0.47 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.47 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.47 c constraints/knapsack/disaggregation = FALSE
0.39/0.47 c
0.39/0.47 c # should presolving try to simplify knapsacks
0.39/0.47 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.47 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.47 c
0.39/0.47 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.47 c presolving/probing/maxrounds = 0
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47 c heuristics/coefdiving/freq = -1
0.39/0.47 c
0.39/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.47 c
0.39/0.47 c # additional number of allowed LP iterations
0.39/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.47 c heuristics/crossover/freq = -1
0.39/0.47 c
0.39/0.47 c # number of nodes added to the contingent of the total nodes
0.39/0.47 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.47 c heuristics/crossover/nodesofs = 750
0.39/0.47 c
0.39/0.47 c # number of nodes without incumbent change that heuristic should wait
0.39/0.47 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.47 c heuristics/crossover/nwaitingnodes = 100
0.39/0.47 c
0.39/0.47 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.47 c # [type: real, range: [0,1], default: 0.1]
0.39/0.47 c heuristics/crossover/nodesquot = 0.15
0.39/0.47 c
0.39/0.47 c # minimum percentage of integer variables that have to be fixed
0.39/0.47 c # [type: real, range: [0,1], default: 0.666]
0.39/0.47 c heuristics/crossover/minfixingrate = 0.5
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.47 c heuristics/feaspump/freq = -1
0.39/0.47 c
0.39/0.47 c # additional number of allowed LP iterations
0.39/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47 c heuristics/fracdiving/freq = -1
0.39/0.47 c
0.39/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.47 c
0.39/0.47 c # additional number of allowed LP iterations
0.39/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47 c heuristics/guideddiving/freq = -1
0.39/0.47 c
0.39/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.47 c
0.39/0.47 c # additional number of allowed LP iterations
0.39/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.47 c
0.39/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47 c heuristics/intshifting/freq = -1
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47 c heuristics/linesearchdiving/freq = -1
0.39/0.47 c
0.39/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.47 c
0.39/0.47 c # additional number of allowed LP iterations
0.39/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47 c heuristics/nlp/freq = -1
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.47 c heuristics/objpscostdiving/freq = -1
0.39/0.47 c
0.39/0.47 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.47 c # [type: real, range: [0,1], default: 0.01]
0.39/0.47 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.47 c
0.39/0.47 c # additional number of allowed LP iterations
0.39/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47 c heuristics/oneopt/freq = -1
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47 c heuristics/pscostdiving/freq = -1
0.39/0.47 c
0.39/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.47 c
0.39/0.47 c # additional number of allowed LP iterations
0.39/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.47 c heuristics/rens/freq = -1
0.39/0.47 c
0.39/0.47 c # minimum percentage of integer variables that have to be fixable
0.39/0.47 c # [type: real, range: [0,1], default: 0.5]
0.39/0.47 c heuristics/rens/minfixingrate = 0.3
0.39/0.47 c
0.39/0.47 c # number of nodes added to the contingent of the total nodes
0.39/0.47 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.47 c heuristics/rens/nodesofs = 2000
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.47 c heuristics/rootsoldiving/freq = -1
0.39/0.47 c
0.39/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.47 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.47 c
0.39/0.47 c # additional number of allowed LP iterations
0.39/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47 c heuristics/rounding/freq = -1
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47 c heuristics/shifting/freq = -1
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47 c heuristics/simplerounding/freq = -1
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.47 c heuristics/trivial/freq = -1
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47 c heuristics/trysol/freq = -1
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47 c heuristics/veclendiving/freq = -1
0.39/0.47 c
0.39/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.47 c
0.39/0.47 c # additional number of allowed LP iterations
0.39/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.47 c
0.39/0.47 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47 c heuristics/zirounding/freq = -1
0.39/0.47 c
0.39/0.47 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.47 c separating/cmir/freq = -1
0.39/0.47 c
0.39/0.47 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.47 c separating/flowcover/freq = -1
0.39/0.47 c
0.39/0.47 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.47 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.47 c separating/rapidlearning/freq = 0
0.39/0.47 c
0.39/0.47 c -----------------------------------------------------------------------------------------------
0.39/0.47 c start solving
0.39/0.47 c
0.59/0.67 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.67 c 0.4s| 1 | 0 | 423 | - | 13M| 0 | 275 |2882 |3084 |2882 |5566 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.79/2.89 c 2.5s| 1 | 0 | 471 | - | 14M| 0 | 275 |2882 |3084 |2882 |5572 | 6 | 0 | 0 | 0.000000e+00 | -- | Inf
4.59/4.60 c 4.2s| 1 | 0 | 539 | - | 16M| 0 | 293 |2882 |3084 |2882 |5579 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
6.49/6.50 c 6.0s| 1 | 0 | 582 | - | 18M| 0 | 290 |2882 |3084 |2882 |5586 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
8.49/8.52 c 8.1s| 1 | 0 | 650 | - | 20M| 0 | 303 |2882 |3084 |2882 |5591 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
10.59/10.60 c 10.1s| 1 | 0 | 741 | - | 22M| 0 | 320 |2882 |3084 |2882 |5598 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
11.49/11.51 c 11.0s| 1 | 2 | 741 | - | 22M| 0 | 320 |2882 |3084 |2882 |5598 | 32 | 0 | 10 | 0.000000e+00 | -- | Inf
24.58/24.62 c *24.1s| 81 | 0 | 3431 | 33.6 | 22M| 74 | - |2882 |3089 |2882 |1141 |1169 | 5 | 945 | 0.000000e+00 | 0.000000e+00 | 0.00%
24.58/24.62 c
24.58/24.62 c SCIP Status : problem is solved [optimal solution found]
24.58/24.62 c Solving Time (sec) : 24.07
24.58/24.62 c Solving Nodes : 81
24.58/24.62 c Primal Bound : +0.00000000000000e+00 (1 solutions)
24.58/24.62 c Dual Bound : +0.00000000000000e+00
24.58/24.62 c Gap : 0.00 %
24.58/24.63 s SATISFIABLE
24.58/24.63 v x313 -x342 -x248 x392 -x390 -x358 -x297 -x348 -x254 -x386 -x286 -x345 -x376 x231 -x294 -x280 x360 x382 -x332 -x255 -x323 -x321
24.58/24.63 v x359 -x343 -x224 -x353 x256 -x391 -x239 -x237 -x300 -x370 -x349 -x335 -x305 -x317 x377 x395 x361 -x367 -x299 -x267 -x238 -x352
24.58/24.63 v -x233 -x218 -x283 -x269 -x344 -x388 -x217 -x289 -x380 -x356 x322 x216 -x339 -x319 x312 -x246 -x350 -x347 -x249 -x271 -x272
24.58/24.63 v -x329 -x308 x284 -x307 -x366 -x354 -x334 -x275 x310 -x372 -x232 x362 -x315 x236 -x241 -x220 -x290 x281 x375 -x262 x302 -x253
24.58/24.63 v -x318 -x303 -x298 -x210 -x234 x295 x213 -x340 -x245 -x261 -x400 x355 -x252 x389 -x379 -x277 -x208 -x276 x266 -x219 -x351 -x244
24.58/24.63 v -x365 -x215 x346 x207 -x301 x264 -x235 -x314 -x247 -x328 -x285 -x326 x306 -x206 -x398 -x288 -x279 -x278 -x265 -x258 -x242 -x226
24.58/24.63 v -x282 -x397 -x357 -x381 -x292 -x214 -x205 -x393 -x311 -x296 -x274 x240 -x225 -x221 -x371 -x325 -x338 -x385 -x320 -x374 -x399
24.58/24.63 v x309 x209 -x257 -x270 -x259 -x223 x330 -x203 -x396 -x273 -x251 x243 -x204 x268 x324 -x263 -x331 -x383 -x230 -x368 -x369
24.58/24.63 v x212 -x202 x211 -x337 -x373 -x227 -x341 -x327 x364 -x260 -x291 -x228 -x363 -x201 -x333 -x304 -x229 -x222 -x250 -x293 -x387 -x336
24.58/24.63 v -x394 -x316 x378 -x287 -x384 -x200 -x199 -x198 -x197 x196 -x195 x194 -x193 -x192 -x191 -x190 -x189 -x188 x187 -x186 -x185
24.58/24.63 v -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 x173 -x172 -x171 -x170 x169 x168 -x167 -x166 -x165 -x164 -x163
24.58/24.63 v -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 x151 -x150 x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142
24.58/24.63 v -x141 -x140 -x139 -x138 -x137 x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121
24.58/24.63 v -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100
24.58/24.63 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
24.58/24.63 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
24.58/24.63 v -x47 -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
24.58/24.63 v -x20 x19 x18 x17 -x16 x15 x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 x6 x5 -x4 -x3 -x2 x1
24.58/24.63 c SCIP Status : problem is solved [optimal solution found]
24.58/24.63 c Solving Time : 24.07
24.58/24.63 c Original Problem :
24.58/24.63 c Problem name : HOME/instance-2664862-1276677654.opb
24.58/24.63 c Variables : 2882 (2882 binary, 0 integer, 0 implicit integer, 0 continuous)
24.58/24.63 c Constraints : 3084 initial, 3084 maximal
24.58/24.63 c Presolved Problem :
24.58/24.63 c Problem name : t_HOME/instance-2664862-1276677654.opb
24.58/24.63 c Variables : 2882 (2882 binary, 0 integer, 0 implicit integer, 0 continuous)
24.58/24.63 c Constraints : 3084 initial, 3089 maximal
24.58/24.63 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
24.58/24.63 c trivial : 0.01 0 0 0 0 0 0 0 0
24.58/24.63 c dualfix : 0.00 0 0 0 0 0 0 0 0
24.58/24.63 c boundshift : 0.00 0 0 0 0 0 0 0 0
24.58/24.63 c inttobinary : 0.00 0 0 0 0 0 0 0 0
24.58/24.63 c implics : 0.00 0 0 0 0 0 0 0 0
24.58/24.63 c probing : 0.00 0 0 0 0 0 0 0 0
24.58/24.63 c knapsack : 0.01 0 0 0 0 0 0 0 0
24.58/24.63 c setppc : 0.00 0 0 0 0 0 0 0 0
24.58/24.63 c and : 0.17 0 0 0 0 0 0 0 0
24.58/24.63 c linear : 0.02 0 0 0 0 0 0 0 0
24.58/24.63 c logicor : 0.01 0 0 0 0 0 0 0 0
24.58/24.63 c root node : - 0 - - 0 - - - -
24.58/24.63 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
24.58/24.63 c integral : 0 0 0 90 0 0 15 0 0 148
24.58/24.63 c knapsack : 1 5 320 4 0 0 0 0 0 0
24.58/24.63 c setppc : 400 5 320 4 0 5 271 0 0 0
24.58/24.63 c and : 2482 80 315 4 0 0 2436 1139 0 0
24.58/24.63 c linear : 1 5 315 1 0 0 0 0 0 0
24.58/24.63 c logicor : 200+ 5 95 1 0 0 31 0 0 0
24.58/24.63 c countsols : 0 0 0 1 0 0 0 0 0 0
24.58/24.63 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
24.58/24.63 c integral : 9.91 0.00 0.00 9.91 0.00
24.58/24.63 c knapsack : 0.06 0.05 0.01 0.00 0.00
24.58/24.63 c setppc : 0.00 0.00 0.00 0.00 0.00
24.58/24.63 c and : 0.08 0.05 0.03 0.00 0.00
24.58/24.63 c linear : 0.01 0.00 0.01 0.00 0.00
24.58/24.63 c logicor : 0.00 0.00 0.00 0.00 0.00
24.58/24.63 c countsols : 0.00 0.00 0.00 0.00 0.00
24.58/24.63 c Propagators : Time Calls Cutoffs DomReds
24.58/24.63 c vbounds : 0.00 1 0 0
24.58/24.63 c rootredcost : 0.00 0 0 0
24.58/24.63 c pseudoobj : 0.00 0 0 0
24.58/24.63 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
24.58/24.63 c propagation : 0.00 5 5 5 3.0 0 0.0 -
24.58/24.63 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
24.58/24.63 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
24.58/24.63 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
24.58/24.63 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
24.58/24.63 c applied globally : - - - 5 3.0 - - -
24.58/24.63 c applied locally : - - - 0 0.0 - - -
24.58/24.63 c Separators : Time Calls Cutoffs DomReds Cuts Conss
24.58/24.63 c cut pool : 0.01 4 - - 2 - (maximal pool size: 930)
24.58/24.63 c redcost : 0.01 80 0 0 0 0
24.58/24.63 c impliedbounds : 0.01 5 0 0 8 0
24.58/24.63 c intobj : 0.00 0 0 0 0 0
24.58/24.63 c cgmip : 0.00 0 0 0 0 0
24.58/24.63 c gomory : 7.15 5 0 0 0 0
24.58/24.63 c strongcg : 1.76 5 0 0 2500 0
24.58/24.63 c cmir : 0.00 0 0 0 0 0
24.58/24.63 c flowcover : 0.00 0 0 0 0 0
24.58/24.63 c clique : 0.05 5 0 0 31 0
24.58/24.63 c zerohalf : 0.00 0 0 0 0 0
24.58/24.63 c mcf : 0.01 1 0 0 0 0
24.58/24.63 c rapidlearning : 0.36 1 0 0 0 0
24.58/24.63 c Pricers : Time Calls Vars
24.58/24.63 c problem variables: 0.00 0 0
24.58/24.63 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
24.58/24.63 c relpscost : 9.91 86 0 15 0 0 148
24.58/24.63 c pscost : 0.00 0 0 0 0 0 0
24.58/24.63 c inference : 0.00 0 0 0 0 0 0
24.58/24.63 c mostinf : 0.00 0 0 0 0 0 0
24.58/24.63 c leastinf : 0.00 0 0 0 0 0 0
24.58/24.63 c fullstrong : 0.00 0 0 0 0 0 0
24.58/24.63 c allfullstrong : 0.00 0 0 0 0 0 0
24.58/24.63 c random : 0.00 0 0 0 0 0 0
24.58/24.63 c Primal Heuristics : Time Calls Found
24.58/24.63 c LP solutions : 0.00 - 1
24.58/24.63 c pseudo solutions : 0.00 - 0
24.58/24.63 c trivial : 0.00 1 0
24.58/24.63 c simplerounding : 0.00 0 0
24.58/24.63 c zirounding : 0.00 0 0
24.58/24.63 c rounding : 0.00 0 0
24.58/24.63 c shifting : 0.00 0 0
24.58/24.63 c intshifting : 0.00 0 0
24.58/24.63 c oneopt : 0.00 0 0
24.58/24.63 c twoopt : 0.00 0 0
24.58/24.63 c fixandinfer : 0.00 0 0
24.58/24.63 c feaspump : 0.00 0 0
24.58/24.63 c coefdiving : 0.00 0 0
24.58/24.63 c pscostdiving : 0.00 0 0
24.58/24.63 c fracdiving : 0.00 0 0
24.58/24.63 c veclendiving : 0.00 0 0
24.58/24.63 c intdiving : 0.00 0 0
24.58/24.63 c actconsdiving : 0.00 0 0
24.58/24.63 c objpscostdiving : 0.00 0 0
24.58/24.63 c rootsoldiving : 0.00 0 0
24.58/24.63 c linesearchdiving : 0.00 0 0
24.58/24.63 c guideddiving : 0.00 0 0
24.58/24.63 c octane : 0.00 0 0
24.58/24.63 c rens : 0.00 0 0
24.58/24.63 c rins : 0.00 0 0
24.58/24.63 c localbranching : 0.00 0 0
24.58/24.63 c mutation : 0.00 0 0
24.58/24.63 c crossover : 0.00 0 0
24.58/24.63 c dins : 0.00 0 0
24.58/24.63 c undercover : 0.00 0 0
24.58/24.63 c nlp : 0.00 0 0
24.58/24.63 c trysol : 0.00 0 0
24.58/24.63 c LP : Time Calls Iterations Iter/call Iter/sec
24.58/24.63 c primal LP : 1.34 0 0 0.00 0.00
24.58/24.63 c dual LP : 2.71 171 3431 20.06 1266.05
24.58/24.63 c lex dual LP : 0.00 0 0 0.00 -
24.58/24.63 c barrier LP : 0.00 0 0 0.00 -
24.58/24.63 c diving/probing LP: 0.00 0 0 0.00 -
24.58/24.63 c strong branching : 9.88 945 33280 35.22 3368.42
24.58/24.63 c (at root node) : - 10 1109 110.90 -
24.58/24.63 c conflict analysis: 0.00 0 0 0.00 -
24.58/24.63 c B&B Tree :
24.58/24.63 c number of runs : 1
24.58/24.63 c nodes : 81
24.58/24.63 c nodes (total) : 81
24.58/24.63 c nodes left : 0
24.58/24.63 c max depth : 74
24.58/24.63 c max depth (total): 74
24.58/24.63 c backtracks : 0 (0.0%)
24.58/24.63 c delayed cutoffs : 0
24.58/24.63 c repropagations : 95 (49 domain reductions, 0 cutoffs)
24.58/24.63 c avg switch length: 4.22
24.58/24.63 c switching time : 1.40
24.58/24.63 c Solution :
24.58/24.63 c Solutions found : 1 (1 improvements)
24.58/24.63 c First Solution : +0.00000000000000e+00 (in run 1, after 81 nodes, 24.06 seconds, depth 74, found by <relaxation>)
24.58/24.63 c Primal Bound : +0.00000000000000e+00 (in run 1, after 81 nodes, 24.06 seconds, depth 74, found by <relaxation>)
24.58/24.63 c Dual Bound : +0.00000000000000e+00
24.58/24.63 c Gap : 0.00 %
24.58/24.63 c Root Dual Bound : +0.00000000000000e+00
24.58/24.63 c Root Iterations : 741
24.58/24.67 c Time complete: 24.66.