0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2702872-1278575277.opb>
0.03/0.08 c original problem has 6626 variables (6626 bin, 0 int, 0 impl, 0 cont) and 6828 constraints
0.03/0.08 c problem read
0.03/0.08 c No objective function, only one solution is needed.
0.03/0.08 c presolving settings loaded
0.09/0.17 c presolving:
0.29/0.33 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 50208 impls, 400 clqs
0.39/0.44 c presolving (2 rounds):
0.39/0.44 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.44 c 50208 implications, 400 cliques
0.39/0.44 c presolved problem has 6626 variables (6626 bin, 0 int, 0 impl, 0 cont) and 6828 constraints
0.39/0.44 c 1 constraints of type <knapsack>
0.39/0.44 c 600 constraints of type <setppc>
0.39/0.44 c 6226 constraints of type <and>
0.39/0.44 c 1 constraints of type <linear>
0.39/0.44 c transformed objective value is always integral (scale: 1)
0.39/0.44 c Presolving Time: 0.31
0.39/0.44 c - non default parameters ----------------------------------------------------------------------
0.39/0.44 c # SCIP version 1.2.1.3
0.39/0.44 c
0.39/0.44 c # frequency for displaying node information lines
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.44 c display/freq = 10000
0.39/0.44 c
0.39/0.44 c # maximal time in seconds to run
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.44 c limits/time = 1789.92
0.39/0.44 c
0.39/0.44 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.44 c limits/memory = 1620
0.39/0.44 c
0.39/0.44 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.44 c limits/solutions = 1
0.39/0.44 c
0.39/0.44 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.44 c separating/maxrounds = 1
0.39/0.44 c
0.39/0.44 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.44 c separating/maxroundsroot = 5
0.39/0.44 c
0.39/0.44 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.39/0.44 c # [type: int, range: [1,2], default: 1]
0.39/0.44 c timing/clocktype = 2
0.39/0.44 c
0.39/0.44 c # should presolving try to simplify inequalities
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.44 c constraints/linear/simplifyinequalities = TRUE
0.39/0.44 c
0.39/0.44 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.44 c constraints/indicator/addCouplingCons = TRUE
0.39/0.44 c
0.39/0.44 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.44 c constraints/knapsack/disaggregation = FALSE
0.39/0.44 c
0.39/0.44 c # should presolving try to simplify knapsacks
0.39/0.44 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.44 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.44 c
0.39/0.44 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.44 c presolving/probing/maxrounds = 0
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/coefdiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.44 c heuristics/crossover/freq = -1
0.39/0.44 c
0.39/0.44 c # number of nodes added to the contingent of the total nodes
0.39/0.44 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.44 c heuristics/crossover/nodesofs = 750
0.39/0.44 c
0.39/0.44 c # number of nodes without incumbent change that heuristic should wait
0.39/0.44 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.44 c heuristics/crossover/nwaitingnodes = 100
0.39/0.44 c
0.39/0.44 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.44 c # [type: real, range: [0,1], default: 0.1]
0.39/0.44 c heuristics/crossover/nodesquot = 0.15
0.39/0.44 c
0.39/0.44 c # minimum percentage of integer variables that have to be fixed
0.39/0.44 c # [type: real, range: [0,1], default: 0.666]
0.39/0.44 c heuristics/crossover/minfixingrate = 0.5
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.44 c heuristics/feaspump/freq = -1
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/fracdiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/guideddiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/intshifting/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/linesearchdiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/nlp/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.44 c heuristics/objpscostdiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.44 c # [type: real, range: [0,1], default: 0.01]
0.39/0.44 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/oneopt/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/pscostdiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.44 c heuristics/rens/freq = -1
0.39/0.44 c
0.39/0.44 c # minimum percentage of integer variables that have to be fixable
0.39/0.44 c # [type: real, range: [0,1], default: 0.5]
0.39/0.44 c heuristics/rens/minfixingrate = 0.3
0.39/0.44 c
0.39/0.44 c # number of nodes added to the contingent of the total nodes
0.39/0.44 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.44 c heuristics/rens/nodesofs = 2000
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.44 c heuristics/rootsoldiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.44 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/rounding/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/shifting/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/simplerounding/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.44 c heuristics/trivial/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/trysol/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.44 c heuristics/veclendiving/freq = -1
0.39/0.44 c
0.39/0.44 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.44 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.44 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.44 c
0.39/0.44 c # additional number of allowed LP iterations
0.39/0.44 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.44 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.44 c
0.39/0.44 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.44 c heuristics/zirounding/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.44 c separating/cmir/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.44 c separating/flowcover/freq = -1
0.39/0.44 c
0.39/0.44 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.44 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.44 c separating/rapidlearning/freq = 0
0.39/0.44 c
0.39/0.44 c -----------------------------------------------------------------------------------------------
0.39/0.44 c start solving
0.39/0.45 c
0.59/0.66 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.66 c 0.6s| 1 | 0 | 180 | - | 29M| 0 | 114 |6626 |6828 |6626 | 13k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.39/4.49 c 4.4s| 1 | 0 | 227 | - | 30M| 0 | 112 |6626 |6828 |6626 | 13k| 11 | 0 | 0 | 0.000000e+00 | -- | Inf
7.79/7.87 c 7.8s| 1 | 0 | 253 | - | 31M| 0 | 116 |6626 |6828 |6626 | 13k| 18 | 0 | 0 | 0.000000e+00 | -- | Inf
11.08/11.10 c 11.0s| 1 | 0 | 283 | - | 31M| 0 | 118 |6626 |6828 |6626 | 13k| 26 | 0 | 0 | 0.000000e+00 | -- | Inf
14.29/14.36 c 14.3s| 1 | 0 | 298 | - | 32M| 0 | 120 |6626 |6828 |6626 | 13k| 33 | 0 | 0 | 0.000000e+00 | -- | Inf
17.60/17.69 c 17.6s| 1 | 0 | 312 | - | 33M| 0 | 122 |6626 |6828 |6626 | 13k| 36 | 0 | 0 | 0.000000e+00 | -- | Inf
20.19/20.25 c 20.2s| 1 | 2 | 312 | - | 33M| 0 | 122 |6626 |6828 |6626 | 13k| 36 | 0 | 9 | 0.000000e+00 | -- | Inf
36.77/36.89 c *36.8s| 97 | 0 | 5100 | 49.9 | 35M| 36 | - |6626 |6834 |6626 | 981 |1633 | 6 |1184 | 0.000000e+00 | 0.000000e+00 | 0.00%
36.87/36.91 c
36.87/36.91 c SCIP Status : problem is solved [optimal solution found]
36.87/36.91 c Solving Time (sec) : 36.82
36.87/36.91 c Solving Nodes : 97
36.87/36.91 c Primal Bound : +0.00000000000000e+00 (1 solutions)
36.87/36.91 c Dual Bound : +0.00000000000000e+00
36.87/36.91 c Gap : 0.00 %
36.87/36.93 s SATISFIABLE
36.87/36.93 v -x383 -x316 -x245 -x260 -x248 -x378 -x310 -x305 -x293 -x257 -x230 -x355 -x387 -x352 -x380 -x394 -x240 -x393 -x385 -x376 -x301 -x360
36.87/36.93 v -x290 -x297 -x350 -x209 -x338 -x259 -x218 -x306 -x334 -x323 -x348 -x231 -x388 -x312 -x336 -x357 -x339 -x296 -x255 -x239
36.87/36.93 v -x369 -x286 -x299 -x329 x373 -x330 -x232 x311 -x226 -x256 -x358 -x372 -x284 x322 -x370 -x326 -x283 -x246 -x319 -x242 -x396 x268
36.87/36.93 v -x252 -x346 -x222 -x308 -x204 -x364 -x356 -x331 -x318 -x292 -x262 -x258 -x241 -x397 -x270 -x237 -x313 -x210 -x351 -x371 -x207
36.87/36.93 v -x302 -x320 -x315 -x377 -x344 -x353 -x379 -x219 -x392 -x203 x395 -x381 -x375 -x300 -x213 x235 -x295 -x264 x279 -x275 x345
36.87/36.93 v -x291 -x340 -x289 x269 -x234 -x317 -x243 -x390 -x228 -x202 -x398 -x363 -x359 -x349 -x337 -x333 -x307 -x303 -x298 x288 -x282
36.87/36.93 v -x251 -x247 -x244 x212 -x324 -x386 -x354 -x389 -x223 -x294 -x224 x236 -x266 -x214 -x254 -x272 x341 -x362 -x400 -x309 x285 -x328
36.87/36.93 v -x347 -x201 -x391 -x367 -x365 -x361 -x343 -x342 -x335 -x327 -x325 -x314 -x304 -x281 -x278 -x271 -x267 -x265 -x263 -x238 -x225
36.87/36.93 v -x220 -x217 x216 -x208 -x205 -x368 -x253 -x384 -x332 -x374 -x280 -x206 -x215 -x287 -x229 -x221 -x399 -x261 -x249 -x227 -x382
36.87/36.93 v -x274 -x250 -x321 -x233 -x277 -x273 -x211 -x366 -x276 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
36.87/36.93 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169
36.87/36.93 v -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
36.87/36.93 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
36.87/36.93 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
36.87/36.93 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 x82
36.87/36.93 v -x81 -x80 -x79 x78 -x77 -x76 -x75 x74 -x73 x72 -x71 -x70 -x69 -x68 x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56
36.87/36.93 v -x55 -x54 x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31
36.87/36.93 v -x30 -x29 -x28 -x27 x26 -x25 x24 -x23 -x22 -x21 -x20 -x19 -x18 x17 -x16 -x15 x14 -x13 -x12 x11 -x10 x9 x8 -x7 -x6 -x5 x4 -x3
36.87/36.93 v -x2 x1
36.87/36.93 c SCIP Status : problem is solved [optimal solution found]
36.87/36.93 c Solving Time : 36.82
36.87/36.93 c Original Problem :
36.87/36.93 c Problem name : HOME/instance-2702872-1278575277.opb
36.87/36.93 c Variables : 6626 (6626 binary, 0 integer, 0 implicit integer, 0 continuous)
36.87/36.93 c Constraints : 6828 initial, 6828 maximal
36.87/36.93 c Presolved Problem :
36.87/36.93 c Problem name : t_HOME/instance-2702872-1278575277.opb
36.87/36.93 c Variables : 6626 (6626 binary, 0 integer, 0 implicit integer, 0 continuous)
36.87/36.93 c Constraints : 6828 initial, 6834 maximal
36.87/36.93 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
36.87/36.93 c trivial : 0.00 0 0 0 0 0 0 0 0
36.87/36.93 c dualfix : 0.00 0 0 0 0 0 0 0 0
36.87/36.93 c boundshift : 0.00 0 0 0 0 0 0 0 0
36.87/36.93 c inttobinary : 0.00 0 0 0 0 0 0 0 0
36.87/36.93 c implics : 0.00 0 0 0 0 0 0 0 0
36.87/36.93 c probing : 0.00 0 0 0 0 0 0 0 0
36.87/36.93 c knapsack : 0.01 0 0 0 0 0 0 0 0
36.87/36.93 c setppc : 0.01 0 0 0 0 0 0 0 0
36.87/36.93 c and : 0.18 0 0 0 0 0 0 0 0
36.87/36.93 c linear : 0.05 0 0 0 0 0 0 0 0
36.87/36.93 c logicor : 0.00 0 0 0 0 0 0 0 0
36.87/36.93 c root node : - 0 - - 0 - - - -
36.87/36.93 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
36.87/36.93 c integral : 0 0 0 122 0 0 48 0 0 180
36.87/36.93 c knapsack : 1 5 324 1 0 0 0 0 0 0
36.87/36.93 c setppc : 600 5 324 1 0 6 1120 0 0 0
36.87/36.93 c and : 6226 95 318 1 0 0 23330 1599 0 0
36.87/36.93 c linear : 1 5 318 1 0 0 0 0 0 0
36.87/36.93 c logicor : 0+ 0 13 0 0 0 6 0 0 0
36.87/36.93 c countsols : 0 0 0 1 0 0 0 0 0 0
36.87/36.93 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
36.87/36.93 c integral : 15.95 0.00 0.00 15.95 0.00
36.87/36.93 c knapsack : 0.05 0.05 0.01 0.00 0.00
36.87/36.93 c setppc : 0.01 0.00 0.01 0.00 0.00
36.87/36.93 c and : 0.42 0.28 0.15 0.00 0.00
36.87/36.93 c linear : 0.01 0.00 0.01 0.00 0.00
36.87/36.93 c logicor : 0.00 0.00 0.00 0.00 0.00
36.87/36.93 c countsols : 0.00 0.00 0.00 0.00 0.00
36.87/36.93 c Propagators : Time Calls Cutoffs DomReds
36.87/36.93 c vbounds : 0.00 1 0 0
36.87/36.93 c rootredcost : 0.00 0 0 0
36.87/36.93 c pseudoobj : 0.00 0 0 0
36.87/36.93 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
36.87/36.93 c propagation : 0.00 6 6 6 3.0 0 0.0 -
36.87/36.93 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
36.87/36.93 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
36.87/36.93 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
36.87/36.93 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
36.87/36.93 c applied globally : - - - 6 3.0 - - -
36.87/36.93 c applied locally : - - - 0 0.0 - - -
36.87/36.93 c Separators : Time Calls Cutoffs DomReds Cuts Conss
36.87/36.93 c cut pool : 0.00 4 - - 32 - (maximal pool size: 385)
36.87/36.93 c redcost : 0.07 95 0 0 0 0
36.87/36.93 c impliedbounds : 0.01 5 0 0 6 0
36.87/36.93 c intobj : 0.00 0 0 0 0 0
36.87/36.93 c cgmip : 0.00 0 0 0 0 0
36.87/36.93 c gomory : 13.22 5 0 0 0 0
36.87/36.93 c strongcg : 2.09 5 0 0 2500 0
36.87/36.93 c cmir : 0.00 0 0 0 0 0
36.87/36.93 c flowcover : 0.00 0 0 0 0 0
36.87/36.93 c clique : 0.05 5 0 0 26 0
36.87/36.93 c zerohalf : 0.00 0 0 0 0 0
36.87/36.93 c mcf : 0.51 3 0 0 12 0
36.87/36.93 c rapidlearning : 0.90 1 0 0 0 0
36.87/36.93 c Pricers : Time Calls Vars
36.87/36.93 c problem variables: 0.00 0 0
36.87/36.93 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
36.87/36.93 c relpscost : 15.95 121 0 48 0 0 180
36.87/36.93 c pscost : 0.00 0 0 0 0 0 0
36.87/36.93 c inference : 0.00 0 0 0 0 0 0
36.87/36.93 c mostinf : 0.00 0 0 0 0 0 0
36.87/36.93 c leastinf : 0.00 0 0 0 0 0 0
36.87/36.93 c fullstrong : 0.00 0 0 0 0 0 0
36.87/36.93 c allfullstrong : 0.00 0 0 0 0 0 0
36.87/36.93 c random : 0.00 0 0 0 0 0 0
36.87/36.93 c Primal Heuristics : Time Calls Found
36.87/36.93 c LP solutions : 0.00 - 1
36.87/36.93 c pseudo solutions : 0.00 - 0
36.87/36.93 c trivial : 0.01 1 0
36.87/36.93 c simplerounding : 0.00 0 0
36.87/36.93 c zirounding : 0.00 0 0
36.87/36.93 c rounding : 0.00 0 0
36.87/36.93 c shifting : 0.00 0 0
36.87/36.93 c intshifting : 0.00 0 0
36.87/36.93 c oneopt : 0.00 0 0
36.87/36.93 c twoopt : 0.00 0 0
36.87/36.93 c fixandinfer : 0.00 0 0
36.87/36.93 c feaspump : 0.00 0 0
36.87/36.93 c coefdiving : 0.00 0 0
36.87/36.93 c pscostdiving : 0.00 0 0
36.87/36.93 c fracdiving : 0.00 0 0
36.87/36.93 c veclendiving : 0.00 0 0
36.87/36.93 c intdiving : 0.00 0 0
36.87/36.93 c actconsdiving : 0.00 0 0
36.87/36.93 c objpscostdiving : 0.00 0 0
36.87/36.93 c rootsoldiving : 0.00 0 0
36.87/36.93 c linesearchdiving : 0.00 0 0
36.87/36.93 c guideddiving : 0.00 0 0
36.87/36.93 c octane : 0.00 0 0
36.87/36.93 c rens : 0.00 0 0
36.87/36.93 c rins : 0.00 0 0
36.87/36.93 c localbranching : 0.00 0 0
36.87/36.93 c mutation : 0.00 0 0
36.87/36.93 c crossover : 0.00 0 0
36.87/36.93 c dins : 0.00 0 0
36.87/36.93 c undercover : 0.00 0 0
36.87/36.93 c nlp : 0.00 0 0
36.87/36.93 c trysol : 0.00 0 0
36.87/36.93 c LP : Time Calls Iterations Iter/call Iter/sec
36.87/36.93 c primal LP : 0.12 0 0 0.00 0.00
36.87/36.93 c dual LP : 2.06 212 5100 24.06 2478.71
36.87/36.93 c lex dual LP : 0.00 0 0 0.00 -
36.87/36.93 c barrier LP : 0.00 0 0 0.00 -
36.87/36.93 c diving/probing LP: 0.00 0 0 0.00 -
36.87/36.93 c strong branching : 15.92 1184 32570 27.51 2045.59
36.87/36.93 c (at root node) : - 9 1689 187.67 -
36.87/36.93 c conflict analysis: 0.00 0 0 0.00 -
36.87/36.93 c B&B Tree :
36.87/36.93 c number of runs : 1
36.87/36.93 c nodes : 97
36.87/36.93 c nodes (total) : 97
36.87/36.93 c nodes left : 0
36.87/36.93 c max depth : 36
36.87/36.93 c max depth (total): 36
36.87/36.93 c backtracks : 5 (5.2%)
36.87/36.93 c delayed cutoffs : 0
36.87/36.93 c repropagations : 37 (87 domain reductions, 0 cutoffs)
36.87/36.93 c avg switch length: 2.95
36.87/36.93 c switching time : 0.26
36.87/36.93 c Solution :
36.87/36.93 c Solutions found : 1 (1 improvements)
36.87/36.93 c First Solution : +0.00000000000000e+00 (in run 1, after 97 nodes, 36.81 seconds, depth 36, found by <relaxation>)
36.87/36.93 c Primal Bound : +0.00000000000000e+00 (in run 1, after 97 nodes, 36.81 seconds, depth 36, found by <relaxation>)
36.87/36.93 c Dual Bound : +0.00000000000000e+00
36.87/36.93 c Gap : 0.00 %
36.87/36.93 c Root Dual Bound : +0.00000000000000e+00
36.87/36.93 c Root Iterations : 312
36.97/37.03 c Time complete: 37.