0.03/0.04 c SCIP version 1.1.0.7
0.03/0.04 c LP-Solver Clp 1.8.2
0.03/0.04 c user parameter file <scip.set> not found - using default parameters
0.03/0.04 c read problem <HOME/instance-1870579-1245212504.opb>
0.03/0.04 c original problem has 2924 variables (2924 bin, 0 int, 0 impl, 0 cont) and 3126 constraints
0.03/0.07 c No objective function, only one solution is needed.
0.03/0.07 c start presolving problem
0.03/0.07 c presolving:
0.19/0.25 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 20592 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 20592 implications, 400 cliques
0.29/0.39 c presolved problem has 2924 variables (2924 bin, 0 int, 0 impl, 0 cont) and 3126 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 2524 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.16
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.39/0.50 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.50 c 0.3s| 1 | 0 | 206 | 13M| 0 | 140 |2924 |3126 |3126 |2924 |5650 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.89/0.99 c 0.8s| 1 | 0 | 290 | 13M| 0 | 142 |2924 |3126 |3126 |2924 |5652 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
2.99/3.06 c 2.8s| 1 | 0 | 391 | 13M| 0 | 143 |2924 |3126 |3126 |2924 |5653 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
4.98/5.06 c 4.8s| 1 | 0 | 395 | 13M| 0 | 153 |2924 |3126 |3126 |2924 |5654 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
7.49/7.57 c 7.3s| 1 | 0 | 424 | 13M| 0 | 149 |2924 |3126 |3126 |2924 |5655 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
9.79/9.90 c 9.6s| 1 | 0 | 532 | 13M| 0 | 159 |2924 |3126 |3126 |2924 |5656 | 6 | 0 | 0 | 8.000000e+01 | -- | Inf
17.78/17.84 c 17.6s| 1 | 2 | 532 | 13M| 0 | 159 |2924 |3126 |3126 |2924 |5656 | 6 | 0 | 33 | 8.000000e+01 | -- | Inf
28.28/28.36 c *28.0s| 104 | 89 | 7265 | 14M| 55 | - |2924 |3130 |2255 |2924 |1524 |2486 | 4 |1327 | 8.000000e+01 | 8.500000e+01 | 6.25%
28.28/28.36 c
28.28/28.36 c SCIP Status : solving was interrupted [solution limit reached]
28.28/28.36 c Solving Time (sec) : 28.03
28.28/28.36 c Solving Nodes : 104
28.28/28.36 c Primal Bound : +8.50000000000000e+01 (1 solutions)
28.28/28.36 c Dual Bound : +8.00000000000003e+01
28.28/28.36 c Gap : 6.25 %
28.28/28.36 c NODE 104
28.28/28.36 c DUAL BOUND 80
28.28/28.36 c PRIMAL BOUND 85
28.28/28.36 c GAP 0.0625
28.28/28.36 s SATISFIABLE
28.28/28.36 v -x337 x254 -x326 -x298 -x375 -x353 -x329 -x311 x351 -x391 x235 -x400 -x393 -x398 -x312 -x293 -x336 -x331 -x259 x304 -x366 -x349
28.28/28.36 v -x276 -x341 -x281 -x396 -x359 -x228 -x399 -x346 x255 -x244 x322 -x358 -x270 -x219 -x314 -x266 -x347 -x371 -x279 -x372 x260 -x382
28.28/28.36 v -x333 -x216 -x277 -x243 -x269 x324 -x320 -x267 -x237 x352 -x387 -x310 -x335 -x214 -x261 -x356 -x263 -x274 -x385 -x381 -x265
28.28/28.36 v -x316 -x213 -x253 -x278 -x227 -x357 -x290 -x289 -x288 -x285 -x251 -x313 -x379 x294 x210 -x272 -x241 -x378 -x249 x209 x389
28.28/28.36 v x286 -x250 x234 x224 -x264 -x306 -x361 -x268 -x388 x334 -x383 -x380 -x330 -x271 -x247 -x301 -x239 -x291 -x362 x354 -x258 -x256
28.28/28.36 v -x230 x211 -x308 x340 -x392 -x232 x394 -x206 -x397 x363 -x309 -x297 -x282 x238 -x218 x207 -x296 -x287 -x222 -x368 -x348 x390
28.28/28.36 v -x370 -x292 -x246 -x217 -x248 -x344 -x273 -x299 -x343 -x332 x245 x376 -x377 -x373 -x307 -x295 -x240 -x236 -x262 -x223 x325
28.28/28.36 v -x395 x220 -x300 -x203 x367 -x257 x233 -x208 x305 -x221 -x321 -x283 -x323 -x319 x374 -x369 x202 x360 -x339 -x280 -x252 -x231
28.28/28.36 v -x225 -x212 -x205 -x318 -x350 x342 -x303 -x215 x204 -x365 -x315 x355 -x201 -x384 -x328 -x317 -x242 -x345 -x386 -x229 x226 x338
28.28/28.36 v -x364 -x327 -x275 -x284 -x302 x200 x199 x198 -x197 x196 -x195 -x194 -x193 x192 -x191 -x190 -x189 x188 -x187 -x186 x185 x184
28.28/28.36 v x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 x171 x170 -x169 -x168 -x167 -x166 -x165 x164 -x163 -x162
28.28/28.36 v -x161 -x160 -x159 x158 -x157 x156 -x155 -x154 x153 -x152 -x151 -x150 x149 x148 -x147 -x146 x145 -x144 -x143 -x142 -x141
28.28/28.36 v -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 x129 -x128 -x127 x126 -x125 -x124 -x123 -x122 -x121 x120 -x119
28.28/28.36 v -x118 -x117 -x116 -x115 x114 -x113 -x112 -x111 -x110 x109 -x108 -x107 -x106 -x105 -x104 -x103 x102 -x101 -x100 x99 x98 x97
28.28/28.36 v -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 x84 x83 -x82 -x81 -x80 x79 x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71
28.28/28.36 v -x70 x69 -x68 -x67 -x66 x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46
28.28/28.36 v -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 -x19
28.28/28.36 v -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
28.28/28.36 c SCIP Status : solving was interrupted [solution limit reached]
28.28/28.36 c Solving Time : 28.03
28.28/28.36 c Original Problem :
28.28/28.36 c Problem name : HOME/instance-1870579-1245212504.opb
28.28/28.36 c Variables : 2924 (2924 binary, 0 integer, 0 implicit integer, 0 continuous)
28.28/28.36 c Constraints : 3126 initial, 3126 maximal
28.28/28.36 c Presolved Problem :
28.28/28.36 c Problem name : t_HOME/instance-1870579-1245212504.opb
28.28/28.36 c Variables : 2924 (2924 binary, 0 integer, 0 implicit integer, 0 continuous)
28.28/28.36 c Constraints : 3126 initial, 3130 maximal
28.28/28.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
28.28/28.36 c trivial : 0.00 0 0 0 0 0 0 0 0
28.28/28.36 c dualfix : 0.00 0 0 0 0 0 0 0 0
28.28/28.36 c boundshift : 0.00 0 0 0 0 0 0 0 0
28.28/28.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0
28.28/28.36 c implics : 0.00 0 0 0 0 0 0 0 0
28.28/28.36 c probing : 0.00 0 0 0 0 0 0 0 0
28.28/28.36 c knapsack : 0.00 0 0 0 0 0 0 0 0
28.28/28.36 c setppc : 0.01 0 0 0 0 0 0 0 0
28.28/28.36 c and : 0.12 0 0 0 0 0 0 0 0
28.28/28.36 c linear : 0.02 0 0 0 0 0 0 0 0
28.28/28.36 c logicor : 0.01 0 0 0 0 0 0 0 0
28.28/28.36 c root node : - 0 - - 0 - - - -
28.28/28.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
28.28/28.36 c integral : 0 0 0 116 0 0 0 0 0 198
28.28/28.36 c knapsack : 1 5 286 17 0 0 0 0 0 0
28.28/28.36 c setppc : 400 5 286 17 0 4 95 0 0 0
28.28/28.36 c and : 2524 104 282 17 0 0 1890 2497 0 0
28.28/28.36 c linear : 1 5 282 1 0 0 0 0 0 0
28.28/28.36 c logicor : 200+ 5 86 1 0 0 66 0 0 0
28.28/28.36 c countsols : 0 0 0 1 0 0 0 0 0 0
28.28/28.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
28.28/28.36 c integral : 13.87 0.00 0.00 13.87 0.00
28.28/28.36 c knapsack : 0.00 0.00 0.00 0.00 0.00
28.28/28.36 c setppc : 0.00 0.00 0.00 0.00 0.00
28.28/28.36 c and : 0.15 0.11 0.04 0.00 0.00
28.28/28.36 c linear : 0.01 0.00 0.01 0.00 0.00
28.28/28.36 c logicor : 0.00 0.00 0.00 0.00 0.00
28.28/28.36 c countsols : 0.00 0.00 0.00 0.00 0.00
28.28/28.36 c Propagators : Time Calls Cutoffs DomReds
28.28/28.36 c rootredcost : 0.00 0 0 0
28.28/28.36 c pseudoobj : 0.14 287 0 0
28.28/28.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
28.28/28.36 c propagation : 0.00 4 4 4 3.0 0 0.0 -
28.28/28.36 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
28.28/28.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
28.28/28.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
28.28/28.36 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
28.28/28.36 c applied globally : - - - 4 3.0 - - -
28.28/28.36 c applied locally : - - - 0 0.0 - - -
28.28/28.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
28.28/28.36 c cut pool : 0.00 4 - - 2 - (maximal pool size: 25)
28.28/28.36 c redcost : 0.06 104 0 0 0 0
28.28/28.36 c impliedbounds : 0.00 5 0 0 0 0
28.28/28.36 c intobj : 0.00 0 0 0 0 0
28.28/28.36 c gomory : 5.34 5 0 0 902 0
28.28/28.36 c strongcg : 3.66 5 0 0 2233 0
28.28/28.36 c cmir : 0.00 0 0 0 0 0
28.28/28.36 c flowcover : 0.00 0 0 0 0 0
28.28/28.36 c clique : 0.03 5 0 0 0 0
28.28/28.36 c zerohalf : 0.00 0 0 0 0 0
28.28/28.36 c mcf : 0.01 1 0 0 0 0
28.28/28.36 c Pricers : Time Calls Vars
28.28/28.36 c problem variables: 0.00 0 0
28.28/28.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
28.28/28.36 c relpscost : 13.87 99 0 0 0 0 198
28.28/28.36 c pscost : 0.00 0 0 0 0 0 0
28.28/28.36 c inference : 0.00 0 0 0 0 0 0
28.28/28.36 c mostinf : 0.00 0 0 0 0 0 0
28.28/28.36 c leastinf : 0.00 0 0 0 0 0 0
28.28/28.36 c fullstrong : 0.00 0 0 0 0 0 0
28.28/28.36 c allfullstrong : 0.00 0 0 0 0 0 0
28.28/28.36 c random : 0.00 0 0 0 0 0 0
28.28/28.36 c Primal Heuristics : Time Calls Found
28.28/28.36 c LP solutions : 0.00 - 1
28.28/28.36 c pseudo solutions : 0.00 - 0
28.28/28.36 c simplerounding : 0.00 0 0
28.28/28.36 c rounding : 0.00 0 0
28.28/28.36 c shifting : 0.00 0 0
28.28/28.36 c intshifting : 0.00 0 0
28.28/28.36 c oneopt : 0.00 0 0
28.28/28.36 c fixandinfer : 0.00 0 0
28.28/28.36 c feaspump : 0.00 0 0
28.28/28.36 c coefdiving : 0.00 0 0
28.28/28.36 c pscostdiving : 0.00 0 0
28.28/28.36 c fracdiving : 0.00 0 0
28.28/28.36 c veclendiving : 0.00 0 0
28.28/28.36 c intdiving : 0.00 0 0
28.28/28.36 c actconsdiving : 0.00 0 0
28.28/28.36 c objpscostdiving : 0.00 0 0
28.28/28.36 c rootsoldiving : 0.00 0 0
28.28/28.36 c linesearchdiving : 0.00 0 0
28.28/28.36 c guideddiving : 0.00 0 0
28.28/28.36 c octane : 0.00 0 0
28.28/28.36 c rens : 0.00 0 0
28.28/28.36 c rins : 0.00 0 0
28.28/28.36 c localbranching : 0.00 0 0
28.28/28.36 c mutation : 0.00 0 0
28.28/28.36 c crossover : 0.00 0 0
28.28/28.36 c dins : 0.00 0 0
28.28/28.36 c LP : Time Calls Iterations Iter/call Iter/sec
28.28/28.36 c primal LP : 1.63 0 0 0.00 0.00
28.28/28.36 c dual LP : 2.59 220 7265 33.02 2805.02
28.28/28.36 c barrier LP : 0.00 0 0 0.00 -
28.28/28.36 c diving/probing LP: 0.00 0 0 0.00 -
28.28/28.36 c strong branching : 13.86 1327 29245 22.04 2110.03
28.28/28.36 c (at root node) : - 33 8883 269.18 -
28.28/28.36 c conflict analysis: 0.00 0 0 0.00 -
28.28/28.36 c B&B Tree :
28.28/28.36 c number of runs : 1
28.28/28.36 c nodes : 104
28.28/28.36 c nodes (total) : 104
28.28/28.36 c nodes left : 89
28.28/28.36 c max depth : 55
28.28/28.36 c max depth (total): 55
28.28/28.36 c backtracks : 2 (1.9%)
28.28/28.36 c delayed cutoffs : 0
28.28/28.36 c repropagations : 22 (56 domain reductions, 0 cutoffs)
28.28/28.36 c avg switch length: 1.81
28.28/28.36 c switching time : 1.64
28.28/28.36 c Solution :
28.28/28.36 c Solutions found : 1 (1 improvements)
28.28/28.36 c Primal Bound : +8.50000000000000e+01 (in run 1, after 104 nodes, 28.03 seconds, depth 55, found by <relaxation>)
28.28/28.36 c Dual Bound : +8.00000000000003e+01
28.28/28.36 c Gap : 6.25 %
28.28/28.36 c Root Dual Bound : +8.00000000000001e+01
28.38/28.42 c Time complete: 28.4.