0.00/0.08 c SCIP version 1.1.0.7
0.00/0.08 c LP-Solver Clp 1.8.2
0.00/0.08 c user parameter file <scip.set> not found - using default parameters
0.00/0.08 c read problem <HOME/instance-1870711-1245216587.opb>
0.00/0.08 c original problem has 6620 variables (6620 bin, 0 int, 0 impl, 0 cont) and 6822 constraints
0.09/0.14 c No objective function, only one solution is needed.
0.09/0.14 c start presolving problem
0.09/0.14 c presolving:
0.29/0.38 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 50160 impls, 400 clqs
0.49/0.55 c presolving (2 rounds):
0.49/0.55 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.49/0.55 c 50160 implications, 400 cliques
0.49/0.55 c presolved problem has 6620 variables (6620 bin, 0 int, 0 impl, 0 cont) and 6822 constraints
0.49/0.55 c 1 constraints of type <knapsack>
0.49/0.55 c 400 constraints of type <setppc>
0.49/0.55 c 6220 constraints of type <and>
0.49/0.55 c 1 constraints of type <linear>
0.49/0.55 c 200 constraints of type <logicor>
0.49/0.55 c transformed objective value is always integral (scale: 1)
0.49/0.55 c Presolving Time: 0.27
0.49/0.55 c SATUNSAT-NLC
0.49/0.55 c -----------------------------------------------------------------------------------------------
0.49/0.55 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.55 c separating/flowcover/freq = c -1
0.49/0.55 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.55 c separating/cmir/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/veclendiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/veclendiving/freq = c -1
0.49/0.55 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.55 c heuristics/simplerounding/freq = c -1
0.49/0.55 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/shifting/freq = c -1
0.49/0.55 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.55 c heuristics/rounding/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.49/0.55 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.49/0.55 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.55 c heuristics/rootsoldiving/freq = c -1
0.49/0.55 c # number of nodes added to the contingent of the total nodes
0.49/0.55 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.55 c heuristics/rens/nodesofs = c 2000
0.49/0.55 c # minimum percentage of integer variables that have to be fixable
0.49/0.55 c # [type: real, range: [0,1], default: 0.5]
0.49/0.55 c heuristics/rens/minfixingrate = c 0.3
0.49/0.55 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.55 c heuristics/rens/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/pscostdiving/freq = c -1
0.49/0.55 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.55 c heuristics/oneopt/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to total iteration number
0.49/0.55 c # [type: real, range: [0,1], default: 0.01]
0.49/0.55 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.49/0.55 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.55 c heuristics/objpscostdiving/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/linesearchdiving/freq = c -1
0.49/0.55 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/intshifting/freq = c -1
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/intdiving/maxlpiterquot = c 0.075
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/guideddiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/guideddiving/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/fracdiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/fracdiving/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/feaspump/maxlpiterofs = c 2000
0.49/0.55 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.55 c heuristics/feaspump/freq = c -1
0.49/0.55 c # minimum percentage of integer variables that have to be fixed
0.49/0.55 c # [type: real, range: [0,1], default: 0.666]
0.49/0.55 c heuristics/crossover/minfixingrate = c 0.5
0.49/0.55 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.49/0.55 c # [type: real, range: [0,1], default: 0.1]
0.49/0.55 c heuristics/crossover/nodesquot = c 0.15
0.49/0.55 c # number of nodes without incumbent change that heuristic should wait
0.49/0.55 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.49/0.55 c heuristics/crossover/nwaitingnodes = c 100
0.49/0.55 c # number of nodes added to the contingent of the total nodes
0.49/0.55 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.55 c heuristics/crossover/nodesofs = c 750
0.49/0.55 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 30]
0.49/0.55 c heuristics/crossover/freq = c -1
0.49/0.55 c # additional number of allowed LP iterations
0.49/0.55 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.55 c heuristics/coefdiving/maxlpiterofs = c 1500
0.49/0.55 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.55 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.49/0.55 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.55 c heuristics/coefdiving/freq = c -1
0.49/0.55 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.55 c presolving/probing/maxrounds = c 0
0.49/0.55 c # should presolving try to simplify knapsacks
0.49/0.55 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.55 c constraints/knapsack/simplifyinequalities = c TRUE
0.49/0.55 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.49/0.55 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.49/0.55 c constraints/knapsack/disaggregation = c FALSE
0.49/0.55 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.49/0.55 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.55 c constraints/knapsack/maxnumcardlift = c 0
0.49/0.55 c # should presolving try to simplify inequalities
0.49/0.56 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.56 c constraints/linear/simplifyinequalities = c TRUE
0.49/0.56 c # maximal number of separation rounds in the root node (-1: unlimited)
0.49/0.56 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.56 c separating/maxroundsroot = c 5
0.49/0.56 c # maximal number of separation rounds per node (-1: unlimited)
0.49/0.56 c # [type: int, range: [-1,2147483647], default: 5]
0.49/0.56 c separating/maxrounds = c 1
0.49/0.56 c # solving stops, if the given number of solutions were found (-1: no limit)
0.49/0.56 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.56 c limits/solutions = c 1
0.49/0.56 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.49/0.56 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.56 c limits/memory = c 1620
0.49/0.56 c # maximal time in seconds to run
0.49/0.56 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.56 c limits/time = c 1791
0.49/0.56 c # frequency for displaying node information lines
0.49/0.56 c # [type: int, range: [-1,2147483647], default: 100]
0.49/0.56 c display/freq = c 10000
0.49/0.56 c -----------------------------------------------------------------------------------------------
0.49/0.56 c start solving problem
0.49/0.56 c
0.69/0.70 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.70 c 0.4s| 1 | 0 | 67 | 29M| 0 | 40 |6620 |6822 |6822 |6620 | 13k| 0 | 0 | 0 | 3.000000e+01 | -- | Inf
1.29/1.38 c 1.1s| 1 | 0 | 87 | 29M| 0 | 41 |6620 |6822 |6822 |6620 | 13k| 1 | 0 | 0 | 3.000000e+01 | -- | Inf
1.89/1.90 c 1.6s| 1 | 0 | 106 | 29M| 0 | 56 |6620 |6822 |6822 |6620 | 13k| 3 | 0 | 0 | 3.000000e+01 | -- | Inf
2.49/2.59 c 2.3s| 1 | 0 | 122 | 29M| 0 | 58 |6620 |6822 |6822 |6620 | 13k| 5 | 0 | 0 | 3.000000e+01 | -- | Inf
4.88/4.93 c 4.6s| 1 | 0 | 138 | 29M| 0 | 59 |6620 |6822 |6822 |6620 | 13k| 6 | 0 | 0 | 3.000000e+01 | -- | Inf
7.48/7.58 c 7.2s| 1 | 0 | 240 | 29M| 0 | 61 |6620 |6822 |6822 |6620 | 13k| 7 | 0 | 0 | 3.000000e+01 | -- | Inf
35.57/35.64 c 35.3s| 1 | 2 | 240 | 29M| 0 | 61 |6620 |6822 |6822 |6620 | 13k| 7 | 0 | 33 | 3.000000e+01 | -- | Inf
36.87/36.95 c *36.6s| 12 | 10 | 720 | 31M| 11 | - |6620 |6822 |3090 |6620 | 828 | 332 | 0 | 128 | 3.000000e+01 | 3.200000e+01 | 6.67%
36.87/36.95 c
36.87/36.95 c SCIP Status : solving was interrupted [solution limit reached]
36.87/36.95 c Solving Time (sec) : 36.56
36.87/36.95 c Solving Nodes : 12
36.87/36.95 c Primal Bound : +3.20000000000000e+01 (1 solutions)
36.87/36.95 c Dual Bound : +3.00000000000000e+01
36.87/36.95 c Gap : 6.67 %
36.87/36.96 c NODE 12
36.87/36.96 c DUAL BOUND 30
36.87/36.96 c PRIMAL BOUND 32
36.87/36.96 c GAP 0.0666667
36.87/36.96 s SATISFIABLE
36.87/36.96 v -x384 -x335 -x334 -x301 -x233 -x289 -x295 -x375 -x290 -x325 -x256 -x237 x247 -x396 -x328 -x388 -x312 -x215 -x394 -x226 -x313 -x377
36.87/36.96 v x326 x216 -x258 -x305 -x251 -x381 -x308 -x266 -x271 -x259 -x229 -x220 x302 -x336 -x354 -x207 -x364 -x338 -x286 -x248 -x230
36.87/36.96 v -x272 -x365 -x340 -x293 -x268 -x279 -x353 -x332 -x352 -x345 -x314 -x285 -x254 -x243 -x240 -x213 -x267 x321 -x280 -x269 -x372
36.87/36.96 v -x323 -x303 -x270 -x244 -x232 -x221 -x342 -x273 -x275 -x306 -x355 -x390 -x235 -x284 x212 -x347 -x393 -x379 -x351 -x330 -x298
36.87/36.96 v -x288 -x281 -x222 -x210 -x300 -x219 -x319 -x309 -x282 -x224 -x252 -x304 x385 -x395 -x348 -x333 -x296 -x242 -x236 -x227 x225
36.87/36.96 v -x218 -x205 -x371 -x311 -x391 -x369 -x318 -x257 -x317 -x322 -x344 -x363 -x206 -x349 -x324 -x310 -x361 -x367 -x400 -x246 -x202
36.87/36.96 v -x341 -x287 -x263 -x260 -x249 -x241 -x239 -x234 -x217 -x204 -x245 -x276 -x315 -x357 -x366 -x261 -x307 -x329 -x358 -x398 -x274
36.87/36.96 v x378 -x253 -x397 -x362 -x383 -x387 x214 -x264 -x297 -x231 -x211 -x201 -x399 -x386 -x382 -x360 -x359 -x356 -x339 -x337 -x327
36.87/36.96 v -x292 -x283 -x277 -x223 x209 -x208 -x392 -x316 -x370 -x373 -x203 -x331 x368 -x374 -x255 -x250 x238 -x294 -x350 -x380 x343 -x228
36.87/36.96 v -x346 -x278 x265 -x299 -x262 -x376 -x389 -x320 -x291 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
36.87/36.96 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169
36.87/36.96 v -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 x149 x148 -x147
36.87/36.96 v -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 x134 -x133 x132 -x131 -x130 -x129 -x128 -x127 -x126
36.87/36.96 v -x125 -x124 x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105
36.87/36.96 v -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 x85 -x84 -x83 -x82 -x81
36.87/36.96 v -x80 x79 -x78 -x77 -x76 -x75 -x74 x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56
36.87/36.96 v -x55 x54 -x53 -x52 -x51 -x50 x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 x34 -x33 -x32 -x31 -x30
36.87/36.96 v -x29 x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 x13 -x12 -x11 x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3
36.87/36.96 v -x2 -x1
36.87/36.96 c SCIP Status : solving was interrupted [solution limit reached]
36.87/36.96 c Solving Time : 36.56
36.87/36.96 c Original Problem :
36.87/36.96 c Problem name : HOME/instance-1870711-1245216587.opb
36.87/36.96 c Variables : 6620 (6620 binary, 0 integer, 0 implicit integer, 0 continuous)
36.87/36.96 c Constraints : 6822 initial, 6822 maximal
36.87/36.96 c Presolved Problem :
36.87/36.96 c Problem name : t_HOME/instance-1870711-1245216587.opb
36.87/36.96 c Variables : 6620 (6620 binary, 0 integer, 0 implicit integer, 0 continuous)
36.87/36.96 c Constraints : 6822 initial, 6822 maximal
36.87/36.96 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
36.87/36.96 c trivial : 0.00 0 0 0 0 0 0 0 0
36.87/36.96 c dualfix : 0.00 0 0 0 0 0 0 0 0
36.87/36.96 c boundshift : 0.00 0 0 0 0 0 0 0 0
36.87/36.96 c inttobinary : 0.00 0 0 0 0 0 0 0 0
36.87/36.96 c implics : 0.01 0 0 0 0 0 0 0 0
36.87/36.96 c probing : 0.00 0 0 0 0 0 0 0 0
36.87/36.96 c knapsack : 0.01 0 0 0 0 0 0 0 0
36.87/36.96 c setppc : 0.01 0 0 0 0 0 0 0 0
36.87/36.96 c and : 0.15 0 0 0 0 0 0 0 0
36.87/36.96 c linear : 0.05 0 0 0 0 0 0 0 0
36.87/36.96 c logicor : 0.01 0 0 0 0 0 0 0 0
36.87/36.96 c root node : - 0 - - 0 - - - -
36.87/36.96 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
36.87/36.96 c integral : 0 0 0 25 0 0 0 0 0 22
36.87/36.96 c knapsack : 1 5 34 14 0 0 0 0 0 0
36.87/36.96 c setppc : 400 5 34 14 0 0 127 0 0 0
36.87/36.96 c and : 6220 16 34 14 0 0 3581 325 0 0
36.87/36.96 c linear : 1 5 34 1 0 0 0 0 0 0
36.87/36.96 c logicor : 200 5 12 1 0 0 9 0 0 0
36.87/36.96 c countsols : 0 0 0 1 0 0 0 0 0 0
36.87/36.96 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
36.87/36.96 c integral : 28.54 0.00 0.00 28.54 0.00
36.87/36.96 c knapsack : 0.01 0.01 0.00 0.00 0.00
36.87/36.96 c setppc : 0.00 0.00 0.00 0.00 0.00
36.87/36.96 c and : 0.13 0.09 0.02 0.02 0.00
36.87/36.96 c linear : 0.01 0.01 0.00 0.00 0.00
36.87/36.96 c logicor : 0.00 0.00 0.00 0.00 0.00
36.87/36.96 c countsols : 0.00 0.00 0.00 0.00 0.00
36.87/36.96 c Propagators : Time Calls Cutoffs DomReds
36.87/36.96 c rootredcost : 0.00 0 0 0
36.87/36.96 c pseudoobj : 0.03 35 0 0
36.87/36.96 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
36.87/36.96 c propagation : 0.00 0 0 0 0.0 0 0.0 -
36.87/36.96 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
36.87/36.96 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
36.87/36.96 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
36.87/36.96 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
36.87/36.96 c applied globally : - - - 0 0.0 - - -
36.87/36.96 c applied locally : - - - 0 0.0 - - -
36.87/36.96 c Separators : Time Calls Cutoffs DomReds Cuts Conss
36.87/36.96 c cut pool : 0.00 4 - - 2 - (maximal pool size: 26)
36.87/36.96 c redcost : 0.01 16 0 0 0 0
36.87/36.96 c impliedbounds : 0.01 5 0 0 0 0
36.87/36.96 c intobj : 0.00 0 0 0 0 0
36.87/36.96 c gomory : 4.83 5 0 0 1512 0
36.87/36.96 c strongcg : 1.43 5 0 0 2500 0
36.87/36.96 c cmir : 0.00 0 0 0 0 0
36.87/36.96 c flowcover : 0.00 0 0 0 0 0
36.87/36.96 c clique : 0.06 5 0 0 0 0
36.87/36.96 c zerohalf : 0.00 0 0 0 0 0
36.87/36.96 c mcf : 0.29 2 0 0 0 0
36.87/36.96 c Pricers : Time Calls Vars
36.87/36.96 c problem variables: 0.00 0 0
36.87/36.96 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
36.87/36.96 c relpscost : 28.54 11 0 0 0 0 22
36.87/36.96 c pscost : 0.00 0 0 0 0 0 0
36.87/36.96 c inference : 0.00 0 0 0 0 0 0
36.87/36.96 c mostinf : 0.00 0 0 0 0 0 0
36.87/36.96 c leastinf : 0.00 0 0 0 0 0 0
36.87/36.96 c fullstrong : 0.00 0 0 0 0 0 0
36.87/36.96 c allfullstrong : 0.00 0 0 0 0 0 0
36.87/36.96 c random : 0.00 0 0 0 0 0 0
36.87/36.96 c Primal Heuristics : Time Calls Found
36.87/36.96 c LP solutions : 0.00 - 1
36.87/36.96 c pseudo solutions : 0.00 - 0
36.87/36.96 c simplerounding : 0.00 0 0
36.87/36.96 c rounding : 0.00 0 0
36.87/36.96 c shifting : 0.00 0 0
36.87/36.96 c intshifting : 0.00 0 0
36.87/36.96 c oneopt : 0.00 0 0
36.87/36.96 c fixandinfer : 0.00 0 0
36.87/36.96 c feaspump : 0.00 0 0
36.87/36.96 c coefdiving : 0.00 0 0
36.87/36.96 c pscostdiving : 0.00 0 0
36.87/36.96 c fracdiving : 0.00 0 0
36.87/36.96 c veclendiving : 0.00 0 0
36.87/36.96 c intdiving : 0.00 0 0
36.87/36.96 c actconsdiving : 0.00 0 0
36.87/36.96 c objpscostdiving : 0.00 0 0
36.87/36.96 c rootsoldiving : 0.00 0 0
36.87/36.96 c linesearchdiving : 0.00 0 0
36.87/36.96 c guideddiving : 0.00 0 0
36.87/36.96 c octane : 0.00 0 0
36.87/36.96 c rens : 0.00 0 0
36.87/36.96 c rins : 0.00 0 0
36.87/36.96 c localbranching : 0.00 0 0
36.87/36.96 c mutation : 0.00 0 0
36.87/36.96 c crossover : 0.00 0 0
36.87/36.96 c dins : 0.00 0 0
36.87/36.96 c LP : Time Calls Iterations Iter/call Iter/sec
36.87/36.96 c primal LP : 0.11 0 0 0.00 0.00
36.87/36.96 c dual LP : 0.53 41 720 17.56 1358.49
36.87/36.96 c barrier LP : 0.00 0 0 0.00 -
36.87/36.96 c diving/probing LP: 0.00 0 0 0.00 -
36.87/36.96 c strong branching : 28.53 128 18451 144.15 646.72
36.87/36.96 c (at root node) : - 33 15049 456.03 -
36.87/36.96 c conflict analysis: 0.00 0 0 0.00 -
36.87/36.96 c B&B Tree :
36.87/36.96 c number of runs : 1
36.87/36.96 c nodes : 12
36.87/36.96 c nodes (total) : 12
36.87/36.96 c nodes left : 10
36.87/36.96 c max depth : 11
36.87/36.96 c max depth (total): 11
36.87/36.96 c backtracks : 0 (0.0%)
36.87/36.96 c delayed cutoffs : 0
36.87/36.96 c repropagations : 0 (0 domain reductions, 0 cutoffs)
36.87/36.96 c avg switch length: 1.00
36.87/36.96 c switching time : 0.12
36.87/36.96 c Solution :
36.87/36.96 c Solutions found : 1 (1 improvements)
36.87/36.96 c Primal Bound : +3.20000000000000e+01 (in run 1, after 12 nodes, 36.56 seconds, depth 11, found by <relaxation>)
36.87/36.96 c Dual Bound : +3.00000000000000e+01
36.87/36.96 c Gap : 6.67 %
36.87/36.96 c Root Dual Bound : +3.00000000000000e+01
36.97/37.07 c Time complete: 37.04.