0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver Clp 1.8.2
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1867997-1245114182.opb>
0.00/0.02 c original problem has 370 variables (370 bin, 0 int, 0 impl, 0 cont) and 557 constraints
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c start presolving problem
0.00/0.02 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 557 upgd conss, 402 impls, 0 clqs
0.00/0.06 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 557 upgd conss, 12226 impls, 0 clqs
0.05/0.06 c presolving (3 rounds):
0.05/0.06 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.05/0.06 c 12226 implications, 0 cliques
0.05/0.06 c presolved problem has 362 variables (362 bin, 0 int, 0 impl, 0 cont) and 557 constraints
0.05/0.06 c 244 constraints of type <knapsack>
0.05/0.06 c 313 constraints of type <logicor>
0.05/0.06 c transformed objective value is always integral (scale: 1)
0.05/0.06 c Presolving Time: 0.03
0.05/0.06 c SATUNSAT-LIN
0.05/0.06 c -----------------------------------------------------------------------------------------------
0.05/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.06 c separating/flowcover/freq = c -1
0.05/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.06 c separating/cmir/freq = c -1
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/veclendiving/maxlpiterofs = c 1500
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.05/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/veclendiving/freq = c -1
0.05/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.06 c heuristics/simplerounding/freq = c -1
0.05/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/shifting/freq = c -1
0.05/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.06 c heuristics/rounding/freq = c -1
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.05/0.06 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.05/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.05/0.06 c heuristics/rootsoldiving/freq = c -1
0.05/0.06 c # number of nodes added to the contingent of the total nodes
0.05/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.05/0.06 c heuristics/rens/nodesofs = c 2000
0.05/0.06 c # minimum percentage of integer variables that have to be fixable
0.05/0.06 c # [type: real, range: [0,1], default: 0.5]
0.05/0.06 c heuristics/rens/minfixingrate = c 0.3
0.05/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.05/0.06 c heuristics/rens/freq = c -1
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.05/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/pscostdiving/freq = c -1
0.05/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.05/0.06 c heuristics/oneopt/freq = c -1
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.05/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.05/0.06 c # [type: real, range: [0,1], default: 0.01]
0.05/0.06 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.05/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.05/0.06 c heuristics/objpscostdiving/freq = c -1
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.05/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/linesearchdiving/freq = c -1
0.05/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/intshifting/freq = c -1
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/intdiving/maxlpiterquot = c 0.075
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/guideddiving/maxlpiterofs = c 1500
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.05/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/guideddiving/freq = c -1
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/fracdiving/maxlpiterofs = c 1500
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.05/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/fracdiving/freq = c -1
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/feaspump/maxlpiterofs = c 2000
0.05/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.05/0.06 c heuristics/feaspump/freq = c -1
0.05/0.06 c # minimum percentage of integer variables that have to be fixed
0.05/0.06 c # [type: real, range: [0,1], default: 0.666]
0.05/0.06 c heuristics/crossover/minfixingrate = c 0.5
0.05/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.05/0.06 c # [type: real, range: [0,1], default: 0.1]
0.05/0.06 c heuristics/crossover/nodesquot = c 0.15
0.05/0.06 c # number of nodes without incumbent change that heuristic should wait
0.05/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.05/0.06 c heuristics/crossover/nwaitingnodes = c 100
0.05/0.06 c # number of nodes added to the contingent of the total nodes
0.05/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.05/0.06 c heuristics/crossover/nodesofs = c 750
0.05/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.05/0.06 c heuristics/crossover/freq = c -1
0.05/0.06 c # additional number of allowed LP iterations
0.05/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.05/0.06 c heuristics/coefdiving/maxlpiterofs = c 1500
0.05/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.05/0.06 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.05/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.05/0.06 c heuristics/coefdiving/freq = c -1
0.05/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.06 c presolving/probing/maxrounds = c 0
0.05/0.06 c # should presolving try to simplify knapsacks
0.05/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.06 c constraints/knapsack/simplifyinequalities = c TRUE
0.05/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.05/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.05/0.06 c constraints/knapsack/disaggregation = c FALSE
0.05/0.06 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.06 c constraints/knapsack/maxnumcardlift = c 0
0.05/0.06 c # should presolving try to simplify inequalities
0.05/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.06 c constraints/linear/simplifyinequalities = c TRUE
0.05/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.06 c separating/maxroundsroot = c 5
0.05/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.05/0.06 c separating/maxrounds = c 1
0.05/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.05/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.06 c limits/solutions = c 1
0.05/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.05/0.06 c limits/memory = c 1620
0.05/0.06 c # maximal time in seconds to run
0.05/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.05/0.06 c limits/time = c 1791
0.05/0.06 c # frequency for displaying node information lines
0.05/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.05/0.06 c display/freq = c 10000
0.05/0.06 c -----------------------------------------------------------------------------------------------
0.05/0.06 c start solving problem
0.05/0.06 c
0.05/0.08 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.05/0.08 c 0.1s| 1 | 0 | 258 |2176k| 0 | 147 | 362 | 557 | 557 | 362 | 549 | 0 | 0 | 0 | 4.636364e+01 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 511 |3396k| 0 | 265 | 362 | 557 | 557 | 362 | 842 | 293 | 0 | 0 | 4.778214e+01 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 933 |6786k| 0 | 354 | 362 | 557 | 557 | 362 |1396 | 847 | 0 | 0 | 5.143590e+01 | -- | Inf
1.10/1.12 c 1.1s| 1 | 0 | 1083 |9516k| 0 | 353 | 362 | 557 | 557 | 362 |1397 | 848 | 0 | 0 | 5.155648e+01 | -- | Inf
1.49/1.51 c 1.4s| 1 | 0 | 1199 | 11M| 0 | 350 | 362 | 557 | 557 | 362 |1398 | 849 | 0 | 0 | 5.158241e+01 | -- | Inf
1.89/1.94 c 1.9s| 1 | 0 | 1320 | 11M| 0 | 350 | 362 | 557 | 557 | 362 |1399 | 850 | 0 | 0 | 5.161157e+01 | -- | Inf
4.19/4.24 c 4.2s| 1 | 2 | 1320 | 11M| 0 | 350 | 362 | 557 | 557 | 362 |1399 | 850 | 0 | 31 | 5.161157e+01 | -- | Inf
129.13/129.25 c 128s| 10000 | 6742 |524359 | 23M| 67 | - | 362 | 614 | 122 | 0 | 0 | 850 | 248 |2846 | 5.795345e+01 | -- | Inf
185.51/185.66 c 184s| 20000 | 11348 |808617 | 31M| 75 | 41 | 362 | 648 | 192 | 362 | 861 | 850 | 667 |3371 | 5.849548e+01 | -- | Inf
237.49/237.68 c 236s| 30000 | 15514 | 1071k| 39M| 75 | 161 | 362 | 670 | 419 | 362 | 861 | 850 |1103 |4017 | 5.879676e+01 | -- | Inf
287.77/287.99 c 286s| 40000 | 19311 | 1323k| 46M| 75 | 26 | 362 | 717 | 177 | 362 | 861 | 850 |1526 |4600 | 5.908988e+01 | -- | Inf
336.16/336.30 c 334s| 50000 | 22818 | 1562k| 52M| 77 | 74 | 362 | 663 | 336 | 362 | 861 | 850 |2014 |5040 | 5.939805e+01 | -- | Inf
380.75/380.96 c 378s| 60000 | 26199 | 1788k| 58M| 78 | 52 | 362 | 733 | 191 | 362 | 861 | 850 |2495 |5411 | 5.960649e+01 | -- | Inf
425.43/425.68 c 422s| 70000 | 29736 | 2017k| 65M| 79 | 24 | 362 | 739 | 135 | 362 | 861 | 850 |2998 |5820 | 5.979190e+01 | -- | Inf
468.62/468.83 c 465s| 80000 | 32813 | 2228k| 70M| 81 | - | 362 | 754 | 83 | 362 | 861 | 850 |3554 |6208 | 6.000566e+01 | -- | Inf
514.50/514.74 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
514.50/514.74 c 511s| 90000 | 35917 | 2457k| 76M| 82 | 118 | 362 | 729 | 325 | 362 | 861 | 850 |4095 |6546 | 6.025402e+01 | -- | Inf
559.69/559.95 c 556s|100000 | 39132 | 2690k| 82M| 83 | 48 | 362 | 753 | 230 | 362 | 861 | 850 |4631 |6897 | 6.047291e+01 | -- | Inf
603.86/604.10 c 600s|110000 | 42126 | 2911k| 88M| 85 | 42 | 362 | 733 | 167 | 362 | 861 | 850 |5196 |7278 | 6.065186e+01 | -- | Inf
614.46/614.75 c * 610s|112591 | 42147 | 2968k| 89M| 85 | - | 362 | 730 | 15 | 362 | 861 | 850 |5320 |7278 | 6.070189e+01 | 9.100000e+01 | 49.91%
614.46/614.75 c
614.46/614.75 c SCIP Status : solving was interrupted [solution limit reached]
614.46/614.75 c Solving Time (sec) : 610.07
614.46/614.75 c Solving Nodes : 112591
614.46/614.75 c Primal Bound : +9.10000000000000e+01 (1 solutions)
614.46/614.75 c Dual Bound : +6.07018904686620e+01
614.46/614.75 c Gap : 49.91 %
614.46/614.75 c NODE 112591
614.46/614.75 c DUAL BOUND 60.7019
614.46/614.75 c PRIMAL BOUND 91
614.46/614.75 c GAP 0.49913
614.46/614.75 s SATISFIABLE
614.46/614.75 v -x369 x370 x367 -x368 x365 -x366 x363 -x364 x361 -x362 -x359 x360 -x357 x358 -x355 -x356 -x353 -x354 -x351 -x352 -x349 -x350 -x347
614.46/614.75 v -x348 x345 -x346 x343 -x344 x341 -x342 x339 -x340 x337 -x338 x335 -x336 x333 -x334 -x331 x332 x329 -x330 -x327 x328 -x325
614.46/614.75 v x326 -x323 x324 -x321 x322 -x319 x320 -x317 x318 -x315 x316 -x313 x314 -x311 x312 -x309 x310 -x307 -x308 -x305 x306 -x303 -x304
614.46/614.75 v -x301 x302 x299 -x300 x297 -x298 x295 -x296 -x293 x294 x291 -x292 -x289 x290 -x287 x288 x285 -x286 x283 -x284 x281 -x282
614.46/614.75 v -x279 x280 x277 -x278 x275 -x276 x273 -x274 -x271 x272 -x269 x270 -x267 x268 -x265 x266 x263 -x264 -x261 x262 x259 -x260 x257
614.46/614.75 v -x258 x255 -x256 x253 -x254 -x251 x252 -x249 x250 -x247 x248 -x245 x246 -x243 x244 -x242 -x240 x238 -x236 x234 x232 x230 -x228
614.46/614.75 v -x226 -x224 -x222 -x220 -x218 -x216 -x214 -x212 -x210 -x208 -x206 -x204 -x202 -x200 x198 -x196 -x194 -x192 x190 -x188 x186
614.46/614.75 v -x184 -x182 -x180 -x178 x176 x174 -x172 -x170 -x168 x166 -x164 -x162 -x160 -x158 -x156 x154 x152 x150 -x148 -x146 -x144 x142
614.46/614.75 v -x140 -x138 -x136 -x134 x132 x130 x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98
614.46/614.75 v -x96 -x94 -x92 -x90 -x88 -x86 -x84 -x82 -x80 -x78 -x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 -x48
614.46/614.75 v -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
614.46/614.75 v -x237 -x235 -x233 -x231 -x229 -x227 -x225 -x223 -x221 -x219 -x217 -x215 -x213 -x211 -x209 -x207 -x205 x203 -x201 x199 -x197
614.46/614.75 v -x195 -x193 -x191 -x189 -x187 -x185 -x183 -x181 -x179 -x177 -x175 -x173 -x171 -x169 -x167 -x165 -x163 -x161 -x159 -x157 -x155
614.46/614.75 v -x153 -x151 -x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131 -x129 -x127 -x125 -x123 -x121 -x119 -x117 -x115 -x113
614.46/614.75 v -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 x95 -x93 x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 x73 x71 -x69 x67 -x65 -x63
614.46/614.75 v -x61 -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
614.46/614.76 v -x9 -x7 -x5 x3 x1
614.46/614.76 c SCIP Status : solving was interrupted [solution limit reached]
614.46/614.76 c Solving Time : 610.07
614.46/614.76 c Original Problem :
614.46/614.76 c Problem name : HOME/instance-1867997-1245114182.opb
614.46/614.76 c Variables : 370 (370 binary, 0 integer, 0 implicit integer, 0 continuous)
614.46/614.76 c Constraints : 557 initial, 557 maximal
614.46/614.76 c Presolved Problem :
614.46/614.76 c Problem name : t_HOME/instance-1867997-1245114182.opb
614.46/614.76 c Variables : 362 (362 binary, 0 integer, 0 implicit integer, 0 continuous)
614.46/614.76 c Constraints : 557 initial, 821 maximal
614.46/614.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
614.46/614.76 c trivial : 0.00 0 0 0 0 0 0 0 0
614.46/614.76 c dualfix : 0.00 0 0 0 0 0 0 0 0
614.46/614.76 c boundshift : 0.00 0 0 0 0 0 0 0 0
614.46/614.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0
614.46/614.76 c implics : 0.00 0 8 0 0 0 0 0 0
614.46/614.76 c probing : 0.00 0 0 0 0 0 0 0 0
614.46/614.76 c knapsack : 0.01 0 0 0 0 0 0 0 0
614.46/614.76 c logicor : 0.00 0 0 0 0 0 0 0 0
614.46/614.76 c root node : - 0 - - 0 - - - -
614.46/614.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
614.46/614.76 c integral : 0 0 0 77897 0 16 195 0 0 155590
614.46/614.76 c knapsack : 244 5 294161 0 0 31617 1297162 344 0 0
614.46/614.76 c logicor : 313+ 5 193307 1 0 161 476563 0 0 0
614.46/614.76 c countsols : 0 0 0 1 0 0 0 0 0 0
614.46/614.76 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
614.46/614.76 c integral : 65.13 0.00 0.00 65.13 0.00
614.46/614.76 c knapsack : 8.34 0.00 8.34 0.00 0.00
614.46/614.76 c logicor : 4.05 0.00 4.05 0.00 0.00
614.46/614.76 c countsols : 0.00 0.00 0.00 0.00 0.00
614.46/614.76 c Propagators : Time Calls Cutoffs DomReds
614.46/614.76 c rootredcost : 0.15 0 0 0
614.46/614.76 c pseudoobj : 4.97 295368 0 0
614.46/614.76 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
614.46/614.76 c propagation : 1.51 4344 4133 31355 75.9 12 78.7 -
614.46/614.76 c infeasible LP : 0.11 3066 0 0 0.0 0 0.0 0
614.46/614.76 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
614.46/614.76 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
614.46/614.76 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
614.46/614.76 c applied globally : - - - 5232 21.3 - - -
614.46/614.76 c applied locally : - - - 88 45.5 - - -
614.46/614.76 c Separators : Time Calls Cutoffs DomReds Cuts Conss
614.46/614.76 c cut pool : 0.02 4 - - 530 - (maximal pool size: 2907)
614.46/614.76 c redcost : 1.18 77844 0 0 0 0
614.46/614.76 c impliedbounds : 0.00 5 0 0 1258 0
614.46/614.76 c intobj : 0.00 0 0 0 0 0
614.46/614.76 c gomory : 0.67 5 0 0 341 0
614.46/614.76 c strongcg : 0.60 5 0 0 1696 0
614.46/614.76 c cmir : 0.00 0 0 0 0 0
614.46/614.76 c flowcover : 0.00 0 0 0 0 0
614.46/614.76 c clique : 0.01 1 0 0 0 0
614.46/614.76 c zerohalf : 0.00 0 0 0 0 0
614.46/614.76 c mcf : 0.00 1 0 0 0 0
614.46/614.76 c Pricers : Time Calls Vars
614.46/614.76 c problem variables: 0.00 0 0
614.46/614.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
614.46/614.76 c relpscost : 65.01 77896 16 195 0 0 155590
614.46/614.76 c pscost : 0.00 0 0 0 0 0 0
614.46/614.76 c inference : 0.00 0 0 0 0 0 0
614.46/614.76 c mostinf : 0.00 0 0 0 0 0 0
614.46/614.76 c leastinf : 0.00 0 0 0 0 0 0
614.46/614.76 c fullstrong : 0.00 0 0 0 0 0 0
614.46/614.76 c allfullstrong : 0.00 0 0 0 0 0 0
614.46/614.76 c random : 0.00 0 0 0 0 0 0
614.46/614.76 c Primal Heuristics : Time Calls Found
614.46/614.76 c LP solutions : 0.00 - 1
614.46/614.76 c pseudo solutions : 0.00 - 0
614.46/614.76 c simplerounding : 0.00 0 0
614.46/614.76 c rounding : 0.00 0 0
614.46/614.76 c shifting : 0.00 0 0
614.46/614.76 c intshifting : 0.00 0 0
614.46/614.76 c oneopt : 0.00 0 0
614.46/614.76 c fixandinfer : 0.00 0 0
614.46/614.76 c feaspump : 0.00 0 0
614.46/614.76 c coefdiving : 0.00 0 0
614.46/614.76 c pscostdiving : 0.00 0 0
614.46/614.76 c fracdiving : 0.00 0 0
614.46/614.76 c veclendiving : 0.00 0 0
614.46/614.76 c intdiving : 0.00 0 0
614.46/614.76 c actconsdiving : 0.00 0 0
614.46/614.76 c objpscostdiving : 0.00 0 0
614.46/614.76 c rootsoldiving : 0.00 0 0
614.46/614.76 c linesearchdiving : 0.00 0 0
614.46/614.76 c guideddiving : 0.00 0 0
614.46/614.76 c octane : 0.00 0 0
614.46/614.76 c rens : 0.00 0 0
614.46/614.76 c rins : 0.00 0 0
614.46/614.76 c localbranching : 0.00 0 0
614.46/614.76 c mutation : 0.00 0 0
614.46/614.76 c crossover : 0.00 0 0
614.46/614.76 c dins : 0.00 0 0
614.46/614.76 c LP : Time Calls Iterations Iter/call Iter/sec
614.46/614.76 c primal LP : 0.04 0 0 0.00 0.00
614.46/614.76 c dual LP : 493.80 80947 2968479 36.67 6011.50
614.46/614.76 c barrier LP : 0.00 0 0 0.00 -
614.46/614.76 c diving/probing LP: 0.00 0 0 0.00 -
614.46/614.76 c strong branching : 60.96 7278 326320 44.84 5353.02
614.46/614.76 c (at root node) : - 31 5179 167.06 -
614.46/614.76 c conflict analysis: 0.00 0 0 0.00 -
614.46/614.76 c B&B Tree :
614.46/614.76 c number of runs : 1
614.46/614.76 c nodes : 112591
614.46/614.76 c nodes (total) : 112591
614.46/614.76 c nodes left : 42147
614.46/614.76 c max depth : 85
614.46/614.76 c max depth (total): 85
614.46/614.76 c backtracks : 11403 (10.1%)
614.46/614.76 c delayed cutoffs : 76
614.46/614.76 c repropagations : 19051 (17059 domain reductions, 65 cutoffs)
614.46/614.76 c avg switch length: 5.91
614.46/614.76 c switching time : 10.88
614.46/614.76 c Solution :
614.46/614.76 c Solutions found : 1 (1 improvements)
614.46/614.76 c Primal Bound : +9.10000000000000e+01 (in run 1, after 112591 nodes, 610.07 seconds, depth 52, found by <relaxation>)
614.46/614.76 c Dual Bound : +6.07018904686620e+01
614.46/614.76 c Gap : 49.91 %
614.46/614.76 c Root Dual Bound : +5.16115719661532e+01
614.67/615.00 c Time complete: 614.76.