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-1870665-1245215303.opb>
0.03/0.04 c original problem has 2892 variables (2892 bin, 0 int, 0 impl, 0 cont) and 3094 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.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 20336 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 20336 implications, 400 cliques
0.29/0.39 c presolved problem has 2892 variables (2892 bin, 0 int, 0 impl, 0 cont) and 3094 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 2492 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.49 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.49 c 0.3s| 1 | 0 | 213 | 12M| 0 | 138 |2892 |3094 |3094 |2892 |5586 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.89/0.98 c 0.7s| 1 | 0 | 285 | 12M| 0 | 144 |2892 |3094 |3094 |2892 |5588 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
2.68/2.74 c 2.5s| 1 | 0 | 310 | 13M| 0 | 143 |2892 |3094 |3094 |2892 |5590 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
3.88/3.97 c 3.7s| 1 | 0 | 406 | 13M| 0 | 145 |2892 |3094 |3094 |2892 |5591 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
9.59/9.68 c 9.4s| 1 | 2 | 406 | 13M| 0 | 145 |2892 |3094 |3094 |2892 |5591 | 5 | 0 | 33 | 8.000000e+01 | -- | Inf
41.07/41.19 c *40.8s| 387 | 359 | 34205 | 15M| 52 | - |2892 |3102 |1706 |2892 |1367 | 10k| 8 |2836 | 8.000000e+01 | 8.700000e+01 | 8.75%
41.07/41.19 c
41.07/41.19 c SCIP Status : solving was interrupted [solution limit reached]
41.07/41.19 c Solving Time (sec) : 40.80
41.07/41.19 c Solving Nodes : 387
41.07/41.19 c Primal Bound : +8.70000000000000e+01 (1 solutions)
41.07/41.19 c Dual Bound : +8.00000000000001e+01
41.07/41.19 c Gap : 8.75 %
41.07/41.19 c NODE 387
41.07/41.19 c DUAL BOUND 80
41.07/41.19 c PRIMAL BOUND 87
41.07/41.19 c GAP 0.0875
41.07/41.19 s SATISFIABLE
41.07/41.19 v -x337 -x271 -x243 x325 x375 -x334 x247 -x395 x360 -x303 x396 -x330 -x295 -x298 -x296 x256 -x244 -x394 -x313 -x328 -x326 -x258 -x377
41.07/41.19 v x287 -x227 -x249 -x251 -x289 -x263 -x381 -x308 -x302 -x286 -x388 x226 x348 -x354 x364 -x230 -x301 -x266 -x314 -x352 -x272
41.07/41.19 v -x365 x223 -x312 -x290 -x281 -x240 -x220 -x279 -x327 -x353 -x216 -x339 -x241 -x341 -x267 x372 -x268 -x399 -x217 x323 x345 -x340
41.07/41.19 v x285 -x269 -x292 x351 x213 -x305 -x232 -x333 x382 -x342 -x306 -x336 -x275 -x393 -x390 -x273 -x233 -x284 -x212 -x347 -x283
41.07/41.19 v -x384 -x355 -x239 -x215 -x319 x309 x356 -x209 -x260 -x242 -x224 -x218 -x252 x304 -x282 -x277 -x254 x234 -x386 x207 -x371 -x288
41.07/41.19 v -x311 -x391 -x369 x318 x257 -x317 -x206 -x379 -x359 -x338 -x235 -x363 x349 x324 x361 x367 -x400 -x246 x205 -x344 x321 x293
41.07/41.19 v x259 x208 -x276 -x315 -x357 x366 -x261 -x307 -x329 x385 -x237 -x236 -x358 x398 -x378 x253 -x397 x362 -x383 -x387 -x203 -x335
41.07/41.19 v -x310 x274 -x270 -x248 -x225 -x204 -x214 -x297 -x231 -x211 -x392 -x316 -x370 -x373 -x202 -x332 -x322 -x300 -x280 -x245 -x229
41.07/41.19 v -x219 -x210 -x331 -x368 -x374 -x255 -x250 -x238 -x294 -x350 -x380 -x343 -x201 -x264 -x222 -x221 -x228 -x346 -x278 -x265 -x299
41.07/41.19 v -x262 -x376 -x389 -x320 -x291 -x200 -x199 -x198 x197 -x196 -x195 -x194 -x193 x192 -x191 x190 -x189 -x188 -x187 -x186 -x185
41.07/41.19 v x184 -x183 -x182 x181 -x180 -x179 x178 -x177 -x176 -x175 -x174 x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 x165 -x164 -x163
41.07/41.19 v -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 x143 -x142
41.07/41.19 v -x141 -x140 -x139 x138 -x137 -x136 -x135 x134 -x133 -x132 -x131 x130 -x129 x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121
41.07/41.19 v -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 x103 -x102 -x101 -x100 -x99
41.07/41.19 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
41.07/41.19 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
41.07/41.19 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
41.07/41.19 v -x20 x19 -x18 x17 x16 -x15 -x14 -x13 x12 x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 x3 x2 x1
41.07/41.19 c SCIP Status : solving was interrupted [solution limit reached]
41.07/41.19 c Solving Time : 40.80
41.07/41.19 c Original Problem :
41.07/41.19 c Problem name : HOME/instance-1870665-1245215303.opb
41.07/41.19 c Variables : 2892 (2892 binary, 0 integer, 0 implicit integer, 0 continuous)
41.07/41.19 c Constraints : 3094 initial, 3094 maximal
41.07/41.19 c Presolved Problem :
41.07/41.19 c Problem name : t_HOME/instance-1870665-1245215303.opb
41.07/41.19 c Variables : 2892 (2892 binary, 0 integer, 0 implicit integer, 0 continuous)
41.07/41.19 c Constraints : 3094 initial, 3102 maximal
41.07/41.19 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
41.07/41.19 c trivial : 0.00 0 0 0 0 0 0 0 0
41.07/41.19 c dualfix : 0.00 0 0 0 0 0 0 0 0
41.07/41.19 c boundshift : 0.00 0 0 0 0 0 0 0 0
41.07/41.19 c inttobinary : 0.00 0 0 0 0 0 0 0 0
41.07/41.19 c implics : 0.00 0 0 0 0 0 0 0 0
41.07/41.19 c probing : 0.00 0 0 0 0 0 0 0 0
41.07/41.19 c knapsack : 0.00 0 0 0 0 0 0 0 0
41.07/41.19 c setppc : 0.00 0 0 0 0 0 0 0 0
41.07/41.19 c and : 0.12 0 0 0 0 0 0 0 0
41.07/41.19 c linear : 0.03 0 0 0 0 0 0 0 0
41.07/41.19 c logicor : 0.00 0 0 0 0 0 0 0 0
41.07/41.19 c root node : - 0 - - 0 - - - -
41.07/41.19 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
41.07/41.19 c integral : 0 0 0 397 0 0 0 0 0 756
41.07/41.19 c knapsack : 1 4 1111 19 0 0 0 0 0 0
41.07/41.19 c setppc : 400 4 1111 19 0 8 1267 0 0 0
41.07/41.19 c and : 2492 382 1103 19 0 0 16491 10107 0 0
41.07/41.19 c linear : 1 4 1103 1 0 0 0 0 0 0
41.07/41.19 c logicor : 200+ 4 345 1 0 0 245 0 0 0
41.07/41.19 c countsols : 0 0 0 1 0 0 0 0 0 0
41.07/41.19 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
41.07/41.19 c integral : 16.23 0.00 0.00 16.23 0.00
41.07/41.19 c knapsack : 0.00 0.00 0.00 0.00 0.00
41.07/41.19 c setppc : 0.05 0.00 0.05 0.00 0.00
41.07/41.19 c and : 0.86 0.70 0.15 0.01 0.00
41.07/41.19 c linear : 0.06 0.00 0.06 0.00 0.00
41.07/41.19 c logicor : 0.00 0.00 0.00 0.00 0.00
41.07/41.19 c countsols : 0.00 0.00 0.00 0.00 0.00
41.07/41.19 c Propagators : Time Calls Cutoffs DomReds
41.07/41.19 c rootredcost : 0.00 0 0 0
41.07/41.19 c pseudoobj : 0.47 1112 0 0
41.07/41.19 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
41.07/41.19 c propagation : 0.00 8 8 8 3.0 0 0.0 -
41.07/41.19 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
41.07/41.19 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
41.07/41.19 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
41.07/41.19 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
41.07/41.19 c applied globally : - - - 8 3.0 - - -
41.07/41.19 c applied locally : - - - 0 0.0 - - -
41.07/41.19 c Separators : Time Calls Cutoffs DomReds Cuts Conss
41.07/41.19 c cut pool : 0.00 3 - - 0 - (maximal pool size: 18)
41.07/41.19 c redcost : 0.11 382 0 0 0 0
41.07/41.19 c impliedbounds : 0.00 4 0 0 0 0
41.07/41.19 c intobj : 0.00 0 0 0 0 0
41.07/41.19 c gomory : 3.45 4 0 0 1073 0
41.07/41.19 c strongcg : 1.99 4 0 0 1500 0
41.07/41.19 c cmir : 0.00 0 0 0 0 0
41.07/41.19 c flowcover : 0.00 0 0 0 0 0
41.07/41.19 c clique : 0.03 4 0 0 0 0
41.07/41.19 c zerohalf : 0.00 0 0 0 0 0
41.07/41.19 c mcf : 0.01 1 0 0 0 0
41.07/41.19 c Pricers : Time Calls Vars
41.07/41.19 c problem variables: 0.00 0 0
41.07/41.19 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
41.07/41.19 c relpscost : 16.23 378 0 0 0 0 756
41.07/41.19 c pscost : 0.00 0 0 0 0 0 0
41.07/41.19 c inference : 0.00 0 0 0 0 0 0
41.07/41.19 c mostinf : 0.00 0 0 0 0 0 0
41.07/41.19 c leastinf : 0.00 0 0 0 0 0 0
41.07/41.19 c fullstrong : 0.00 0 0 0 0 0 0
41.07/41.20 c allfullstrong : 0.00 0 0 0 0 0 0
41.07/41.20 c random : 0.00 0 0 0 0 0 0
41.07/41.20 c Primal Heuristics : Time Calls Found
41.07/41.20 c LP solutions : 0.00 - 1
41.07/41.20 c pseudo solutions : 0.00 - 0
41.07/41.20 c simplerounding : 0.00 0 0
41.07/41.20 c rounding : 0.00 0 0
41.07/41.20 c shifting : 0.00 0 0
41.07/41.20 c intshifting : 0.00 0 0
41.07/41.20 c oneopt : 0.00 0 0
41.07/41.20 c fixandinfer : 0.00 0 0
41.07/41.20 c feaspump : 0.00 0 0
41.07/41.20 c coefdiving : 0.00 0 0
41.07/41.20 c pscostdiving : 0.00 0 0
41.07/41.20 c fracdiving : 0.00 0 0
41.07/41.20 c veclendiving : 0.00 0 0
41.07/41.20 c intdiving : 0.00 0 0
41.07/41.20 c actconsdiving : 0.00 0 0
41.07/41.20 c objpscostdiving : 0.00 0 0
41.07/41.20 c rootsoldiving : 0.00 0 0
41.07/41.20 c linesearchdiving : 0.00 0 0
41.07/41.20 c guideddiving : 0.00 0 0
41.07/41.20 c octane : 0.00 0 0
41.07/41.20 c rens : 0.00 0 0
41.07/41.20 c rins : 0.00 0 0
41.07/41.20 c localbranching : 0.00 0 0
41.07/41.20 c mutation : 0.00 0 0
41.07/41.20 c crossover : 0.00 0 0
41.07/41.20 c dins : 0.00 0 0
41.07/41.20 c LP : Time Calls Iterations Iter/call Iter/sec
41.07/41.20 c primal LP : 6.55 0 0 0.00 0.00
41.07/41.20 c dual LP : 9.39 776 34205 44.08 3642.71
41.07/41.20 c barrier LP : 0.00 0 0 0.00 -
41.07/41.20 c diving/probing LP: 0.00 0 0 0.00 -
41.07/41.20 c strong branching : 16.19 2836 54935 19.37 3393.14
41.07/41.20 c (at root node) : - 33 5315 161.06 -
41.07/41.20 c conflict analysis: 0.00 0 0 0.00 -
41.07/41.20 c B&B Tree :
41.07/41.20 c number of runs : 1
41.07/41.20 c nodes : 387
41.07/41.20 c nodes (total) : 387
41.07/41.20 c nodes left : 359
41.07/41.20 c max depth : 52
41.07/41.20 c max depth (total): 52
41.07/41.20 c backtracks : 16 (4.1%)
41.07/41.20 c delayed cutoffs : 0
41.07/41.20 c repropagations : 90 (113 domain reductions, 0 cutoffs)
41.07/41.20 c avg switch length: 2.33
41.07/41.20 c switching time : 6.77
41.07/41.20 c Solution :
41.07/41.20 c Solutions found : 1 (1 improvements)
41.07/41.20 c Primal Bound : +8.70000000000000e+01 (in run 1, after 387 nodes, 40.80 seconds, depth 52, found by <relaxation>)
41.07/41.20 c Dual Bound : +8.00000000000001e+01
41.07/41.20 c Gap : 8.75 %
41.07/41.20 c Root Dual Bound : +8.00000000000001e+01
41.17/41.25 c Time complete: 41.23.