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