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-2666313-1276679418.opb>
0.05/0.05 c original problem has 2892 variables (2892 bin, 0 int, 0 impl, 0 cont) and 3094 constraints
0.05/0.05 c problem read
0.05/0.05 c No objective function, only one solution is needed.
0.05/0.05 c presolving settings loaded
0.05/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, 20336 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 20336 implications, 400 cliques
0.49/0.51 c presolved problem has 2892 variables (2892 bin, 0 int, 0 impl, 0 cont) and 3094 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 2492 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.25
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.79/0.81 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.81 c 0.6s| 1 | 0 | 709 | - | 13M| 0 | 329 |2892 |3094 |2892 |5586 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.69/3.73 c 3.2s| 1 | 0 | 829 | - | 14M| 0 | 338 |2892 |3094 |2892 |5614 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
5.09/5.15 c 4.6s| 1 | 0 | 945 | - | 16M| 0 | 360 |2892 |3094 |2892 |5625 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
6.49/6.56 c 6.0s| 1 | 0 | 1107 | - | 18M| 0 | 343 |2892 |3094 |2892 |5636 | 50 | 0 | 0 | 0.000000e+00 | -- | Inf
7.89/7.92 c 7.4s| 1 | 0 | 1210 | - | 20M| 0 | 353 |2892 |3094 |2892 |5647 | 61 | 0 | 0 | 0.000000e+00 | -- | Inf
9.39/9.48 c 8.9s| 1 | 0 | 1317 | - | 22M| 0 | 362 |2892 |3094 |2892 |5660 | 74 | 0 | 0 | 0.000000e+00 | -- | Inf
13.69/13.78 c 13.2s| 1 | 2 | 1317 | - | 22M| 0 | 362 |2892 |3094 |2892 |5660 | 74 | 0 | 11 | 0.000000e+00 | -- | Inf
39.48/39.58 c *38.7s| 93 | 0 | 4900 | 38.9 | 22M| 88 | - |2892 |3098 |2892 |1379 | 797 | 4 |1191 | 0.000000e+00 | 0.000000e+00 | 0.00%
39.48/39.59 c
39.48/39.59 c SCIP Status : problem is solved [optimal solution found]
39.48/39.59 c Solving Time (sec) : 38.73
39.48/39.59 c Solving Nodes : 93
39.48/39.59 c Primal Bound : +0.00000000000000e+00 (1 solutions)
39.48/39.59 c Dual Bound : +0.00000000000000e+00
39.48/39.59 c Gap : 0.00 %
39.48/39.60 s SATISFIABLE
39.48/39.60 v -x337 -x271 -x243 -x325 -x375 x334 -x247 -x395 -x360 -x303 -x396 -x330 -x295 -x298 -x296 x256 -x244 -x394 -x313 -x328 -x326 -x258
39.48/39.60 v x377 -x287 -x227 -x249 -x251 -x289 -x263 -x381 -x308 -x302 -x286 -x388 x226 -x348 -x354 -x364 -x230 -x301 -x266 x314 -x352
39.48/39.60 v -x272 -x365 x223 -x312 -x290 -x281 -x240 -x220 -x279 -x327 -x353 -x216 -x339 -x241 -x341 -x267 -x372 -x268 -x399 -x217 -x323
39.48/39.60 v -x345 -x340 -x285 -x269 x292 -x351 x213 -x305 -x232 -x333 -x382 -x342 -x306 -x336 x275 -x393 x390 -x273 -x233 -x284 -x212 -x347
39.48/39.60 v x283 -x384 -x355 x239 -x215 -x319 x309 -x356 -x209 -x260 -x242 -x224 -x218 -x252 -x304 -x282 -x277 -x254 x234 x386 -x207
39.48/39.60 v -x371 x288 x311 -x391 -x369 x318 x257 -x317 -x206 -x379 -x359 -x338 -x235 -x363 -x349 x324 -x361 -x367 -x400 -x246 x205 -x344
39.48/39.60 v x321 -x293 x259 -x208 x276 -x315 -x357 -x366 x261 -x307 -x329 -x385 -x237 x236 x358 -x398 -x378 x253 -x397 x362 -x383 -x387
39.48/39.60 v x203 -x335 -x310 -x274 -x270 -x248 -x225 x204 x214 x297 x231 -x211 -x392 -x316 x370 -x373 -x202 -x332 -x322 -x300 -x280 -x245
39.48/39.60 v x229 x219 x210 -x331 -x368 -x374 x255 -x250 -x238 -x294 -x350 x380 -x343 -x201 -x264 -x222 -x221 -x228 -x346 -x278 -x265 -x299
39.48/39.60 v -x262 -x376 -x389 -x320 -x291 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185
39.48/39.60 v -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 x169 -x168 -x167 -x166 -x165 -x164
39.48/39.60 v -x163 -x162 x161 x160 -x159 -x158 -x157 -x156 -x155 -x154 x153 -x152 -x151 x150 x149 x148 -x147 -x146 -x145 -x144 x143 -x142
39.48/39.60 v -x141 -x140 x139 x138 -x137 x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 x126 -x125 -x124 -x123 -x122 -x121
39.48/39.60 v -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104 x103 -x102 -x101 -x100 -x99
39.48/39.60 v -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 -x73
39.48/39.60 v -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
39.48/39.60 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
39.48/39.60 v -x19 x18 x17 x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
39.48/39.60 c SCIP Status : problem is solved [optimal solution found]
39.48/39.60 c Solving Time : 38.73
39.48/39.60 c Original Problem :
39.48/39.60 c Problem name : HOME/instance-2666313-1276679418.opb
39.48/39.60 c Variables : 2892 (2892 binary, 0 integer, 0 implicit integer, 0 continuous)
39.48/39.60 c Constraints : 3094 initial, 3094 maximal
39.48/39.60 c Presolved Problem :
39.48/39.60 c Problem name : t_HOME/instance-2666313-1276679418.opb
39.48/39.60 c Variables : 2892 (2892 binary, 0 integer, 0 implicit integer, 0 continuous)
39.48/39.60 c Constraints : 3094 initial, 3098 maximal
39.48/39.60 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
39.48/39.60 c trivial : 0.01 0 0 0 0 0 0 0 0
39.48/39.60 c dualfix : 0.00 0 0 0 0 0 0 0 0
39.48/39.60 c boundshift : 0.00 0 0 0 0 0 0 0 0
39.48/39.60 c inttobinary : 0.00 0 0 0 0 0 0 0 0
39.48/39.60 c implics : 0.00 0 0 0 0 0 0 0 0
39.48/39.60 c probing : 0.00 0 0 0 0 0 0 0 0
39.48/39.60 c knapsack : 0.00 0 0 0 0 0 0 0 0
39.48/39.60 c setppc : 0.01 0 0 0 0 0 0 0 0
39.48/39.60 c and : 0.19 0 0 0 0 0 0 0 0
39.48/39.60 c linear : 0.02 0 0 0 0 0 0 0 0
39.48/39.60 c logicor : 0.00 0 0 0 0 0 0 0 0
39.48/39.60 c root node : - 0 - - 0 - - - -
39.48/39.60 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
39.48/39.60 c integral : 0 0 0 113 0 0 34 0 0 176
39.48/39.60 c knapsack : 1 5 336 1 0 0 0 0 0 0
39.48/39.60 c setppc : 400 5 336 1 0 4 239 0 0 0
39.48/39.60 c and : 2492 93 332 1 0 0 2419 751 0 0
39.48/39.60 c linear : 1 5 332 1 0 0 0 0 0 0
39.48/39.60 c logicor : 200+ 5 102 1 0 0 37 0 0 0
39.48/39.60 c countsols : 0 0 0 1 0 0 0 0 0 0
39.48/39.60 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
39.48/39.60 c integral : 27.50 0.00 0.00 27.50 0.00
39.48/39.60 c knapsack : 0.06 0.05 0.01 0.00 0.00
39.48/39.60 c setppc : 0.00 0.00 0.00 0.00 0.00
39.48/39.60 c and : 0.12 0.07 0.05 0.00 0.00
39.48/39.60 c linear : 0.01 0.00 0.01 0.00 0.00
39.48/39.60 c logicor : 0.00 0.00 0.00 0.00 0.00
39.48/39.60 c countsols : 0.00 0.00 0.00 0.00 0.00
39.48/39.60 c Propagators : Time Calls Cutoffs DomReds
39.48/39.60 c vbounds : 0.00 1 0 0
39.48/39.60 c rootredcost : 0.00 0 0 0
39.48/39.60 c pseudoobj : 0.00 0 0 0
39.48/39.60 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
39.48/39.60 c propagation : 0.00 4 4 4 3.0 0 0.0 -
39.48/39.60 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
39.48/39.60 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
39.48/39.60 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
39.48/39.60 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
39.48/39.60 c applied globally : - - - 4 3.0 - - -
39.48/39.60 c applied locally : - - - 0 0.0 - - -
39.48/39.60 c Separators : Time Calls Cutoffs DomReds Cuts Conss
39.48/39.60 c cut pool : 0.01 4 - - 1 - (maximal pool size: 888)
39.48/39.60 c redcost : 0.02 93 0 0 0 0
39.48/39.60 c impliedbounds : 0.01 5 0 0 70 0
39.48/39.60 c intobj : 0.00 0 0 0 0 0
39.48/39.60 c cgmip : 0.00 0 0 0 0 0
39.48/39.60 c gomory : 4.50 5 0 0 179 0
39.48/39.60 c strongcg : 2.62 5 0 0 2500 0
39.48/39.60 c cmir : 0.00 0 0 0 0 0
39.48/39.60 c flowcover : 0.00 0 0 0 0 0
39.48/39.60 c clique : 0.08 5 0 0 35 0
39.48/39.60 c zerohalf : 0.00 0 0 0 0 0
39.48/39.60 c mcf : 0.01 1 0 0 0 0
39.48/39.60 c rapidlearning : 0.38 1 0 0 0 0
39.48/39.60 c Pricers : Time Calls Vars
39.48/39.60 c problem variables: 0.00 0 0
39.48/39.60 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
39.48/39.60 c relpscost : 27.50 112 0 34 0 0 176
39.48/39.60 c pscost : 0.00 0 0 0 0 0 0
39.48/39.60 c inference : 0.00 0 0 0 0 0 0
39.48/39.60 c mostinf : 0.00 0 0 0 0 0 0
39.48/39.60 c leastinf : 0.00 0 0 0 0 0 0
39.48/39.60 c fullstrong : 0.00 0 0 0 0 0 0
39.48/39.60 c allfullstrong : 0.00 0 0 0 0 0 0
39.48/39.60 c random : 0.00 0 0 0 0 0 0
39.48/39.60 c Primal Heuristics : Time Calls Found
39.48/39.60 c LP solutions : 0.00 - 1
39.48/39.60 c pseudo solutions : 0.00 - 0
39.48/39.60 c trivial : 0.00 1 0
39.48/39.60 c simplerounding : 0.00 0 0
39.48/39.60 c zirounding : 0.00 0 0
39.48/39.60 c rounding : 0.00 0 0
39.48/39.60 c shifting : 0.00 0 0
39.48/39.60 c intshifting : 0.00 0 0
39.48/39.60 c oneopt : 0.00 0 0
39.48/39.60 c twoopt : 0.00 0 0
39.48/39.60 c fixandinfer : 0.00 0 0
39.48/39.60 c feaspump : 0.00 0 0
39.48/39.60 c coefdiving : 0.00 0 0
39.48/39.60 c pscostdiving : 0.00 0 0
39.48/39.60 c fracdiving : 0.00 0 0
39.48/39.60 c veclendiving : 0.00 0 0
39.48/39.60 c intdiving : 0.00 0 0
39.48/39.60 c actconsdiving : 0.00 0 0
39.48/39.60 c objpscostdiving : 0.00 0 0
39.48/39.60 c rootsoldiving : 0.00 0 0
39.48/39.60 c linesearchdiving : 0.00 0 0
39.48/39.60 c guideddiving : 0.00 0 0
39.48/39.60 c octane : 0.00 0 0
39.48/39.60 c rens : 0.00 0 0
39.48/39.60 c rins : 0.00 0 0
39.48/39.60 c localbranching : 0.00 0 0
39.48/39.60 c mutation : 0.00 0 0
39.48/39.60 c crossover : 0.00 0 0
39.48/39.60 c dins : 0.00 0 0
39.48/39.60 c undercover : 0.00 0 0
39.48/39.60 c nlp : 0.00 0 0
39.48/39.60 c trysol : 0.00 0 0
39.48/39.60 c LP : Time Calls Iterations Iter/call Iter/sec
39.48/39.60 c primal LP : 0.15 0 0 0.00 0.00
39.48/39.60 c dual LP : 2.51 195 4900 25.13 1952.19
39.48/39.60 c lex dual LP : 0.00 0 0 0.00 -
39.48/39.60 c barrier LP : 0.00 0 0 0.00 -
39.48/39.60 c diving/probing LP: 0.00 0 0 0.00 -
39.48/39.60 c strong branching : 27.42 1191 52867 44.39 1928.05
39.48/39.60 c (at root node) : - 11 3634 330.36 -
39.48/39.60 c conflict analysis: 0.00 0 0 0.00 -
39.48/39.60 c B&B Tree :
39.48/39.60 c number of runs : 1
39.48/39.60 c nodes : 93
39.48/39.60 c nodes (total) : 93
39.48/39.60 c nodes left : 0
39.48/39.60 c max depth : 88
39.48/39.60 c max depth (total): 88
39.48/39.60 c backtracks : 0 (0.0%)
39.48/39.60 c delayed cutoffs : 0
39.48/39.60 c repropagations : 65 (30 domain reductions, 0 cutoffs)
39.48/39.60 c avg switch length: 3.31
39.48/39.60 c switching time : 0.20
39.48/39.60 c Solution :
39.48/39.60 c Solutions found : 1 (1 improvements)
39.48/39.60 c First Solution : +0.00000000000000e+00 (in run 1, after 93 nodes, 38.72 seconds, depth 88, found by <relaxation>)
39.48/39.60 c Primal Bound : +0.00000000000000e+00 (in run 1, after 93 nodes, 38.72 seconds, depth 88, found by <relaxation>)
39.48/39.60 c Dual Bound : +0.00000000000000e+00
39.48/39.60 c Gap : 0.00 %
39.48/39.60 c Root Dual Bound : +0.00000000000000e+00
39.48/39.60 c Root Iterations : 1317
39.58/39.64 c Time complete: 39.62.