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-2667126-1276268883.opb>
0.00/0.02 c original problem has 370 variables (370 bin, 0 int, 0 impl, 0 cont) and 809 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.04 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.00/0.04 c (round 2) 16 del vars, 20 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.00/0.04 c (round 3) 16 del vars, 33 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.00/0.07 c (round 4) 16 del vars, 33 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 776 upgd conss, 406 impls, 0 clqs
0.08/0.09 c (round 5) 22 del vars, 33 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 776 upgd conss, 11256 impls, 6 clqs
0.08/0.09 c presolving (6 rounds):
0.08/0.09 c 22 deleted vars, 33 deleted constraints, 14 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.08/0.09 c 11256 implications, 6 cliques
0.08/0.09 c presolved problem has 348 variables (348 bin, 0 int, 0 impl, 0 cont) and 776 constraints
0.08/0.09 c 240 constraints of type <knapsack>
0.08/0.09 c 536 constraints of type <logicor>
0.08/0.09 c transformed objective value is always integral (scale: 1)
0.08/0.09 c Presolving Time: 0.05
0.08/0.10 c - non default parameters ----------------------------------------------------------------------
0.08/0.10 c # SCIP version 1.2.1.2
0.08/0.10 c
0.08/0.10 c # frequency for displaying node information lines
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 100]
0.08/0.10 c display/freq = 10000
0.08/0.10 c
0.08/0.10 c # maximal time in seconds to run
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.08/0.10 c limits/time = 1799.98
0.08/0.10 c
0.08/0.10 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.08/0.10 c limits/memory = 1620
0.08/0.10 c
0.08/0.10 c # solving stops, if the given number of solutions were found (-1: no limit)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.08/0.10 c limits/solutions = 1
0.08/0.10 c
0.08/0.10 c # maximal number of separation rounds per node (-1: unlimited)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 5]
0.08/0.10 c separating/maxrounds = 1
0.08/0.10 c
0.08/0.10 c # maximal number of separation rounds in the root node (-1: unlimited)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.08/0.10 c separating/maxroundsroot = 5
0.08/0.10 c
0.08/0.10 c # should presolving try to simplify inequalities
0.08/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.08/0.10 c constraints/linear/simplifyinequalities = TRUE
0.08/0.10 c
0.08/0.10 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.08/0.10 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.08/0.10 c constraints/knapsack/disaggregation = FALSE
0.08/0.10 c
0.08/0.10 c # should presolving try to simplify knapsacks
0.08/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.08/0.10 c constraints/knapsack/simplifyinequalities = TRUE
0.08/0.10 c
0.08/0.10 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.08/0.10 c presolving/probing/maxrounds = 0
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/coefdiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/coefdiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/coefdiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 30]
0.08/0.10 c heuristics/crossover/freq = -1
0.08/0.10 c
0.08/0.10 c # number of nodes added to the contingent of the total nodes
0.08/0.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.08/0.10 c heuristics/crossover/nodesofs = 750
0.08/0.10 c
0.08/0.10 c # number of nodes without incumbent change that heuristic should wait
0.08/0.10 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.08/0.10 c heuristics/crossover/nwaitingnodes = 100
0.08/0.10 c
0.08/0.10 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.08/0.10 c # [type: real, range: [0,1], default: 0.1]
0.08/0.10 c heuristics/crossover/nodesquot = 0.15
0.08/0.10 c
0.08/0.10 c # minimum percentage of integer variables that have to be fixed
0.08/0.10 c # [type: real, range: [0,1], default: 0.666]
0.08/0.10 c heuristics/crossover/minfixingrate = 0.5
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 20]
0.08/0.10 c heuristics/feaspump/freq = -1
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/feaspump/maxlpiterofs = 2000
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/fracdiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/fracdiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/fracdiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/guideddiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/guideddiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/guideddiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/intdiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/intshifting/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/linesearchdiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/nlp/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 20]
0.08/0.10 c heuristics/objpscostdiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to total iteration number
0.08/0.10 c # [type: real, range: [0,1], default: 0.01]
0.08/0.10 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/oneopt/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/pscostdiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/pscostdiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.08/0.10 c heuristics/rens/freq = -1
0.08/0.10 c
0.08/0.10 c # minimum percentage of integer variables that have to be fixable
0.08/0.10 c # [type: real, range: [0,1], default: 0.5]
0.08/0.10 c heuristics/rens/minfixingrate = 0.3
0.08/0.10 c
0.08/0.10 c # number of nodes added to the contingent of the total nodes
0.08/0.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.08/0.10 c heuristics/rens/nodesofs = 2000
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 20]
0.08/0.10 c heuristics/rootsoldiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.08/0.10 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/rounding/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/shifting/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/simplerounding/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.08/0.10 c heuristics/trivial/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/trysol/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 10]
0.08/0.10 c heuristics/veclendiving/freq = -1
0.08/0.10 c
0.08/0.10 c # maximal fraction of diving LP iterations compared to node LP iterations
0.08/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.08/0.10 c heuristics/veclendiving/maxlpiterquot = 0.075
0.08/0.10 c
0.08/0.10 c # additional number of allowed LP iterations
0.08/0.10 c # [type: int, range: [0,2147483647], default: 1000]
0.08/0.10 c heuristics/veclendiving/maxlpiterofs = 1500
0.08/0.10 c
0.08/0.10 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.08/0.10 c heuristics/zirounding/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.08/0.10 c separating/cmir/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.08/0.10 c separating/flowcover/freq = -1
0.08/0.10 c
0.08/0.10 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.08/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.08/0.10 c separating/rapidlearning/freq = 0
0.08/0.10 c
0.08/0.10 c -----------------------------------------------------------------------------------------------
0.08/0.10 c start solving
0.09/0.10 c
0.19/0.20 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.20 c 0.1s| 1 | 0 | 599 | - |2534k| 0 | 223 | 348 | 776 | 348 | 770 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.02 c 0.9s| 1 | 0 | 1060 | - |6419k| 0 | 256 | 348 | 816 | 348 |1022 | 252 | 0 | 0 | 0.000000e+00 | -- | Inf
1.69/1.74 c 1.6s| 1 | 0 | 1713 | - | 10M| 0 | 281 | 348 | 816 | 348 |1203 | 433 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.51 c 2.4s| 1 | 0 | 2241 | - | 13M| 0 | 282 | 348 | 816 | 348 |1294 | 524 | 0 | 0 | 0.000000e+00 | -- | Inf
3.29/3.32 c 3.2s| 1 | 0 | 2811 | - | 15M| 0 | 295 | 348 | 816 | 348 |1357 | 587 | 0 | 0 | 0.000000e+00 | -- | Inf
4.09/4.11 c 4.0s| 1 | 0 | 3424 | - | 18M| 0 | 295 | 348 | 816 | 348 |1381 | 611 | 0 | 0 | 0.000000e+00 | -- | Inf
8.19/8.25 c 8.1s| 1 | 2 | 3424 | - | 18M| 0 | 295 | 348 | 816 | 348 |1381 | 611 | 0 | 9 | 0.000000e+00 | -- | Inf
50.37/50.43 c *49.7s| 692 | 0 | 37708 | 49.6 | 18M| 22 | - | 348 | 921 | 348 |1023 | 611 | 109 | 878 | 0.000000e+00 | 0.000000e+00 | 0.00%
50.37/50.43 c
50.37/50.43 c SCIP Status : problem is solved [optimal solution found]
50.37/50.43 c Solving Time (sec) : 49.74
50.37/50.43 c Solving Nodes : 692
50.37/50.43 c Primal Bound : +0.00000000000000e+00 (1 solutions)
50.37/50.43 c Dual Bound : +0.00000000000000e+00
50.37/50.43 c Gap : 0.00 %
50.37/50.43 s SATISFIABLE
50.37/50.43 v x369 -x370 x367 -x368 x365 -x366 x363 -x364 x361 -x362 x359 -x360 x357 -x358 x355 -x356 -x353 -x354 -x351 -x352 -x349 -x350 -x347
50.37/50.43 v -x348 -x345 -x346 x343 -x344 x341 -x342 x339 -x340 x337 -x338 x335 -x336 -x333 x334 -x331 x332 -x329 x330 -x327 x328 x325
50.37/50.43 v -x326 x323 -x324 x321 -x322 x319 -x320 -x317 x318 -x315 x316 -x313 x314 -x311 -x312 -x309 -x310 -x307 x308 -x305 x306 -x303 x304
50.37/50.43 v -x301 x302 -x299 x300 -x297 x298 -x295 x296 -x293 x294 -x291 x292 -x289 x290 -x287 x288 x285 -x286 x283 -x284 x281 -x282
50.37/50.43 v x279 -x280 x277 -x278 x275 -x276 -x273 x274 -x271 x272 -x269 x270 -x267 x268 -x265 x266 -x263 x264 -x261 x262 -x259 x260 x257
50.37/50.43 v -x258 x255 -x256 x253 -x254 -x251 x252 -x249 x250 -x247 x248 x245 -x246 x243 -x244 -x242 -x240 -x238 -x236 -x234 -x232 -x230
50.37/50.43 v -x228 -x226 -x224 -x222 -x220 -x218 -x216 -x214 -x212 -x210 -x208 -x206 -x204 -x202 -x200 -x198 -x196 -x194 -x192 -x190 -x188
50.37/50.43 v -x186 -x184 -x182 -x180 -x178 x176 x174 x172 -x170 -x168 -x166 -x164 -x162 -x160 -x158 -x156 x154 x152 x150 x148 -x146 -x144
50.37/50.43 v -x142 -x140 -x138 -x136 -x134 x132 x130 x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102
50.37/50.43 v -x100 -x98 -x96 -x94 -x92 -x90 -x88 -x86 -x84 -x82 -x80 -x78 -x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52
50.37/50.43 v -x50 -x48 -x46 -x44 -x42 -x40 x38 x36 x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20 x18 x16 x14 x12 -x10 -x8 -x6 -x4 -x2 -x241 -x239
50.37/50.43 v -x237 -x235 -x233 -x231 -x229 -x227 x225 x223 x221 -x219 -x217 -x215 -x213 -x211 -x209 -x207 x205 x203 x201 x199 -x197 -x195
50.37/50.43 v -x193 -x191 -x189 -x187 x185 x183 x181 x179 -x177 -x175 -x173 -x171 -x169 -x167 -x165 -x163 -x161 -x159 -x157 -x155 -x153 -x151
50.37/50.43 v -x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131 -x129 -x127 -x125 -x123 -x121 -x119 -x117 -x115 -x113 -x111
50.37/50.43 v -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 x69 x67 -x65 -x63 -x61
50.37/50.43 v -x59 -x57 -x55 -x53 -x51 x49 x47 x45 -x43 -x41 -x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19 -x17 -x15 -x13 -x11 -x9
50.37/50.43 v -x7 -x5 -x3 -x1
50.37/50.43 c SCIP Status : problem is solved [optimal solution found]
50.37/50.43 c Solving Time : 49.74
50.37/50.43 c Original Problem :
50.37/50.43 c Problem name : HOME/instance-2667126-1276268883.opb
50.37/50.43 c Variables : 370 (370 binary, 0 integer, 0 implicit integer, 0 continuous)
50.37/50.43 c Constraints : 809 initial, 809 maximal
50.37/50.43 c Presolved Problem :
50.37/50.43 c Problem name : t_HOME/instance-2667126-1276268883.opb
50.37/50.43 c Variables : 348 (348 binary, 0 integer, 0 implicit integer, 0 continuous)
50.37/50.43 c Constraints : 776 initial, 921 maximal
50.37/50.43 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
50.37/50.43 c trivial : 0.00 0 0 0 0 0 0 0 0
50.37/50.43 c dualfix : 0.00 0 0 0 0 0 0 0 0
50.37/50.43 c boundshift : 0.00 0 0 0 0 0 0 0 0
50.37/50.43 c inttobinary : 0.00 0 0 0 0 0 0 0 0
50.37/50.43 c implics : 0.00 0 8 0 0 0 0 0 0
50.37/50.43 c probing : 0.00 0 0 0 0 0 0 0 0
50.37/50.43 c knapsack : 0.01 0 0 0 0 0 0 0 0
50.37/50.43 c linear : 0.02 14 0 0 14 0 33 0 0
50.37/50.43 c logicor : 0.02 0 0 0 0 0 0 0 0
50.37/50.43 c root node : - 0 - - 0 - - - -
50.37/50.43 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
50.37/50.43 c integral : 0 0 0 425 0 5 134 0 0 748
50.37/50.43 c knapsack : 240 5 2544 1 0 155 10588 665 0 0
50.37/50.43 c linear : 0+ 5 1994 0 0 0 75 0 0 0
50.37/50.43 c logicor : 536+ 5 2013 1 0 69 4461 0 0 0
50.37/50.43 c countsols : 0 0 0 1 0 0 0 0 0 0
50.37/50.43 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
50.37/50.43 c integral : 36.64 0.00 0.00 36.64 0.00
50.37/50.43 c knapsack : 0.16 0.04 0.12 0.00 0.00
50.37/50.43 c linear : 0.01 0.00 0.01 0.00 0.00
50.37/50.43 c logicor : 0.07 0.00 0.07 0.00 0.00
50.37/50.43 c countsols : 0.00 0.00 0.00 0.00 0.00
50.37/50.43 c Propagators : Time Calls Cutoffs DomReds
50.37/50.43 c vbounds : 0.00 1 0 0
50.37/50.43 c rootredcost : 0.00 0 0 0
50.37/50.43 c pseudoobj : 0.00 0 0 0
50.37/50.43 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
50.37/50.43 c propagation : 0.05 105 90 724 71.5 2 13.5 -
50.37/50.43 c infeasible LP : 0.01 107 0 0 0.0 0 0.0 0
50.37/50.43 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
50.37/50.43 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
50.37/50.43 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
50.37/50.43 c applied globally : - - - 107 13.4 - - -
50.37/50.43 c applied locally : - - - 2 97.0 - - -
50.37/50.43 c Separators : Time Calls Cutoffs DomReds Cuts Conss
50.37/50.43 c cut pool : 0.00 4 - - 26 - (maximal pool size: 2737)
50.37/50.43 c redcost : 0.00 398 0 0 0 0
50.37/50.43 c impliedbounds : 0.01 5 0 0 1099 0
50.37/50.43 c intobj : 0.00 0 0 0 0 0
50.37/50.43 c cgmip : 0.00 0 0 0 0 0
50.37/50.43 c gomory : 1.02 5 0 0 108 0
50.37/50.43 c strongcg : 0.92 5 0 0 2384 0
50.37/50.43 c cmir : 0.00 0 0 0 0 0
50.37/50.43 c flowcover : 0.00 0 0 0 0 0
50.37/50.43 c clique : 0.01 5 0 0 12 0
50.37/50.43 c zerohalf : 0.00 0 0 0 0 0
50.37/50.43 c mcf : 0.00 1 0 0 0 0
50.37/50.43 c rapidlearning : 0.24 1 0 0 0 40
50.37/50.43 c Pricers : Time Calls Vars
50.37/50.43 c problem variables: 0.00 0 0
50.37/50.43 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
50.37/50.43 c relpscost : 36.64 424 5 134 0 0 748
50.37/50.43 c pscost : 0.00 0 0 0 0 0 0
50.37/50.43 c inference : 0.00 0 0 0 0 0 0
50.37/50.43 c mostinf : 0.00 0 0 0 0 0 0
50.37/50.43 c leastinf : 0.00 0 0 0 0 0 0
50.37/50.43 c fullstrong : 0.00 0 0 0 0 0 0
50.37/50.43 c allfullstrong : 0.00 0 0 0 0 0 0
50.37/50.43 c random : 0.00 0 0 0 0 0 0
50.37/50.43 c Primal Heuristics : Time Calls Found
50.37/50.43 c LP solutions : 0.01 - 1
50.37/50.43 c pseudo solutions : 0.00 - 0
50.37/50.43 c trivial : 0.00 1 0
50.37/50.43 c simplerounding : 0.00 0 0
50.37/50.43 c zirounding : 0.00 0 0
50.37/50.43 c rounding : 0.00 0 0
50.37/50.43 c shifting : 0.00 0 0
50.37/50.43 c intshifting : 0.00 0 0
50.37/50.43 c oneopt : 0.00 0 0
50.37/50.43 c twoopt : 0.00 0 0
50.37/50.43 c fixandinfer : 0.00 0 0
50.37/50.43 c feaspump : 0.00 0 0
50.37/50.43 c coefdiving : 0.00 0 0
50.37/50.43 c pscostdiving : 0.00 0 0
50.37/50.43 c fracdiving : 0.00 0 0
50.37/50.43 c veclendiving : 0.00 0 0
50.37/50.43 c intdiving : 0.00 0 0
50.37/50.43 c actconsdiving : 0.00 0 0
50.37/50.43 c objpscostdiving : 0.00 0 0
50.37/50.43 c rootsoldiving : 0.00 0 0
50.37/50.43 c linesearchdiving : 0.00 0 0
50.37/50.43 c guideddiving : 0.00 0 0
50.37/50.43 c octane : 0.00 0 0
50.37/50.43 c rens : 0.00 0 0
50.37/50.43 c rins : 0.00 0 0
50.37/50.43 c localbranching : 0.00 0 0
50.37/50.43 c mutation : 0.00 0 0
50.37/50.43 c crossover : 0.00 0 0
50.37/50.43 c dins : 0.00 0 0
50.37/50.43 c undercover : 0.00 0 0
50.37/50.43 c nlp : 0.00 0 0
50.37/50.43 c trysol : 0.00 0 0
50.37/50.43 c LP : Time Calls Iterations Iter/call Iter/sec
50.37/50.43 c primal LP : 0.00 0 0 0.00 -
50.37/50.43 c dual LP : 10.07 537 37708 70.22 3744.59
50.37/50.43 c lex dual LP : 0.00 0 0 0.00 -
50.37/50.43 c barrier LP : 0.00 0 0 0.00 -
50.37/50.43 c diving/probing LP: 0.00 0 0 0.00 -
50.37/50.43 c strong branching : 36.60 878 119521 136.13 3265.60
50.37/50.43 c (at root node) : - 9 7443 827.00 -
50.37/50.43 c conflict analysis: 0.00 0 0 0.00 -
50.37/50.43 c B&B Tree :
50.37/50.43 c number of runs : 1
50.37/50.43 c nodes : 692
50.37/50.43 c nodes (total) : 692
50.37/50.43 c nodes left : 0
50.37/50.43 c max depth : 22
50.37/50.43 c max depth (total): 22
50.37/50.43 c backtracks : 144 (20.8%)
50.37/50.43 c delayed cutoffs : 20
50.37/50.43 c repropagations : 78 (1080 domain reductions, 19 cutoffs)
50.37/50.43 c avg switch length: 2.94
50.37/50.43 c switching time : 0.07
50.37/50.43 c Solution :
50.37/50.43 c Solutions found : 1 (1 improvements)
50.37/50.43 c First Solution : +0.00000000000000e+00 (in run 1, after 692 nodes, 49.73 seconds, depth 22, found by <relaxation>)
50.37/50.43 c Primal Bound : +0.00000000000000e+00 (in run 1, after 692 nodes, 49.73 seconds, depth 22, found by <relaxation>)
50.37/50.43 c Dual Bound : +0.00000000000000e+00
50.37/50.43 c Gap : 0.00 %
50.37/50.43 c Root Dual Bound : +0.00000000000000e+00
50.37/50.43 c Root Iterations : 3424
50.37/50.45 c Time complete: 50.43.