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-1870647-1245214910.opb>
0.00/0.04 c original problem has 2888 variables (2888 bin, 0 int, 0 impl, 0 cont) and 3090 constraints
0.00/0.06 c No objective function, only one solution is needed.
0.00/0.06 c start presolving problem
0.00/0.06 c presolving:
0.19/0.23 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.36 c presolving (2 rounds):
0.29/0.36 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.36 c 20304 implications, 400 cliques
0.29/0.36 c presolved problem has 2888 variables (2888 bin, 0 int, 0 impl, 0 cont) and 3090 constraints
0.29/0.36 c 1 constraints of type <knapsack>
0.29/0.36 c 400 constraints of type <setppc>
0.29/0.36 c 2488 constraints of type <and>
0.29/0.36 c 1 constraints of type <linear>
0.29/0.36 c 200 constraints of type <logicor>
0.29/0.36 c transformed objective value is always integral (scale: 1)
0.29/0.36 c Presolving Time: 0.16
0.29/0.36 c SATUNSAT-NLC
0.29/0.36 c -----------------------------------------------------------------------------------------------
0.29/0.36 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c separating/flowcover/freq = c -1
0.29/0.36 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c separating/cmir/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/veclendiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/simplerounding/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/shifting/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/rounding/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.36 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.36 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/rootsoldiving/freq = c -1
0.29/0.36 c # number of nodes added to the contingent of the total nodes
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.36 c heuristics/rens/nodesofs = c 2000
0.29/0.36 c # minimum percentage of integer variables that have to be fixable
0.29/0.36 c # [type: real, range: [0,1], default: 0.5]
0.29/0.36 c heuristics/rens/minfixingrate = c 0.3
0.29/0.36 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c heuristics/rens/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/pscostdiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/oneopt/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.36 c # [type: real, range: [0,1], default: 0.01]
0.29/0.36 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.36 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/objpscostdiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/linesearchdiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/intshifting/freq = c -1
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/guideddiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/fracdiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.36 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/feaspump/freq = c -1
0.29/0.36 c # minimum percentage of integer variables that have to be fixed
0.29/0.36 c # [type: real, range: [0,1], default: 0.666]
0.29/0.36 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.36 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.36 c # [type: real, range: [0,1], default: 0.1]
0.29/0.36 c heuristics/crossover/nodesquot = c 0.15
0.29/0.36 c # number of nodes without incumbent change that heuristic should wait
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.36 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.36 c # number of nodes added to the contingent of the total nodes
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.36 c heuristics/crossover/nodesofs = c 750
0.29/0.36 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.36 c heuristics/crossover/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/coefdiving/freq = c -1
0.29/0.36 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c presolving/probing/maxrounds = c 0
0.29/0.36 c # should presolving try to simplify knapsacks
0.29/0.36 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.36 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.36 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.36 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.36 c constraints/knapsack/disaggregation = c FALSE
0.29/0.36 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.36 c # should presolving try to simplify inequalities
0.29/0.36 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.36 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.36 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c separating/maxroundsroot = c 5
0.29/0.36 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.36 c separating/maxrounds = c 1
0.29/0.36 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c limits/solutions = c 1
0.29/0.36 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.36 c limits/memory = c 1620
0.29/0.36 c # maximal time in seconds to run
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.36 c limits/time = c 1791
0.29/0.36 c # frequency for displaying node information lines
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.36 c display/freq = c 10000
0.29/0.36 c -----------------------------------------------------------------------------------------------
0.29/0.36 c start solving problem
0.29/0.36 c
0.39/0.45 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.45 c 0.2s| 1 | 0 | 205 | 12M| 0 | 136 |2888 |3090 |3090 |2888 |5578 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.89/0.96 c 0.7s| 1 | 0 | 262 | 12M| 0 | 137 |2888 |3090 |3090 |2888 |5579 | 1 | 0 | 0 | 8.000000e+01 | -- | Inf
1.89/1.97 c 1.7s| 1 | 0 | 303 | 13M| 0 | 148 |2888 |3090 |3090 |2888 |5581 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
3.79/3.86 c 3.6s| 1 | 0 | 337 | 13M| 0 | 156 |2888 |3090 |3090 |2888 |5582 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
5.99/6.05 c 5.8s| 1 | 0 | 344 | 13M| 0 | 154 |2888 |3090 |3090 |2888 |5583 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
10.48/10.54 c 10.3s| 1 | 2 | 344 | 13M| 0 | 154 |2888 |3090 |3090 |2888 |5583 | 5 | 0 | 33 | 8.000000e+01 | -- | Inf
37.38/37.46 c *37.1s| 300 | 290 | 21725 | 14M| 61 | - |2888 |3093 |1426 |2888 |1474 |5762 | 3 |2667 | 8.000000e+01 | 9.100000e+01 | 13.75%
37.38/37.46 c
37.38/37.46 c SCIP Status : solving was interrupted [solution limit reached]
37.38/37.46 c Solving Time (sec) : 37.11
37.38/37.46 c Solving Nodes : 300
37.38/37.46 c Primal Bound : +9.10000000000000e+01 (1 solutions)
37.38/37.46 c Dual Bound : +8.00000000000001e+01
37.38/37.46 c Gap : 13.75 %
37.38/37.46 c NODE 300
37.38/37.46 c DUAL BOUND 80
37.38/37.46 c PRIMAL BOUND 91
37.38/37.46 c GAP 0.1375
37.38/37.46 s SATISFIABLE
37.38/37.46 v -x364 -x366 -x370 -x297 x268 x312 -x330 -x310 -x388 -x395 -x260 -x319 -x263 -x331 -x276 -x300 -x373 -x374 x358 -x250 -x380 -x356
37.38/37.46 v -x292 x315 -x361 -x332 -x293 -x281 -x378 x371 -x247 -x321 -x233 -x359 x383 -x223 -x397 -x339 x266 -x264 -x322 -x240 -x313 -x352
37.38/37.46 v -x326 x257 -x218 -x367 x280 -x234 -x344 -x285 -x333 -x311 x306 -x277 -x219 -x363 -x379 -x385 -x389 x232 -x290 -x355 -x228
37.38/37.46 v -x246 -x214 x221 -x216 x302 -x252 -x345 -x335 -x213 -x301 -x294 -x251 -x235 -x350 -x336 x244 -x382 -x381 -x384 x304 -x328 -x275
37.38/37.46 v -x217 -x261 -x308 x222 -x299 -x354 x230 x210 -x329 -x357 -x284 -x346 -x227 -x398 x314 -x209 -x396 -x365 -x270 x392 x327
37.38/37.46 v -x307 x267 -x254 -x317 -x320 -x318 -x287 -x220 x243 -x212 -x351 x309 -x271 -x334 -x278 -x368 x372 -x272 -x305 x206 x236 x211
37.38/37.46 v -x387 -x237 x298 -x249 x238 -x225 x390 -x400 -x283 -x205 -x324 -x303 -x245 -x229 -x323 -x353 -x282 -x348 -x289 -x393 -x349 -x295
37.38/37.46 v -x204 x360 -x342 -x256 -x291 -x279 -x362 -x207 x375 -x337 -x215 -x255 -x399 -x288 x231 x208 -x269 -x338 -x286 -x248 x274
37.38/37.46 v -x239 -x343 -x316 x391 -x253 x224 -x296 -x376 -x242 -x203 -x340 -x394 -x325 -x259 -x201 -x262 x258 -x265 -x202 -x377 x273 -x341
37.38/37.46 v -x226 -x241 -x369 -x386 -x347 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 x188 -x187 -x186 x185
37.38/37.46 v -x184 -x183 -x182 -x181 -x180 -x179 x178 -x177 -x176 -x175 x174 -x173 -x172 -x171 x170 -x169 x168 x167 x166 x165 x164 -x163
37.38/37.46 v -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 -x153 x152 -x151 -x150 -x149 -x148 -x147 -x146 x145 -x144 -x143 x142 x141
37.38/37.46 v x140 -x139 x138 -x137 -x136 -x135 -x134 x133 -x132 x131 -x130 -x129 x128 -x127 -x126 x125 -x124 -x123 -x122 -x121 -x120 x119
37.38/37.46 v -x118 -x117 -x116 -x115 -x114 x113 -x112 x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 x99 -x98 -x97
37.38/37.46 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
37.38/37.46 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 -x45
37.38/37.46 v -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
37.38/37.46 v -x19 -x18 x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 x5 -x4 -x3 -x2 -x1
37.38/37.46 c SCIP Status : solving was interrupted [solution limit reached]
37.38/37.46 c Solving Time : 37.11
37.38/37.46 c Original Problem :
37.38/37.46 c Problem name : HOME/instance-1870647-1245214910.opb
37.38/37.46 c Variables : 2888 (2888 binary, 0 integer, 0 implicit integer, 0 continuous)
37.38/37.46 c Constraints : 3090 initial, 3090 maximal
37.38/37.46 c Presolved Problem :
37.38/37.46 c Problem name : t_HOME/instance-1870647-1245214910.opb
37.38/37.46 c Variables : 2888 (2888 binary, 0 integer, 0 implicit integer, 0 continuous)
37.38/37.46 c Constraints : 3090 initial, 3093 maximal
37.38/37.46 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
37.38/37.46 c trivial : 0.01 0 0 0 0 0 0 0 0
37.38/37.46 c dualfix : 0.00 0 0 0 0 0 0 0 0
37.38/37.46 c boundshift : 0.00 0 0 0 0 0 0 0 0
37.38/37.46 c inttobinary : 0.00 0 0 0 0 0 0 0 0
37.38/37.46 c implics : 0.00 0 0 0 0 0 0 0 0
37.38/37.46 c probing : 0.00 0 0 0 0 0 0 0 0
37.38/37.46 c knapsack : 0.00 0 0 0 0 0 0 0 0
37.38/37.46 c setppc : 0.01 0 0 0 0 0 0 0 0
37.38/37.46 c and : 0.11 0 0 0 0 0 0 0 0
37.38/37.46 c linear : 0.02 0 0 0 0 0 0 0 0
37.38/37.46 c logicor : 0.00 0 0 0 0 0 0 0 0
37.38/37.46 c root node : - 0 - - 0 - - - -
37.38/37.46 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
37.38/37.46 c integral : 0 0 0 298 0 0 0 0 0 592
37.38/37.46 c knapsack : 1 5 716 2 0 0 0 0 0 0
37.38/37.46 c setppc : 400 5 716 2 0 3 413 0 0 0
37.38/37.46 c and : 2488 301 713 2 0 0 7755 5766 0 0
37.38/37.46 c linear : 1 5 713 1 0 0 0 0 0 0
37.38/37.46 c logicor : 200+ 5 142 1 0 0 97 0 0 0
37.38/37.46 c countsols : 0 0 0 1 0 0 0 0 0 0
37.38/37.46 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
37.38/37.46 c integral : 16.41 0.00 0.00 16.41 0.00
37.38/37.46 c knapsack : 0.00 0.00 0.00 0.00 0.00
37.38/37.46 c setppc : 0.02 0.00 0.02 0.00 0.00
37.38/37.46 c and : 0.70 0.58 0.11 0.01 0.00
37.38/37.46 c linear : 0.05 0.00 0.05 0.00 0.00
37.38/37.46 c logicor : 0.00 0.00 0.00 0.00 0.00
37.38/37.46 c countsols : 0.00 0.00 0.00 0.00 0.00
37.38/37.46 c Propagators : Time Calls Cutoffs DomReds
37.38/37.46 c rootredcost : 0.00 0 0 0
37.38/37.46 c pseudoobj : 0.24 717 0 0
37.38/37.46 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
37.38/37.46 c propagation : 0.00 3 3 3 3.0 0 0.0 -
37.38/37.46 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
37.38/37.46 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
37.38/37.46 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
37.38/37.46 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
37.38/37.46 c applied globally : - - - 3 3.0 - - -
37.38/37.46 c applied locally : - - - 0 0.0 - - -
37.38/37.46 c Separators : Time Calls Cutoffs DomReds Cuts Conss
37.38/37.46 c cut pool : 0.00 4 - - 0 - (maximal pool size: 13)
37.38/37.46 c redcost : 0.18 301 0 0 0 0
37.38/37.46 c impliedbounds : 0.00 5 0 0 0 0
37.38/37.46 c intobj : 0.00 0 0 0 0 0
37.38/37.46 c gomory : 4.54 5 0 0 1000 0
37.38/37.46 c strongcg : 3.00 5 0 0 1017 0
37.38/37.46 c cmir : 0.00 0 0 0 0 0
37.38/37.46 c flowcover : 0.00 0 0 0 0 0
37.38/37.46 c clique : 0.03 5 0 0 0 0
37.38/37.46 c zerohalf : 0.00 0 0 0 0 0
37.38/37.46 c mcf : 0.01 1 0 0 0 0
37.38/37.46 c Pricers : Time Calls Vars
37.38/37.46 c problem variables: 0.00 0 0
37.38/37.46 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
37.38/37.46 c relpscost : 16.41 296 0 0 0 0 592
37.38/37.46 c pscost : 0.00 0 0 0 0 0 0
37.38/37.46 c inference : 0.00 0 0 0 0 0 0
37.38/37.46 c mostinf : 0.00 0 0 0 0 0 0
37.38/37.46 c leastinf : 0.00 0 0 0 0 0 0
37.38/37.46 c fullstrong : 0.00 0 0 0 0 0 0
37.38/37.46 c allfullstrong : 0.00 0 0 0 0 0 0
37.38/37.46 c random : 0.00 0 0 0 0 0 0
37.38/37.46 c Primal Heuristics : Time Calls Found
37.38/37.46 c LP solutions : 0.00 - 1
37.38/37.46 c pseudo solutions : 0.00 - 0
37.38/37.46 c simplerounding : 0.00 0 0
37.38/37.46 c rounding : 0.00 0 0
37.38/37.46 c shifting : 0.00 0 0
37.38/37.46 c intshifting : 0.00 0 0
37.38/37.46 c oneopt : 0.00 0 0
37.38/37.46 c fixandinfer : 0.00 0 0
37.38/37.46 c feaspump : 0.00 0 0
37.38/37.46 c coefdiving : 0.00 0 0
37.38/37.46 c pscostdiving : 0.00 0 0
37.38/37.46 c fracdiving : 0.00 0 0
37.38/37.46 c veclendiving : 0.00 0 0
37.38/37.46 c intdiving : 0.00 0 0
37.38/37.46 c actconsdiving : 0.00 0 0
37.38/37.46 c objpscostdiving : 0.00 0 0
37.38/37.46 c rootsoldiving : 0.00 0 0
37.38/37.46 c linesearchdiving : 0.00 0 0
37.38/37.46 c guideddiving : 0.00 0 0
37.38/37.46 c octane : 0.00 0 0
37.38/37.46 c rens : 0.00 0 0
37.38/37.46 c rins : 0.00 0 0
37.38/37.46 c localbranching : 0.00 0 0
37.38/37.46 c mutation : 0.00 0 0
37.38/37.46 c crossover : 0.00 0 0
37.38/37.46 c dins : 0.00 0 0
37.38/37.46 c LP : Time Calls Iterations Iter/call Iter/sec
37.38/37.46 c primal LP : 4.57 0 0 0.00 0.00
37.38/37.46 c dual LP : 6.30 569 21725 38.18 3448.41
37.38/37.46 c barrier LP : 0.00 0 0 0.00 -
37.38/37.46 c diving/probing LP: 0.00 0 0 0.00 -
37.38/37.46 c strong branching : 16.32 2667 69698 26.13 4270.71
37.38/37.46 c (at root node) : - 33 3984 120.73 -
37.38/37.46 c conflict analysis: 0.00 0 0 0.00 -
37.38/37.46 c B&B Tree :
37.38/37.46 c number of runs : 1
37.38/37.46 c nodes : 300
37.38/37.46 c nodes (total) : 300
37.38/37.46 c nodes left : 290
37.38/37.46 c max depth : 61
37.38/37.46 c max depth (total): 61
37.38/37.46 c backtracks : 15 (5.0%)
37.38/37.46 c delayed cutoffs : 0
37.38/37.46 c repropagations : 25 (30 domain reductions, 0 cutoffs)
37.38/37.46 c avg switch length: 2.05
37.38/37.46 c switching time : 4.71
37.38/37.46 c Solution :
37.38/37.46 c Solutions found : 1 (1 improvements)
37.38/37.46 c Primal Bound : +9.10000000000000e+01 (in run 1, after 300 nodes, 37.11 seconds, depth 61, found by <relaxation>)
37.38/37.46 c Dual Bound : +8.00000000000001e+01
37.38/37.46 c Gap : 13.75 %
37.38/37.46 c Root Dual Bound : +8.00000000000001e+01
37.47/37.52 c Time complete: 37.49.