0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver Clp 1.8.2
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1870697-1245215883.opb>
0.00/0.04 c original problem has 2928 variables (2928 bin, 0 int, 0 impl, 0 cont) and 3130 constraints
0.00/0.07 c No objective function, only one solution is needed.
0.00/0.07 c start presolving problem
0.00/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, 20624 impls, 400 clqs
0.29/0.40 c presolving (2 rounds):
0.29/0.40 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.40 c 20624 implications, 400 cliques
0.29/0.40 c presolved problem has 2928 variables (2928 bin, 0 int, 0 impl, 0 cont) and 3130 constraints
0.29/0.40 c 1 constraints of type <knapsack>
0.29/0.40 c 400 constraints of type <setppc>
0.29/0.40 c 2528 constraints of type <and>
0.29/0.40 c 1 constraints of type <linear>
0.29/0.40 c 200 constraints of type <logicor>
0.29/0.40 c transformed objective value is always integral (scale: 1)
0.29/0.40 c Presolving Time: 0.17
0.29/0.40 c SATUNSAT-NLC
0.29/0.40 c -----------------------------------------------------------------------------------------------
0.29/0.40 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.40 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.40 c separating/flowcover/freq = c -1
0.29/0.40 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.40 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.40 c separating/cmir/freq = c -1
0.29/0.40 c # additional number of allowed LP iterations
0.29/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.40 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.40 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.40 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.40 c heuristics/veclendiving/freq = c -1
0.29/0.40 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.40 c heuristics/simplerounding/freq = c -1
0.29/0.40 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.40 c heuristics/shifting/freq = c -1
0.29/0.40 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.40 c heuristics/rounding/freq = c -1
0.29/0.40 c # additional number of allowed LP iterations
0.29/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.40 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.40 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.40 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.40 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.40 c heuristics/rootsoldiving/freq = c -1
0.29/0.40 c # number of nodes added to the contingent of the total nodes
0.29/0.40 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.40 c heuristics/rens/nodesofs = c 2000
0.29/0.40 c # minimum percentage of integer variables that have to be fixable
0.29/0.40 c # [type: real, range: [0,1], default: 0.5]
0.29/0.40 c heuristics/rens/minfixingrate = c 0.3
0.29/0.40 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.40 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.40 c heuristics/rens/freq = c -1
0.29/0.40 c # additional number of allowed LP iterations
0.29/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.40 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.40 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.40 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.40 c heuristics/pscostdiving/freq = c -1
0.29/0.40 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.40 c heuristics/oneopt/freq = c -1
0.29/0.40 c # additional number of allowed LP iterations
0.29/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.40 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.40 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.40 c # [type: real, range: [0,1], default: 0.01]
0.29/0.40 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.40 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.40 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.40 c heuristics/objpscostdiving/freq = c -1
0.29/0.40 c # additional number of allowed LP iterations
0.29/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.40 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.40 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.39/0.40 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/linesearchdiving/freq = c -1
0.39/0.40 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/intshifting/freq = c -1
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/intdiving/maxlpiterquot = c 0.075
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/guideddiving/maxlpiterofs = c 1500
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.39/0.40 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/guideddiving/freq = c -1
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/fracdiving/maxlpiterofs = c 1500
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.39/0.40 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/fracdiving/freq = c -1
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/feaspump/maxlpiterofs = c 2000
0.39/0.40 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.40 c heuristics/feaspump/freq = c -1
0.39/0.40 c # minimum percentage of integer variables that have to be fixed
0.39/0.40 c # [type: real, range: [0,1], default: 0.666]
0.39/0.40 c heuristics/crossover/minfixingrate = c 0.5
0.39/0.40 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.40 c # [type: real, range: [0,1], default: 0.1]
0.39/0.40 c heuristics/crossover/nodesquot = c 0.15
0.39/0.40 c # number of nodes without incumbent change that heuristic should wait
0.39/0.40 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.40 c heuristics/crossover/nwaitingnodes = c 100
0.39/0.40 c # number of nodes added to the contingent of the total nodes
0.39/0.40 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.40 c heuristics/crossover/nodesofs = c 750
0.39/0.40 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.40 c heuristics/crossover/freq = c -1
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/coefdiving/maxlpiterofs = c 1500
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.39/0.40 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/coefdiving/freq = c -1
0.39/0.40 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c presolving/probing/maxrounds = c 0
0.39/0.40 c # should presolving try to simplify knapsacks
0.39/0.40 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.40 c constraints/knapsack/simplifyinequalities = c TRUE
0.39/0.40 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.40 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.40 c constraints/knapsack/disaggregation = c FALSE
0.39/0.40 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c constraints/knapsack/maxnumcardlift = c 0
0.39/0.40 c # should presolving try to simplify inequalities
0.39/0.40 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.40 c constraints/linear/simplifyinequalities = c TRUE
0.39/0.40 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c separating/maxroundsroot = c 5
0.39/0.40 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.40 c separating/maxrounds = c 1
0.39/0.40 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c limits/solutions = c 1
0.39/0.40 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.40 c limits/memory = c 1620
0.39/0.40 c # maximal time in seconds to run
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.40 c limits/time = c 1791
0.39/0.40 c # frequency for displaying node information lines
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.40 c display/freq = c 10000
0.39/0.40 c -----------------------------------------------------------------------------------------------
0.39/0.40 c start solving problem
0.39/0.40 c
0.49/0.50 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.50 c 0.3s| 1 | 0 | 197 | 13M| 0 | 132 |2928 |3130 |3130 |2928 |5658 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.98/1.03 c 0.8s| 1 | 0 | 326 | 13M| 0 | 132 |2928 |3130 |3130 |2928 |5660 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
2.48/2.50 c 2.2s| 1 | 0 | 444 | 13M| 0 | 133 |2928 |3130 |3130 |2928 |5661 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
3.99/4.08 c 3.8s| 1 | 0 | 577 | 13M| 0 | 134 |2928 |3130 |3130 |2928 |5662 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
5.88/5.90 c 5.6s| 1 | 0 | 676 | 13M| 0 | 134 |2928 |3130 |3130 |2928 |5663 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
7.98/8.08 c 7.8s| 1 | 0 | 770 | 13M| 0 | 135 |2928 |3130 |3130 |2928 |5664 | 6 | 0 | 0 | 8.000000e+01 | -- | Inf
14.89/14.95 c 14.6s| 1 | 2 | 770 | 13M| 0 | 135 |2928 |3130 |3130 |2928 |5664 | 6 | 0 | 33 | 8.000000e+01 | -- | Inf
26.48/26.59 c *26.2s| 104 | 94 | 11786 | 14M| 38 | - |2928 |3133 |2248 |2928 |1425 |4071 | 3 |1331 | 8.000000e+01 | 9.200000e+01 | 15.00%
26.48/26.59 c
26.48/26.59 c SCIP Status : solving was interrupted [solution limit reached]
26.48/26.59 c Solving Time (sec) : 26.23
26.48/26.59 c Solving Nodes : 104
26.48/26.59 c Primal Bound : +9.20000000000000e+01 (1 solutions)
26.48/26.59 c Dual Bound : +8.00000000000002e+01
26.48/26.59 c Gap : 15.00 %
26.58/26.60 c NODE 104
26.58/26.60 c DUAL BOUND 80
26.58/26.60 c PRIMAL BOUND 92
26.58/26.60 c GAP 0.15
26.58/26.60 s SATISFIABLE
26.58/26.60 v -x385 -x378 -x363 -x375 -x262 x387 -x398 -x331 -x303 -x394 -x240 -x255 -x271 -x360 -x239 -x350 -x260 -x283 -x370 -x297 -x231 -x306
26.58/26.60 v -x334 -x292 -x356 -x323 -x393 x257 -x349 -x388 -x305 -x301 -x245 -x357 -x361 x220 x241 -x230 -x296 x338 -x314 -x310 x286
26.58/26.60 v -x348 -x312 -x246 x329 -x307 -x339 x326 -x311 x376 -x337 -x300 x218 -x217 -x365 -x244 x226 -x256 -x358 x284 -x335 x364 -x319
26.58/26.60 v -x293 -x242 -x278 -x396 -x268 -x213 -x380 x369 -x346 -x281 -x395 -x327 -x373 x330 x308 x333 -x397 -x270 -x263 x325 -x313 -x351
26.58/26.60 v -x318 -x259 -x371 -x302 -x320 -x315 -x344 x209 x383 x299 -x252 x225 -x379 x359 -x392 -x235 -x295 -x219 -x264 -x279 -x275 -x304
26.58/26.60 v -x207 -x391 -x352 -x336 -x316 -x267 -x210 -x288 x345 -x291 -x251 -x340 -x289 -x269 -x234 -x381 x342 x298 x282 -x317 -x243
26.58/26.60 v -x390 -x228 -x324 x354 -x389 x386 -x372 -x353 -x223 -x216 -x294 -x208 -x224 x236 -x214 x204 -x290 -x266 x238 -x254 -x341 -x362
26.58/26.60 v x400 x309 -x285 -x203 -x265 -x237 -x328 x347 x368 -x253 -x384 x332 -x374 -x280 -x202 -x377 -x367 -x355 -x343 -x232 -x205 -x206
26.58/26.60 v x215 -x287 -x229 -x221 -x399 -x261 x249 -x227 -x201 -x322 -x272 -x258 -x248 -x247 -x222 -x212 -x382 -x274 -x250 -x321 -x233
26.58/26.60 v -x277 -x273 -x211 x366 -x276 -x200 x199 -x198 -x197 -x196 -x195 -x194 x193 -x192 -x191 -x190 -x189 x188 -x187 -x186 x185
26.58/26.60 v x184 -x183 x182 x181 x180 -x179 x178 -x177 -x176 -x175 x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163
26.58/26.60 v -x162 -x161 -x160 -x159 -x158 -x157 x156 -x155 -x154 -x153 -x152 -x151 x150 -x149 -x148 -x147 x146 -x145 x144 x143 -x142 -x141
26.58/26.60 v -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120
26.58/26.60 v -x119 -x118 -x117 x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104 -x103 -x102 x101 -x100 -x99
26.58/26.60 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 -x72
26.58/26.60 v 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
26.58/26.60 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
26.58/26.60 v -x19 -x18 x17 -x16 -x15 -x14 -x13 -x12 -x11 x10 -x9 x8 x7 -x6 -x5 -x4 -x3 -x2 x1
26.58/26.60 c SCIP Status : solving was interrupted [solution limit reached]
26.58/26.60 c Solving Time : 26.23
26.58/26.60 c Original Problem :
26.58/26.60 c Problem name : HOME/instance-1870697-1245215883.opb
26.58/26.60 c Variables : 2928 (2928 binary, 0 integer, 0 implicit integer, 0 continuous)
26.58/26.60 c Constraints : 3130 initial, 3130 maximal
26.58/26.60 c Presolved Problem :
26.58/26.60 c Problem name : t_HOME/instance-1870697-1245215883.opb
26.58/26.60 c Variables : 2928 (2928 binary, 0 integer, 0 implicit integer, 0 continuous)
26.58/26.60 c Constraints : 3130 initial, 3133 maximal
26.58/26.60 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
26.58/26.60 c trivial : 0.00 0 0 0 0 0 0 0 0
26.58/26.60 c dualfix : 0.00 0 0 0 0 0 0 0 0
26.58/26.60 c boundshift : 0.00 0 0 0 0 0 0 0 0
26.58/26.60 c inttobinary : 0.00 0 0 0 0 0 0 0 0
26.58/26.60 c implics : 0.00 0 0 0 0 0 0 0 0
26.58/26.60 c probing : 0.00 0 0 0 0 0 0 0 0
26.58/26.60 c knapsack : 0.00 0 0 0 0 0 0 0 0
26.58/26.60 c setppc : 0.00 0 0 0 0 0 0 0 0
26.58/26.60 c and : 0.12 0 0 0 0 0 0 0 0
26.58/26.60 c linear : 0.03 0 0 0 0 0 0 0 0
26.58/26.60 c logicor : 0.00 0 0 0 0 0 0 0 0
26.58/26.60 c root node : - 0 - - 0 - - - -
26.58/26.60 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
26.58/26.60 c integral : 0 0 0 108 0 0 0 0 0 200
26.58/26.60 c knapsack : 1 5 288 8 0 0 0 0 0 0
26.58/26.60 c setppc : 400 5 288 8 0 3 174 0 0 0
26.58/26.60 c and : 2528 105 285 8 0 0 3199 4086 0 0
26.58/26.60 c linear : 1 5 285 1 0 0 0 0 0 0
26.58/26.60 c logicor : 200+ 5 81 1 0 0 68 0 0 0
26.58/26.60 c countsols : 0 0 0 1 0 0 0 0 0 0
26.58/26.60 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
26.58/26.60 c integral : 13.00 0.00 0.00 13.00 0.00
26.58/26.60 c knapsack : 0.00 0.00 0.00 0.00 0.00
26.58/26.60 c setppc : 0.00 0.00 0.00 0.00 0.00
26.58/26.60 c and : 0.35 0.28 0.06 0.01 0.00
26.58/26.60 c linear : 0.01 0.00 0.01 0.00 0.00
26.58/26.60 c logicor : 0.03 0.00 0.03 0.00 0.00
26.58/26.60 c countsols : 0.00 0.00 0.00 0.00 0.00
26.58/26.60 c Propagators : Time Calls Cutoffs DomReds
26.58/26.60 c rootredcost : 0.00 0 0 0
26.58/26.60 c pseudoobj : 0.10 289 0 0
26.58/26.60 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
26.58/26.60 c propagation : 0.00 3 3 3 3.0 0 0.0 -
26.58/26.60 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
26.58/26.60 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
26.58/26.60 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
26.58/26.60 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
26.58/26.60 c applied globally : - - - 3 3.0 - - -
26.58/26.60 c applied locally : - - - 0 0.0 - - -
26.58/26.60 c Separators : Time Calls Cutoffs DomReds Cuts Conss
26.58/26.60 c cut pool : 0.00 4 - - 5 - (maximal pool size: 30)
26.58/26.60 c redcost : 0.04 105 0 0 0 0
26.58/26.60 c impliedbounds : 0.00 5 0 0 0 0
26.58/26.60 c intobj : 0.00 0 0 0 0 0
26.58/26.60 c gomory : 4.98 5 0 0 559 0
26.58/26.60 c strongcg : 2.05 5 0 0 2500 0
26.58/26.60 c cmir : 0.00 0 0 0 0 0
26.58/26.60 c flowcover : 0.00 0 0 0 0 0
26.58/26.60 c clique : 0.01 5 0 0 0 0
26.58/26.60 c zerohalf : 0.00 0 0 0 0 0
26.58/26.60 c mcf : 0.01 1 0 0 0 0
26.58/26.60 c Pricers : Time Calls Vars
26.58/26.60 c problem variables: 0.00 0 0
26.58/26.60 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
26.58/26.60 c relpscost : 13.00 100 0 0 0 0 200
26.58/26.60 c pscost : 0.00 0 0 0 0 0 0
26.58/26.60 c inference : 0.00 0 0 0 0 0 0
26.58/26.60 c mostinf : 0.00 0 0 0 0 0 0
26.58/26.60 c leastinf : 0.00 0 0 0 0 0 0
26.58/26.60 c fullstrong : 0.00 0 0 0 0 0 0
26.58/26.60 c allfullstrong : 0.00 0 0 0 0 0 0
26.58/26.60 c random : 0.00 0 0 0 0 0 0
26.58/26.60 c Primal Heuristics : Time Calls Found
26.58/26.60 c LP solutions : 0.00 - 1
26.58/26.60 c pseudo solutions : 0.00 - 0
26.58/26.60 c simplerounding : 0.00 0 0
26.58/26.60 c rounding : 0.00 0 0
26.58/26.60 c shifting : 0.00 0 0
26.58/26.60 c intshifting : 0.00 0 0
26.58/26.60 c oneopt : 0.00 0 0
26.58/26.60 c fixandinfer : 0.00 0 0
26.58/26.60 c feaspump : 0.00 0 0
26.58/26.60 c coefdiving : 0.00 0 0
26.58/26.60 c pscostdiving : 0.00 0 0
26.58/26.60 c fracdiving : 0.00 0 0
26.58/26.60 c veclendiving : 0.00 0 0
26.58/26.60 c intdiving : 0.00 0 0
26.58/26.60 c actconsdiving : 0.00 0 0
26.58/26.60 c objpscostdiving : 0.00 0 0
26.58/26.60 c rootsoldiving : 0.00 0 0
26.58/26.60 c linesearchdiving : 0.00 0 0
26.58/26.60 c guideddiving : 0.00 0 0
26.58/26.60 c octane : 0.00 0 0
26.58/26.60 c rens : 0.00 0 0
26.58/26.60 c rins : 0.00 0 0
26.58/26.60 c localbranching : 0.00 0 0
26.58/26.60 c mutation : 0.00 0 0
26.58/26.60 c crossover : 0.00 0 0
26.58/26.60 c dins : 0.00 0 0
26.58/26.60 c LP : Time Calls Iterations Iter/call Iter/sec
26.58/26.60 c primal LP : 1.87 0 0 0.00 0.00
26.58/26.60 c dual LP : 3.19 213 11786 55.33 3694.67
26.58/26.60 c barrier LP : 0.00 0 0 0.00 -
26.58/26.60 c diving/probing LP: 0.00 0 0 0.00 -
26.58/26.60 c strong branching : 12.99 1331 33470 25.15 2576.60
26.58/26.60 c (at root node) : - 33 9892 299.76 -
26.58/26.60 c conflict analysis: 0.00 0 0 0.00 -
26.58/26.60 c B&B Tree :
26.58/26.60 c number of runs : 1
26.58/26.60 c nodes : 104
26.58/26.60 c nodes (total) : 104
26.58/26.60 c nodes left : 94
26.58/26.60 c max depth : 38
26.58/26.60 c max depth (total): 38
26.58/26.60 c backtracks : 5 (4.8%)
26.58/26.60 c delayed cutoffs : 0
26.58/26.60 c repropagations : 14 (57 domain reductions, 0 cutoffs)
26.58/26.60 c avg switch length: 1.97
26.58/26.60 c switching time : 1.90
26.58/26.60 c Solution :
26.58/26.60 c Solutions found : 1 (1 improvements)
26.58/26.60 c Primal Bound : +9.20000000000000e+01 (in run 1, after 104 nodes, 26.23 seconds, depth 38, found by <relaxation>)
26.58/26.60 c Dual Bound : +8.00000000000002e+01
26.58/26.60 c Gap : 15.00 %
26.58/26.60 c Root Dual Bound : +8.00000000000002e+01
26.58/26.66 c Time complete: 26.64.