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-2664874-1276679025.opb>
0.04/0.04 c original problem has 2888 variables (2888 bin, 0 int, 0 impl, 0 cont) and 3090 constraints
0.04/0.04 c problem read
0.04/0.04 c No objective function, only one solution is needed.
0.04/0.04 c presolving settings loaded
0.04/0.08 c presolving:
0.29/0.30 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.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 20304 implications, 400 cliques
0.49/0.50 c presolved problem has 2888 variables (2888 bin, 0 int, 0 impl, 0 cont) and 3090 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 2488 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.22
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.50 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/coefdiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/coefdiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/coefdiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 30]
0.49/0.50 c heuristics/crossover/freq = -1
0.49/0.50 c
0.49/0.50 c # number of nodes added to the contingent of the total nodes
0.49/0.50 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.50 c heuristics/crossover/nodesofs = 750
0.49/0.50 c
0.49/0.50 c # number of nodes without incumbent change that heuristic should wait
0.49/0.50 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.49/0.50 c heuristics/crossover/nwaitingnodes = 100
0.49/0.50 c
0.49/0.50 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.49/0.50 c # [type: real, range: [0,1], default: 0.1]
0.49/0.50 c heuristics/crossover/nodesquot = 0.15
0.49/0.50 c
0.49/0.50 c # minimum percentage of integer variables that have to be fixed
0.49/0.50 c # [type: real, range: [0,1], default: 0.666]
0.49/0.50 c heuristics/crossover/minfixingrate = 0.5
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.50 c heuristics/feaspump/freq = -1
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/feaspump/maxlpiterofs = 2000
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/fracdiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/fracdiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/fracdiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/guideddiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/guideddiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/guideddiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/intdiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/intshifting/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/linesearchdiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50 c heuristics/nlp/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.50 c heuristics/objpscostdiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to total iteration number
0.49/0.50 c # [type: real, range: [0,1], default: 0.01]
0.49/0.50 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50 c heuristics/oneopt/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/pscostdiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/pscostdiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.50 c heuristics/rens/freq = -1
0.49/0.50 c
0.49/0.50 c # minimum percentage of integer variables that have to be fixable
0.49/0.50 c # [type: real, range: [0,1], default: 0.5]
0.49/0.50 c heuristics/rens/minfixingrate = 0.3
0.49/0.50 c
0.49/0.50 c # number of nodes added to the contingent of the total nodes
0.49/0.50 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.50 c heuristics/rens/nodesofs = 2000
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.50 c heuristics/rootsoldiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.49/0.50 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50 c heuristics/rounding/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/shifting/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50 c heuristics/simplerounding/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.50 c heuristics/trivial/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50 c heuristics/trysol/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50 c heuristics/veclendiving/freq = -1
0.49/0.50 c
0.49/0.50 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50 c heuristics/veclendiving/maxlpiterquot = 0.075
0.49/0.50 c
0.49/0.50 c # additional number of allowed LP iterations
0.49/0.50 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50 c heuristics/veclendiving/maxlpiterofs = 1500
0.49/0.50 c
0.49/0.50 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50 c heuristics/zirounding/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.50 c separating/cmir/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.50 c separating/flowcover/freq = -1
0.49/0.50 c
0.49/0.50 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.49/0.50 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.50 c separating/rapidlearning/freq = 0
0.49/0.50 c
0.49/0.50 c -----------------------------------------------------------------------------------------------
0.49/0.50 c start solving
0.49/0.50 c
0.58/0.69 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.58/0.69 c 0.4s| 1 | 0 | 410 | - | 13M| 0 | 279 |2888 |3090 |2888 |5578 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.09/3.13 c 2.6s| 1 | 0 | 447 | - | 14M| 0 | 285 |2888 |3090 |2888 |5583 | 5 | 0 | 0 | 0.000000e+00 | -- | Inf
5.09/5.15 c 4.6s| 1 | 0 | 502 | - | 17M| 0 | 279 |2888 |3090 |2888 |5590 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
6.88/6.95 c 6.4s| 1 | 0 | 583 | - | 18M| 0 | 294 |2888 |3090 |2888 |5600 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
8.98/9.04 c 8.5s| 1 | 0 | 662 | - | 20M| 0 | 295 |2888 |3090 |2888 |5605 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
11.28/11.32 c 10.8s| 1 | 0 | 781 | - | 23M| 0 | 291 |2888 |3090 |2888 |5613 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
12.78/12.81 c 12.2s| 1 | 2 | 781 | - | 23M| 0 | 291 |2888 |3090 |2888 |5613 | 35 | 0 | 10 | 0.000000e+00 | -- | Inf
68.47/68.58 c *67.3s| 244 | 0 | 17545 | 69.0 | 23M| 78 | - |2888 |3093 |2888 |1159 |5039 | 3 |1490 | 0.000000e+00 | 0.000000e+00 | 0.00%
68.47/68.58 c
68.47/68.58 c SCIP Status : problem is solved [optimal solution found]
68.47/68.58 c Solving Time (sec) : 67.33
68.47/68.58 c Solving Nodes : 244
68.47/68.58 c Primal Bound : +0.00000000000000e+00 (1 solutions)
68.47/68.58 c Dual Bound : +0.00000000000000e+00
68.47/68.58 c Gap : 0.00 %
68.47/68.59 s SATISFIABLE
68.47/68.59 v -x364 -x366 -x370 -x297 -x268 -x312 -x330 -x310 -x388 x395 x260 -x319 -x263 -x331 -x276 -x300 -x373 -x374 -x358 -x250 -x380 -x356
68.47/68.59 v -x292 -x315 -x361 x332 -x293 -x281 -x378 -x371 -x247 -x321 -x233 -x359 -x383 -x223 -x397 -x339 -x266 -x264 -x322 -x240 -x313
68.47/68.59 v x352 -x326 -x257 -x218 -x367 -x280 -x234 -x344 x285 -x333 x311 -x306 x277 -x219 -x363 -x379 -x385 -x389 -x232 -x290 -x355
68.47/68.59 v x228 -x246 -x214 -x221 -x216 -x302 -x252 -x345 -x335 -x213 -x301 -x294 -x251 x235 -x350 -x336 -x244 -x382 -x381 -x384 -x304 -x328
68.47/68.59 v x275 -x217 -x261 -x308 -x222 x299 -x354 -x230 x210 -x329 -x357 -x284 -x346 -x227 -x398 -x314 -x209 -x396 -x365 x270 -x392
68.47/68.59 v -x327 -x307 -x267 -x254 -x317 -x320 x318 -x287 x220 x243 -x212 x351 -x309 x271 -x334 -x278 -x368 x372 x272 -x305 x206 x236
68.47/68.59 v -x211 x387 -x237 -x298 x249 -x238 -x225 -x390 -x400 -x283 -x205 x324 -x303 -x245 -x229 -x323 -x353 -x282 -x348 -x289 -x393 x349
68.47/68.59 v x295 -x204 x360 x342 -x256 x291 x279 -x362 x207 -x375 -x337 x215 -x255 -x399 -x288 -x231 x208 -x269 -x338 -x286 -x248 -x274
68.47/68.59 v -x239 -x343 -x316 x391 -x253 -x224 -x296 -x376 x242 -x203 x340 -x394 x325 -x259 -x201 x262 -x258 -x265 -x202 x377 -x273 -x341
68.47/68.59 v -x226 -x241 -x369 -x386 -x347 -x200 -x199 -x198 -x197 -x196 -x195 x194 -x193 x192 -x191 -x190 x189 -x188 -x187 -x186 -x185
68.47/68.59 v -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164
68.47/68.59 v -x163 -x162 -x161 -x160 -x159 x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143
68.47/68.59 v -x142 x141 -x140 -x139 x138 -x137 x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 x127 -x126 -x125 -x124 -x123 -x122 x121
68.47/68.59 v -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108 -x107 -x106 -x105 -x104 -x103 x102 x101 -x100
68.47/68.59 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
68.47/68.59 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
68.47/68.59 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
68.47/68.59 v -x19 -x18 -x17 x16 -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 x3 -x2 -x1
68.47/68.59 c SCIP Status : problem is solved [optimal solution found]
68.47/68.59 c Solving Time : 67.33
68.47/68.59 c Original Problem :
68.47/68.59 c Problem name : HOME/instance-2664874-1276679025.opb
68.47/68.59 c Variables : 2888 (2888 binary, 0 integer, 0 implicit integer, 0 continuous)
68.47/68.59 c Constraints : 3090 initial, 3090 maximal
68.47/68.59 c Presolved Problem :
68.47/68.59 c Problem name : t_HOME/instance-2664874-1276679025.opb
68.47/68.59 c Variables : 2888 (2888 binary, 0 integer, 0 implicit integer, 0 continuous)
68.47/68.59 c Constraints : 3090 initial, 3093 maximal
68.47/68.59 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
68.47/68.59 c trivial : 0.00 0 0 0 0 0 0 0 0
68.47/68.59 c dualfix : 0.01 0 0 0 0 0 0 0 0
68.47/68.59 c boundshift : 0.00 0 0 0 0 0 0 0 0
68.47/68.59 c inttobinary : 0.00 0 0 0 0 0 0 0 0
68.47/68.59 c implics : 0.00 0 0 0 0 0 0 0 0
68.47/68.59 c probing : 0.00 0 0 0 0 0 0 0 0
68.47/68.59 c knapsack : 0.01 0 0 0 0 0 0 0 0
68.47/68.59 c setppc : 0.01 0 0 0 0 0 0 0 0
68.47/68.59 c and : 0.15 0 0 0 0 0 0 0 0
68.47/68.59 c linear : 0.03 0 0 0 0 0 0 0 0
68.47/68.59 c logicor : 0.00 0 0 0 0 0 0 0 0
68.47/68.59 c root node : - 0 - - 0 - - - -
68.47/68.59 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
68.47/68.59 c integral : 0 0 0 253 0 0 18 0 0 480
68.47/68.59 c knapsack : 1 5 677 3 0 0 0 0 0 0
68.47/68.59 c setppc : 400 5 677 3 0 3 978 0 0 0
68.47/68.59 c and : 2488 245 674 3 0 0 12103 5006 0 0
68.47/68.59 c linear : 1 5 674 1 0 0 0 0 0 0
68.47/68.59 c logicor : 200+ 5 162 1 0 0 106 0 0 0
68.47/68.59 c countsols : 0 0 0 1 0 0 0 0 0 0
68.47/68.59 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
68.47/68.59 c integral : 34.06 0.00 0.00 34.06 0.00
68.47/68.59 c knapsack : 0.06 0.05 0.01 0.00 0.00
68.47/68.59 c setppc : 0.01 0.00 0.01 0.00 0.00
68.47/68.59 c and : 0.46 0.37 0.09 0.00 0.00
68.47/68.59 c linear : 0.04 0.00 0.04 0.00 0.00
68.47/68.59 c logicor : 0.01 0.00 0.01 0.00 0.00
68.47/68.59 c countsols : 0.00 0.00 0.00 0.00 0.00
68.47/68.59 c Propagators : Time Calls Cutoffs DomReds
68.47/68.59 c vbounds : 0.00 1 0 0
68.47/68.59 c rootredcost : 0.00 0 0 0
68.47/68.59 c pseudoobj : 0.00 0 0 0
68.47/68.59 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
68.47/68.59 c propagation : 0.00 3 3 3 3.0 0 0.0 -
68.47/68.59 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
68.47/68.59 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
68.47/68.59 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
68.47/68.59 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
68.47/68.59 c applied globally : - - - 3 3.0 - - -
68.47/68.59 c applied locally : - - - 0 0.0 - - -
68.47/68.59 c Separators : Time Calls Cutoffs DomReds Cuts Conss
68.47/68.59 c cut pool : 0.01 4 - - 3 - (maximal pool size: 959)
68.47/68.59 c redcost : 0.05 245 0 0 0 0
68.47/68.59 c impliedbounds : 0.01 5 0 0 6 0
68.47/68.59 c intobj : 0.00 0 0 0 0 0
68.47/68.59 c cgmip : 0.00 0 0 0 0 0
68.47/68.59 c gomory : 7.46 5 0 0 0 0
68.47/68.59 c strongcg : 2.01 5 0 0 2500 0
68.47/68.59 c cmir : 0.00 0 0 0 0 0
68.47/68.59 c flowcover : 0.00 0 0 0 0 0
68.47/68.59 c clique : 0.07 5 0 0 31 0
68.47/68.59 c zerohalf : 0.00 0 0 0 0 0
68.47/68.59 c mcf : 0.00 1 0 0 0 0
68.47/68.59 c rapidlearning : 0.37 1 0 0 0 0
68.47/68.59 c Pricers : Time Calls Vars
68.47/68.59 c problem variables: 0.00 0 0
68.47/68.59 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
68.47/68.59 c relpscost : 34.06 250 0 18 0 0 480
68.47/68.59 c pscost : 0.00 0 0 0 0 0 0
68.47/68.59 c inference : 0.00 0 0 0 0 0 0
68.47/68.59 c mostinf : 0.00 0 0 0 0 0 0
68.47/68.59 c leastinf : 0.00 0 0 0 0 0 0
68.47/68.59 c fullstrong : 0.00 0 0 0 0 0 0
68.47/68.59 c allfullstrong : 0.00 0 0 0 0 0 0
68.47/68.59 c random : 0.00 0 0 0 0 0 0
68.47/68.59 c Primal Heuristics : Time Calls Found
68.47/68.59 c LP solutions : 0.00 - 1
68.47/68.59 c pseudo solutions : 0.00 - 0
68.47/68.59 c trivial : 0.00 1 0
68.47/68.59 c simplerounding : 0.00 0 0
68.47/68.59 c zirounding : 0.00 0 0
68.47/68.59 c rounding : 0.00 0 0
68.47/68.59 c shifting : 0.00 0 0
68.47/68.59 c intshifting : 0.00 0 0
68.47/68.59 c oneopt : 0.00 0 0
68.47/68.59 c twoopt : 0.00 0 0
68.47/68.59 c fixandinfer : 0.00 0 0
68.47/68.59 c feaspump : 0.00 0 0
68.47/68.59 c coefdiving : 0.00 0 0
68.47/68.59 c pscostdiving : 0.00 0 0
68.47/68.59 c fracdiving : 0.00 0 0
68.47/68.59 c veclendiving : 0.00 0 0
68.47/68.59 c intdiving : 0.00 0 0
68.47/68.59 c actconsdiving : 0.00 0 0
68.47/68.59 c objpscostdiving : 0.00 0 0
68.47/68.59 c rootsoldiving : 0.00 0 0
68.47/68.59 c linesearchdiving : 0.00 0 0
68.47/68.59 c guideddiving : 0.00 0 0
68.47/68.59 c octane : 0.00 0 0
68.47/68.59 c rens : 0.00 0 0
68.47/68.59 c rins : 0.00 0 0
68.47/68.59 c localbranching : 0.00 0 0
68.47/68.59 c mutation : 0.00 0 0
68.47/68.59 c crossover : 0.00 0 0
68.47/68.59 c dins : 0.00 0 0
68.47/68.59 c undercover : 0.00 0 0
68.47/68.59 c nlp : 0.00 0 0
68.47/68.59 c trysol : 0.00 0 0
68.47/68.59 c LP : Time Calls Iterations Iter/call Iter/sec
68.47/68.59 c primal LP : 7.10 0 0 0.00 0.00
68.47/68.59 c dual LP : 14.46 497 17545 35.30 1213.35
68.47/68.59 c lex dual LP : 0.00 0 0 0.00 -
68.47/68.59 c barrier LP : 0.00 0 0 0.00 -
68.47/68.59 c diving/probing LP: 0.00 0 0 0.00 -
68.47/68.59 c strong branching : 34.02 1490 110594 74.22 3250.85
68.47/68.59 c (at root node) : - 10 1819 181.90 -
68.47/68.59 c conflict analysis: 0.00 0 0 0.00 -
68.47/68.59 c B&B Tree :
68.47/68.59 c number of runs : 1
68.47/68.59 c nodes : 244
68.47/68.59 c nodes (total) : 244
68.47/68.59 c nodes left : 0
68.47/68.59 c max depth : 78
68.47/68.59 c max depth (total): 78
68.47/68.59 c backtracks : 12 (4.9%)
68.47/68.59 c delayed cutoffs : 0
68.47/68.59 c repropagations : 37 (37 domain reductions, 0 cutoffs)
68.47/68.59 c avg switch length: 2.44
68.47/68.59 c switching time : 7.21
68.47/68.59 c Solution :
68.47/68.59 c Solutions found : 1 (1 improvements)
68.47/68.59 c First Solution : +0.00000000000000e+00 (in run 1, after 244 nodes, 67.32 seconds, depth 78, found by <relaxation>)
68.47/68.59 c Primal Bound : +0.00000000000000e+00 (in run 1, after 244 nodes, 67.32 seconds, depth 78, found by <relaxation>)
68.47/68.59 c Dual Bound : +0.00000000000000e+00
68.47/68.59 c Gap : 0.00 %
68.47/68.59 c Root Dual Bound : +0.00000000000000e+00
68.47/68.59 c Root Iterations : 781
68.57/68.63 c Time complete: 68.6.