0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver SoPlex 1.4.1
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1870646-1245214905.opb>
0.00/0.04 c original problem has 2888 variables (2888 bin, 0 int, 0 impl, 0 cont) and 3090 constraints
0.05/0.07 c No objective function, only one solution is needed.
0.05/0.07 c start presolving problem
0.05/0.07 c presolving:
0.19/0.24 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.29/0.39 c presolving (2 rounds):
0.29/0.39 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.39 c 20304 implications, 400 cliques
0.29/0.39 c presolved problem has 2888 variables (2888 bin, 0 int, 0 impl, 0 cont) and 3090 constraints
0.29/0.39 c 1 constraints of type <knapsack>
0.29/0.39 c 400 constraints of type <setppc>
0.29/0.39 c 2488 constraints of type <and>
0.29/0.39 c 1 constraints of type <linear>
0.29/0.39 c 200 constraints of type <logicor>
0.29/0.39 c transformed objective value is always integral (scale: 1)
0.29/0.39 c Presolving Time: 0.15
0.29/0.39 c SATUNSAT-NLC
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/flowcover/freq = c -1
0.29/0.39 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/cmir/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/veclendiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/simplerounding/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/shifting/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/rounding/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.39 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/rootsoldiving/freq = c -1
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/rens/nodesofs = c 2000
0.29/0.39 c # minimum percentage of integer variables that have to be fixable
0.29/0.39 c # [type: real, range: [0,1], default: 0.5]
0.29/0.39 c heuristics/rens/minfixingrate = c 0.3
0.29/0.39 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c heuristics/rens/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/pscostdiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/oneopt/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.39 c # [type: real, range: [0,1], default: 0.01]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.39 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/objpscostdiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/linesearchdiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/intshifting/freq = c -1
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/guideddiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/fracdiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.39 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/feaspump/freq = c -1
0.29/0.39 c # minimum percentage of integer variables that have to be fixed
0.29/0.39 c # [type: real, range: [0,1], default: 0.666]
0.29/0.39 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.39 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.39 c # [type: real, range: [0,1], default: 0.1]
0.29/0.39 c heuristics/crossover/nodesquot = c 0.15
0.29/0.39 c # number of nodes without incumbent change that heuristic should wait
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.39 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/crossover/nodesofs = c 750
0.29/0.39 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.39 c heuristics/crossover/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/coefdiving/freq = c -1
0.29/0.39 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c presolving/probing/maxrounds = c 0
0.29/0.39 c # should presolving try to simplify knapsacks
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.39 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.39 c constraints/knapsack/disaggregation = c FALSE
0.29/0.39 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.39 c # should presolving try to simplify inequalities
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.39 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/maxroundsroot = c 5
0.29/0.39 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.39 c separating/maxrounds = c 1
0.29/0.39 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c limits/solutions = c 1
0.29/0.39 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/memory = c 1620
0.29/0.39 c # maximal time in seconds to run
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/time = c 1791
0.29/0.39 c # frequency for displaying node information lines
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.39 c display/freq = c 10000
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c start solving problem
0.29/0.39 c
0.49/0.54 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.54 c 0.3s| 1 | 0 | 347 | 12M| 0 | 164 |2888 |3090 |3090 |2888 |5578 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
1.09/1.12 c 0.9s| 1 | 0 | 371 | 12M| 0 | 163 |2888 |3090 |3090 |2888 |5580 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
3.59/3.61 c 3.3s| 1 | 0 | 489 | 12M| 0 | 164 |2888 |3090 |3090 |2888 |5581 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
6.49/6.51 c 6.2s| 1 | 0 | 595 | 13M| 0 | 164 |2888 |3090 |3090 |2888 |5582 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
17.18/17.25 c 16.9s| 1 | 2 | 595 | 13M| 0 | 164 |2888 |3090 |3090 |2888 |5582 | 4 | 0 | 33 | 8.000000e+01 | -- | Inf
24.58/24.61 c *24.2s| 51 | 49 | 2415 | 13M| 50 | - |2888 |3090 |2118 |2888 |1376 |1669 | 0 | 866 | 8.000000e+01 | 9.100000e+01 | 13.75%
24.58/24.61 c
24.58/24.61 c SCIP Status : solving was interrupted [solution limit reached]
24.58/24.61 c Solving Time (sec) : 24.22
24.58/24.61 c Solving Nodes : 51
24.58/24.61 c Primal Bound : +9.10000000000000e+01 (1 solutions)
24.58/24.61 c Dual Bound : +8.00000000000003e+01
24.58/24.61 c Gap : 13.75 %
24.58/24.62 c NODE 51
24.58/24.62 c DUAL BOUND 80
24.58/24.62 c PRIMAL BOUND 91
24.58/24.62 c GAP 0.1375
24.58/24.62 s SATISFIABLE
24.58/24.62 v -x364 -x366 x370 -x297 -x268 -x312 x330 -x310 -x388 x395 x260 -x319 x263 -x331 -x276 -x300 -x373 -x374 x358 -x250 -x380 -x356 -x292
24.58/24.62 v -x315 x361 -x332 -x293 -x281 -x378 -x371 -x247 x321 -x233 -x359 -x383 x223 -x397 -x339 -x266 -x264 -x322 -x240 -x313 -x352
24.58/24.62 v x326 -x257 -x218 -x367 -x280 -x234 -x344 -x285 -x333 -x311 -x306 -x277 -x219 -x363 -x379 x385 -x389 -x232 x290 -x355 -x228
24.58/24.62 v x246 -x214 -x221 -x216 -x302 x252 -x345 -x335 -x213 -x301 x294 -x251 -x235 -x350 x336 -x244 -x382 x381 x384 -x304 -x328 -x275
24.58/24.62 v -x217 -x261 x308 -x222 -x299 -x354 -x230 -x210 -x329 -x357 -x284 -x346 -x227 x398 -x314 -x209 -x396 -x365 -x270 -x392 -x327
24.58/24.62 v -x307 -x267 -x254 -x317 -x320 -x318 -x287 x220 x243 -x212 -x351 -x309 -x271 -x334 -x278 -x368 x372 x272 -x305 -x206 x236 -x211
24.58/24.62 v -x387 -x237 -x298 -x249 -x238 -x225 -x390 -x400 -x283 x205 -x324 -x303 -x245 -x229 -x323 x353 -x282 -x348 -x289 -x393 -x349
24.58/24.62 v -x295 x204 -x360 x342 -x256 -x291 -x279 -x362 -x207 -x375 -x337 x215 -x255 x399 -x288 -x231 x208 -x269 x338 x286 -x248 -x274
24.58/24.62 v -x239 -x343 -x316 -x391 -x253 -x224 -x296 x376 -x242 x203 -x340 x394 -x325 -x259 -x201 x262 -x258 x265 x202 -x377 -x273 -x341
24.58/24.62 v -x226 -x241 -x369 -x386 -x347 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185
24.58/24.62 v -x184 -x183 -x182 -x181 -x180 -x179 -x178 x177 -x176 -x175 x174 -x173 -x172 x171 -x170 -x169 -x168 x167 -x166 -x165 -x164
24.58/24.62 v x163 -x162 -x161 x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142
24.58/24.62 v x141 -x140 -x139 -x138 -x137 -x136 x135 x134 -x133 -x132 -x131 -x130 -x129 -x128 x127 -x126 -x125 -x124 -x123 -x122 -x121
24.58/24.62 v -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104 -x103 x102 x101 -x100 -x99
24.58/24.62 v x98 -x97 -x96 -x95 -x94 -x93 x92 -x91 -x90 -x89 -x88 -x87 -x86 x85 -x84 -x83 -x82 x81 x80 -x79 -x78 -x77 -x76 x75 x74 -x73
24.58/24.62 v -x72 -x71 -x70 -x69 x68 x67 -x66 -x65 -x64 -x63 -x62 x61 -x60 -x59 -x58 x57 -x56 -x55 -x54 -x53 -x52 -x51 x50 x49 -x48 -x47
24.58/24.62 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
24.58/24.62 v -x19 x18 x17 x16 -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
24.58/24.62 c SCIP Status : solving was interrupted [solution limit reached]
24.58/24.62 c Solving Time : 24.22
24.58/24.62 c Original Problem :
24.58/24.62 c Problem name : HOME/instance-1870646-1245214905.opb
24.58/24.62 c Variables : 2888 (2888 binary, 0 integer, 0 implicit integer, 0 continuous)
24.58/24.62 c Constraints : 3090 initial, 3090 maximal
24.58/24.62 c Presolved Problem :
24.58/24.62 c Problem name : t_HOME/instance-1870646-1245214905.opb
24.58/24.62 c Variables : 2888 (2888 binary, 0 integer, 0 implicit integer, 0 continuous)
24.58/24.62 c Constraints : 3090 initial, 3090 maximal
24.58/24.62 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
24.58/24.62 c trivial : 0.00 0 0 0 0 0 0 0 0
24.58/24.62 c dualfix : 0.00 0 0 0 0 0 0 0 0
24.58/24.62 c boundshift : 0.00 0 0 0 0 0 0 0 0
24.58/24.62 c inttobinary : 0.00 0 0 0 0 0 0 0 0
24.58/24.62 c implics : 0.00 0 0 0 0 0 0 0 0
24.58/24.62 c probing : 0.00 0 0 0 0 0 0 0 0
24.58/24.62 c knapsack : 0.00 0 0 0 0 0 0 0 0
24.58/24.62 c setppc : 0.00 0 0 0 0 0 0 0 0
24.58/24.62 c and : 0.10 0 0 0 0 0 0 0 0
24.58/24.62 c linear : 0.03 0 0 0 0 0 0 0 0
24.58/24.62 c logicor : 0.00 0 0 0 0 0 0 0 0
24.58/24.62 c root node : - 0 - - 0 - - - -
24.58/24.62 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
24.58/24.62 c integral : 0 0 0 54 0 0 0 0 0 100
24.58/24.62 c knapsack : 1 4 138 4 0 0 0 0 0 0
24.58/24.62 c setppc : 400 4 138 4 0 0 16 0 0 0
24.58/24.62 c and : 2488 54 138 4 0 0 867 1672 0 0
24.58/24.62 c linear : 1 4 138 1 0 0 0 0 0 0
24.58/24.62 c logicor : 200 4 39 1 0 0 37 0 0 0
24.58/24.62 c countsols : 0 0 0 1 0 0 0 0 0 0
24.58/24.62 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
24.58/24.62 c integral : 14.18 0.00 0.00 14.18 0.00
24.58/24.62 c knapsack : 0.00 0.00 0.00 0.00 0.00
24.58/24.62 c setppc : 0.00 0.00 0.00 0.00 0.00
24.58/24.62 c and : 0.11 0.09 0.01 0.01 0.00
24.58/24.62 c linear : 0.01 0.00 0.01 0.00 0.00
24.58/24.62 c logicor : 0.00 0.00 0.00 0.00 0.00
24.58/24.62 c countsols : 0.00 0.00 0.00 0.00 0.00
24.58/24.62 c Propagators : Time Calls Cutoffs DomReds
24.58/24.62 c rootredcost : 0.00 0 0 0
24.58/24.62 c pseudoobj : 0.04 139 0 0
24.58/24.62 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
24.58/24.62 c propagation : 0.00 0 0 0 0.0 0 0.0 -
24.58/24.62 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
24.58/24.62 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
24.58/24.62 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
24.58/24.62 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
24.58/24.62 c applied globally : - - - 0 0.0 - - -
24.58/24.62 c applied locally : - - - 0 0.0 - - -
24.58/24.62 c Separators : Time Calls Cutoffs DomReds Cuts Conss
24.58/24.62 c cut pool : 0.00 3 - - 0 - (maximal pool size: 8)
24.58/24.62 c redcost : 0.03 54 0 0 0 0
24.58/24.62 c impliedbounds : 0.01 4 0 0 0 0
24.58/24.62 c intobj : 0.00 0 0 0 0 0
24.58/24.62 c gomory : 4.77 4 0 0 500 0
24.58/24.62 c strongcg : 3.63 4 0 0 541 0
24.58/24.62 c cmir : 0.00 0 0 0 0 0
24.58/24.62 c flowcover : 0.00 0 0 0 0 0
24.58/24.62 c clique : 0.02 4 0 0 0 0
24.58/24.62 c zerohalf : 0.00 0 0 0 0 0
24.58/24.62 c mcf : 0.01 1 0 0 0 0
24.58/24.62 c Pricers : Time Calls Vars
24.58/24.62 c problem variables: 0.00 0 0
24.58/24.62 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
24.58/24.62 c relpscost : 14.18 50 0 0 0 0 100
24.58/24.62 c pscost : 0.00 0 0 0 0 0 0
24.58/24.62 c inference : 0.00 0 0 0 0 0 0
24.58/24.62 c mostinf : 0.00 0 0 0 0 0 0
24.58/24.62 c leastinf : 0.00 0 0 0 0 0 0
24.58/24.62 c fullstrong : 0.00 0 0 0 0 0 0
24.58/24.62 c allfullstrong : 0.00 0 0 0 0 0 0
24.58/24.62 c random : 0.00 0 0 0 0 0 0
24.58/24.62 c Primal Heuristics : Time Calls Found
24.58/24.62 c LP solutions : 0.00 - 1
24.58/24.62 c pseudo solutions : 0.00 - 0
24.58/24.62 c simplerounding : 0.00 0 0
24.58/24.62 c rounding : 0.00 0 0
24.58/24.62 c shifting : 0.00 0 0
24.58/24.62 c intshifting : 0.00 0 0
24.58/24.62 c oneopt : 0.00 0 0
24.58/24.62 c fixandinfer : 0.00 0 0
24.58/24.62 c feaspump : 0.00 0 0
24.58/24.62 c coefdiving : 0.00 0 0
24.58/24.62 c pscostdiving : 0.00 0 0
24.58/24.62 c fracdiving : 0.00 0 0
24.58/24.62 c veclendiving : 0.00 0 0
24.58/24.62 c intdiving : 0.00 0 0
24.58/24.62 c actconsdiving : 0.00 0 0
24.58/24.62 c objpscostdiving : 0.00 0 0
24.58/24.62 c rootsoldiving : 0.00 0 0
24.58/24.62 c linesearchdiving : 0.00 0 0
24.58/24.62 c guideddiving : 0.00 0 0
24.58/24.62 c octane : 0.00 0 0
24.58/24.62 c rens : 0.00 0 0
24.58/24.62 c rins : 0.00 0 0
24.58/24.62 c localbranching : 0.00 0 0
24.58/24.62 c mutation : 0.00 0 0
24.58/24.62 c crossover : 0.00 0 0
24.58/24.62 c dins : 0.00 0 0
24.58/24.62 c LP : Time Calls Iterations Iter/call Iter/sec
24.58/24.62 c primal LP : 0.09 0 0 0.00 0.00
24.58/24.62 c dual LP : 0.89 107 2415 22.57 2713.48
24.58/24.62 c barrier LP : 0.00 0 0 0.00 -
24.58/24.62 c diving/probing LP: 0.00 0 0 0.00 -
24.58/24.62 c strong branching : 14.17 866 20463 23.63 1444.11
24.58/24.62 c (at root node) : - 33 8277 250.82 -
24.58/24.62 c conflict analysis: 0.00 0 0 0.00 -
24.58/24.62 c B&B Tree :
24.58/24.62 c number of runs : 1
24.58/24.62 c nodes : 51
24.58/24.62 c nodes (total) : 51
24.58/24.62 c nodes left : 49
24.58/24.62 c max depth : 50
24.58/24.62 c max depth (total): 50
24.58/24.62 c backtracks : 0 (0.0%)
24.58/24.62 c delayed cutoffs : 0
24.58/24.62 c repropagations : 0 (0 domain reductions, 0 cutoffs)
24.58/24.62 c avg switch length: 1.00
24.58/24.62 c switching time : 0.11
24.58/24.62 c Solution :
24.58/24.62 c Solutions found : 1 (1 improvements)
24.58/24.62 c Primal Bound : +9.10000000000000e+01 (in run 1, after 51 nodes, 24.22 seconds, depth 50, found by <relaxation>)
24.58/24.62 c Dual Bound : +8.00000000000003e+01
24.58/24.62 c Gap : 13.75 %
24.58/24.62 c Root Dual Bound : +8.00000000000003e+01
24.58/24.66 c Time complete: 24.65.