0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver SoPlex 1.4.1
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1870696-1245215864.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.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, 20624 impls, 400 clqs
0.29/0.37 c presolving (2 rounds):
0.29/0.37 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.37 c 20624 implications, 400 cliques
0.29/0.37 c presolved problem has 2928 variables (2928 bin, 0 int, 0 impl, 0 cont) and 3130 constraints
0.29/0.37 c 1 constraints of type <knapsack>
0.29/0.37 c 400 constraints of type <setppc>
0.29/0.37 c 2528 constraints of type <and>
0.29/0.37 c 1 constraints of type <linear>
0.29/0.37 c 200 constraints of type <logicor>
0.29/0.37 c transformed objective value is always integral (scale: 1)
0.29/0.37 c Presolving Time: 0.15
0.29/0.37 c SATUNSAT-NLC
0.29/0.37 c -----------------------------------------------------------------------------------------------
0.29/0.37 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.37 c separating/flowcover/freq = c -1
0.29/0.37 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.37 c separating/cmir/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/veclendiving/freq = c -1
0.29/0.37 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.37 c heuristics/simplerounding/freq = c -1
0.29/0.37 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/shifting/freq = c -1
0.29/0.37 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.37 c heuristics/rounding/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.37 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.37 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.37 c heuristics/rootsoldiving/freq = c -1
0.29/0.37 c # number of nodes added to the contingent of the total nodes
0.29/0.37 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.37 c heuristics/rens/nodesofs = c 2000
0.29/0.37 c # minimum percentage of integer variables that have to be fixable
0.29/0.37 c # [type: real, range: [0,1], default: 0.5]
0.29/0.37 c heuristics/rens/minfixingrate = c 0.3
0.29/0.37 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.37 c heuristics/rens/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/pscostdiving/freq = c -1
0.29/0.37 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.37 c heuristics/oneopt/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.37 c # [type: real, range: [0,1], default: 0.01]
0.29/0.37 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.37 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.37 c heuristics/objpscostdiving/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/linesearchdiving/freq = c -1
0.29/0.37 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/intshifting/freq = c -1
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/guideddiving/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/fracdiving/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.37 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.37 c heuristics/feaspump/freq = c -1
0.29/0.37 c # minimum percentage of integer variables that have to be fixed
0.29/0.37 c # [type: real, range: [0,1], default: 0.666]
0.29/0.37 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.37 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.37 c # [type: real, range: [0,1], default: 0.1]
0.29/0.37 c heuristics/crossover/nodesquot = c 0.15
0.29/0.37 c # number of nodes without incumbent change that heuristic should wait
0.29/0.37 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.37 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.37 c # number of nodes added to the contingent of the total nodes
0.29/0.37 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.37 c heuristics/crossover/nodesofs = c 750
0.29/0.37 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.37 c heuristics/crossover/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/coefdiving/freq = c -1
0.29/0.37 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37 c presolving/probing/maxrounds = c 0
0.29/0.37 c # should presolving try to simplify knapsacks
0.29/0.37 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.37 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.37 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.37 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.37 c constraints/knapsack/disaggregation = c FALSE
0.29/0.37 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.37 c # should presolving try to simplify inequalities
0.29/0.37 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.37 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.37 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37 c separating/maxroundsroot = c 5
0.29/0.37 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.37 c separating/maxrounds = c 1
0.29/0.37 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37 c limits/solutions = c 1
0.29/0.37 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.37 c limits/memory = c 1620
0.29/0.37 c # maximal time in seconds to run
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.37 c limits/time = c 1791
0.29/0.37 c # frequency for displaying node information lines
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.37 c display/freq = c 10000
0.29/0.37 c -----------------------------------------------------------------------------------------------
0.29/0.37 c start solving problem
0.29/0.37 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 | 291 | 13M| 0 | 159 |2928 |3130 |3130 |2928 |5658 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.89/0.95 c 0.7s| 1 | 0 | 374 | 13M| 0 | 159 |2928 |3130 |3130 |2928 |5659 | 1 | 0 | 0 | 8.000000e+01 | -- | Inf
2.39/2.45 c 2.2s| 1 | 0 | 510 | 13M| 0 | 160 |2928 |3130 |3130 |2928 |5660 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
3.99/4.09 c 3.8s| 1 | 0 | 630 | 13M| 0 | 160 |2928 |3130 |3130 |2928 |5661 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
6.19/6.26 c 6.0s| 1 | 0 | 770 | 13M| 0 | 161 |2928 |3130 |3130 |2928 |5662 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
8.69/8.74 c 8.4s| 1 | 0 | 910 | 13M| 0 | 160 |2928 |3130 |3130 |2928 |5663 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
20.38/20.45 c 20.1s| 1 | 2 | 910 | 13M| 0 | 160 |2928 |3130 |3130 |2928 |5663 | 5 | 0 | 33 | 8.000000e+01 | -- | Inf
32.78/32.87 c *32.5s| 103 | 94 | 4539 | 14M| 49 | - |2928 |3131 |1827 |2928 |1404 |3615 | 1 |1508 | 8.000000e+01 | 9.400000e+01 | 17.50%
32.78/32.87 c
32.78/32.87 c SCIP Status : solving was interrupted [solution limit reached]
32.78/32.87 c Solving Time (sec) : 32.45
32.78/32.87 c Solving Nodes : 103
32.78/32.87 c Primal Bound : +9.40000000000000e+01 (1 solutions)
32.78/32.87 c Dual Bound : +8.00000000000002e+01
32.78/32.87 c Gap : 17.50 %
32.78/32.88 c NODE 103
32.78/32.88 c DUAL BOUND 80
32.78/32.88 c PRIMAL BOUND 94
32.78/32.88 c GAP 0.175
32.78/32.88 s SATISFIABLE
32.78/32.88 v -x385 -x378 -x363 -x375 -x262 x387 -x398 -x331 -x303 -x394 -x240 x255 -x271 -x360 -x239 x350 -x260 -x283 -x370 x297 x231 x306 -x334
32.78/32.88 v -x292 -x356 x323 -x393 -x257 -x349 -x388 -x305 -x301 -x245 -x357 -x361 -x220 -x241 -x230 -x296 -x338 x314 -x310 x286 -x348
32.78/32.88 v -x312 -x246 -x329 -x307 -x339 -x326 -x311 -x376 -x337 -x300 -x218 -x217 -x365 -x244 -x226 -x256 -x358 x284 -x335 -x364 -x319
32.78/32.88 v -x293 -x242 -x278 x396 -x268 -x213 -x380 -x369 x346 -x281 -x395 -x327 -x373 -x330 -x308 -x333 -x397 -x270 -x263 -x325 -x313
32.78/32.88 v x351 -x318 -x259 x371 -x302 -x320 -x315 -x344 x209 -x383 -x299 x252 -x225 x379 -x359 -x392 -x235 -x295 -x219 -x264 -x279 -x275
32.78/32.88 v x304 -x207 -x391 -x352 -x336 -x316 -x267 x210 -x288 -x345 x291 -x251 -x340 -x289 -x269 -x234 x381 -x342 -x298 -x282 -x317
32.78/32.88 v -x243 -x390 x228 x324 -x354 -x389 -x386 x372 -x353 -x223 -x216 -x294 -x208 x224 -x236 -x214 -x204 -x290 -x266 -x238 -x254 -x341
32.78/32.88 v x362 -x400 -x309 -x285 -x203 -x265 x237 -x328 -x347 x368 -x253 x384 x332 -x374 -x280 x202 -x377 -x367 -x355 -x343 x232 -x205
32.78/32.88 v -x206 -x215 -x287 -x229 -x221 x399 x261 -x249 -x227 x201 -x322 -x272 -x258 x248 -x247 -x222 -x212 -x382 x274 -x250 -x321
32.78/32.88 v x233 x277 -x273 x211 -x366 -x276 -x200 -x199 x198 x197 -x196 x195 -x194 -x193 -x192 x191 -x190 -x189 -x188 -x187 -x186 x185 -x184
32.78/32.88 v -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 x169 -x168 -x167 -x166 -x165 x164 x163
32.78/32.88 v -x162 -x161 -x160 -x159 -x158 x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148 x147 -x146 x145 x144 -x143 x142 x141
32.78/32.88 v -x140 -x139 -x138 -x137 -x136 -x135 x134 x133 -x132 -x131 -x130 x129 x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120
32.78/32.88 v -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x110 -x109 x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 x98
32.78/32.88 v -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
32.78/32.88 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
32.78/32.88 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
32.78/32.88 v -x19 -x18 x17 x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
32.78/32.88 c SCIP Status : solving was interrupted [solution limit reached]
32.78/32.88 c Solving Time : 32.45
32.78/32.88 c Original Problem :
32.78/32.88 c Problem name : HOME/instance-1870696-1245215864.opb
32.78/32.88 c Variables : 2928 (2928 binary, 0 integer, 0 implicit integer, 0 continuous)
32.78/32.88 c Constraints : 3130 initial, 3130 maximal
32.78/32.88 c Presolved Problem :
32.78/32.88 c Problem name : t_HOME/instance-1870696-1245215864.opb
32.78/32.88 c Variables : 2928 (2928 binary, 0 integer, 0 implicit integer, 0 continuous)
32.78/32.88 c Constraints : 3130 initial, 3131 maximal
32.78/32.88 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
32.78/32.88 c trivial : 0.00 0 0 0 0 0 0 0 0
32.78/32.88 c dualfix : 0.00 0 0 0 0 0 0 0 0
32.78/32.88 c boundshift : 0.00 0 0 0 0 0 0 0 0
32.78/32.88 c inttobinary : 0.00 0 0 0 0 0 0 0 0
32.78/32.88 c implics : 0.00 0 0 0 0 0 0 0 0
32.78/32.88 c probing : 0.00 0 0 0 0 0 0 0 0
32.78/32.88 c knapsack : 0.01 0 0 0 0 0 0 0 0
32.78/32.88 c setppc : 0.00 0 0 0 0 0 0 0 0
32.78/32.88 c and : 0.09 0 0 0 0 0 0 0 0
32.78/32.88 c linear : 0.03 0 0 0 0 0 0 0 0
32.78/32.88 c logicor : 0.00 0 0 0 0 0 0 0 0
32.78/32.88 c root node : - 0 - - 0 - - - -
32.78/32.88 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
32.78/32.88 c integral : 0 0 0 107 0 0 0 0 0 202
32.78/32.88 c knapsack : 1 5 266 6 0 0 0 0 0 0
32.78/32.88 c setppc : 400 5 266 6 0 1 104 0 0 0
32.78/32.88 c and : 2528 106 265 6 0 0 2262 3657 0 0
32.78/32.88 c linear : 1 5 265 1 0 0 0 0 0 0
32.78/32.88 c logicor : 200+ 5 70 1 0 0 57 0 0 0
32.78/32.88 c countsols : 0 0 0 1 0 0 0 0 0 0
32.78/32.88 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
32.78/32.88 c integral : 21.96 0.00 0.00 21.96 0.00
32.78/32.88 c knapsack : 0.00 0.00 0.00 0.00 0.00
32.78/32.88 c setppc : 0.00 0.00 0.00 0.00 0.00
32.78/32.88 c and : 0.23 0.20 0.03 0.00 0.00
32.78/32.88 c linear : 0.02 0.01 0.01 0.00 0.00
32.78/32.88 c logicor : 0.00 0.00 0.00 0.00 0.00
32.78/32.88 c countsols : 0.00 0.00 0.00 0.00 0.00
32.78/32.88 c Propagators : Time Calls Cutoffs DomReds
32.78/32.88 c rootredcost : 0.00 0 0 0
32.78/32.88 c pseudoobj : 0.07 267 0 0
32.78/32.88 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
32.78/32.88 c propagation : 0.00 1 1 1 3.0 0 0.0 -
32.78/32.88 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
32.78/32.88 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
32.78/32.88 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
32.78/32.88 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
32.78/32.88 c applied globally : - - - 1 3.0 - - -
32.78/32.88 c applied locally : - - - 0 0.0 - - -
32.78/32.88 c Separators : Time Calls Cutoffs DomReds Cuts Conss
32.78/32.88 c cut pool : 0.00 4 - - 0 - (maximal pool size: 23)
32.78/32.88 c redcost : 0.06 106 0 0 0 0
32.78/32.88 c impliedbounds : 0.01 5 0 0 0 0
32.78/32.88 c intobj : 0.00 0 0 0 0 0
32.78/32.88 c gomory : 5.32 5 0 0 500 0
32.78/32.88 c strongcg : 2.18 5 0 0 2500 0
32.78/32.88 c cmir : 0.00 0 0 0 0 0
32.78/32.88 c flowcover : 0.00 0 0 0 0 0
32.78/32.88 c clique : 0.05 5 0 0 0 0
32.78/32.88 c zerohalf : 0.00 0 0 0 0 0
32.78/32.88 c mcf : 0.01 1 0 0 0 0
32.78/32.88 c Pricers : Time Calls Vars
32.78/32.88 c problem variables: 0.00 0 0
32.78/32.88 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
32.78/32.88 c relpscost : 21.96 101 0 0 0 0 202
32.78/32.88 c pscost : 0.00 0 0 0 0 0 0
32.78/32.88 c inference : 0.00 0 0 0 0 0 0
32.78/32.88 c mostinf : 0.00 0 0 0 0 0 0
32.78/32.88 c leastinf : 0.00 0 0 0 0 0 0
32.78/32.88 c fullstrong : 0.00 0 0 0 0 0 0
32.78/32.88 c allfullstrong : 0.00 0 0 0 0 0 0
32.78/32.88 c random : 0.00 0 0 0 0 0 0
32.78/32.88 c Primal Heuristics : Time Calls Found
32.78/32.88 c LP solutions : 0.00 - 1
32.78/32.88 c pseudo solutions : 0.00 - 0
32.78/32.88 c simplerounding : 0.00 0 0
32.78/32.88 c rounding : 0.00 0 0
32.78/32.88 c shifting : 0.00 0 0
32.78/32.88 c intshifting : 0.00 0 0
32.78/32.88 c oneopt : 0.00 0 0
32.78/32.88 c fixandinfer : 0.00 0 0
32.78/32.88 c feaspump : 0.00 0 0
32.78/32.88 c coefdiving : 0.00 0 0
32.78/32.88 c pscostdiving : 0.00 0 0
32.78/32.88 c fracdiving : 0.00 0 0
32.78/32.88 c veclendiving : 0.00 0 0
32.78/32.88 c intdiving : 0.00 0 0
32.78/32.88 c actconsdiving : 0.00 0 0
32.78/32.88 c objpscostdiving : 0.00 0 0
32.78/32.88 c rootsoldiving : 0.00 0 0
32.78/32.88 c linesearchdiving : 0.00 0 0
32.78/32.88 c guideddiving : 0.00 0 0
32.78/32.88 c octane : 0.00 0 0
32.78/32.88 c rens : 0.00 0 0
32.78/32.88 c rins : 0.00 0 0
32.78/32.88 c localbranching : 0.00 0 0
32.78/32.88 c mutation : 0.00 0 0
32.78/32.88 c crossover : 0.00 0 0
32.78/32.88 c dins : 0.00 0 0
32.78/32.88 c LP : Time Calls Iterations Iter/call Iter/sec
32.78/32.88 c primal LP : 0.16 0 0 0.00 0.00
32.78/32.88 c dual LP : 1.85 209 4539 21.72 2453.51
32.78/32.88 c barrier LP : 0.00 0 0 0.00 -
32.78/32.88 c diving/probing LP: 0.00 0 0 0.00 -
32.78/32.88 c strong branching : 21.95 1508 32608 21.62 1485.56
32.78/32.88 c (at root node) : - 33 11115 336.82 -
32.78/32.88 c conflict analysis: 0.00 0 0 0.00 -
32.78/32.88 c B&B Tree :
32.78/32.88 c number of runs : 1
32.78/32.88 c nodes : 103
32.78/32.88 c nodes (total) : 103
32.78/32.88 c nodes left : 94
32.78/32.88 c max depth : 49
32.78/32.88 c max depth (total): 49
32.78/32.88 c backtracks : 4 (3.9%)
32.78/32.88 c delayed cutoffs : 0
32.78/32.88 c repropagations : 8 (15 domain reductions, 0 cutoffs)
32.78/32.88 c avg switch length: 1.73
32.78/32.88 c switching time : 0.25
32.78/32.88 c Solution :
32.78/32.88 c Solutions found : 1 (1 improvements)
32.78/32.88 c Primal Bound : +9.40000000000000e+01 (in run 1, after 103 nodes, 32.45 seconds, depth 49, found by <relaxation>)
32.78/32.88 c Dual Bound : +8.00000000000002e+01
32.78/32.88 c Gap : 17.50 %
32.78/32.88 c Root Dual Bound : +8.00000000000000e+01
32.88/32.93 c Time complete: 32.91.