0.05/0.08 c SCIP version 1.1.0.7
0.05/0.08 c LP-Solver SoPlex 1.4.1
0.05/0.08 c user parameter file <scip.set> not found - using default parameters
0.05/0.08 c read problem <HOME/instance-1870748-1245218073.opb>
0.05/0.08 c original problem has 6616 variables (6616 bin, 0 int, 0 impl, 0 cont) and 6818 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, 50128 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 50128 implications, 400 cliques
0.49/0.55 c presolved problem has 6616 variables (6616 bin, 0 int, 0 impl, 0 cont) and 6818 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 6216 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.28
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.74 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.74 c 0.5s| 1 | 0 | 102 | 29M| 0 | 61 |6616 |6818 |6818 |6616 | 13k| 0 | 0 | 0 | 3.000000e+01 | -- | Inf
1.39/1.44 c 1.1s| 1 | 0 | 109 | 29M| 0 | 61 |6616 |6818 |6818 |6616 | 13k| 1 | 0 | 0 | 3.000000e+01 | -- | Inf
1.89/1.97 c 1.7s| 1 | 0 | 145 | 29M| 0 | 63 |6616 |6818 |6818 |6616 | 13k| 3 | 0 | 0 | 3.000000e+01 | -- | Inf
2.49/2.52 c 2.2s| 1 | 0 | 151 | 29M| 0 | 64 |6616 |6818 |6818 |6616 | 13k| 5 | 0 | 0 | 3.000000e+01 | -- | Inf
6.19/6.24 c 5.9s| 1 | 0 | 174 | 29M| 0 | 63 |6616 |6818 |6818 |6616 | 13k| 6 | 0 | 0 | 3.000000e+01 | -- | Inf
9.38/9.42 c 9.1s| 1 | 0 | 200 | 29M| 0 | 63 |6616 |6818 |6818 |6616 | 13k| 7 | 0 | 0 | 3.000000e+01 | -- | Inf
19.89/19.94 c 19.6s| 1 | 2 | 200 | 29M| 0 | 63 |6616 |6818 |6818 |6616 | 13k| 7 | 0 | 33 | 3.000000e+01 | -- | Inf
22.78/22.84 c *22.4s| 30 | 27 | 1035 | 30M| 28 | - |6616 |6819 |5744 |6616 |1003 | 816 | 1 | 325 | 3.000000e+01 | 3.300000e+01 | 10.00%
22.78/22.84 c
22.78/22.84 c SCIP Status : solving was interrupted [solution limit reached]
22.78/22.84 c Solving Time (sec) : 22.43
22.78/22.84 c Solving Nodes : 30
22.78/22.84 c Primal Bound : +3.30000000000000e+01 (1 solutions)
22.78/22.84 c Dual Bound : +3.00000000000000e+01
22.78/22.84 c Gap : 10.00 %
22.78/22.86 c NODE 30
22.78/22.86 c DUAL BOUND 30
22.78/22.86 c PRIMAL BOUND 33
22.78/22.86 c GAP 0.1
22.78/22.86 s SATISFIABLE
22.78/22.86 v -x318 -x373 -x308 -x277 -x395 -x322 x320 -x391 -x235 -x280 -x358 -x292 -x250 -x361 -x312 -x260 -x388 -x370 -x330 -x315 -x371 x313
22.78/22.86 v -x223 -x364 -x359 -x383 -x339 -x264 -x301 -x208 -x374 -x365 -x245 -x210 -x287 -x367 -x240 -x251 -x380 -x331 -x281 -x270 -x218
22.78/22.86 v -x352 -x326 -x257 -x234 -x344 -x333 -x311 x397 -x262 -x213 -x379 -x385 -x389 -x232 -x290 -x336 -x355 -x214 -x228 -x246 -x302
22.78/22.86 v -x271 -x252 -x205 -x342 -x329 x293 x276 -x268 -x233 -x216 -x211 -x345 -x244 -x335 -x231 -x382 -x381 -x384 -x304 -x328 -x275
22.78/22.86 v -x217 -x222 -x204 -x366 -x363 -x310 -x306 -x300 -x297 -x266 -x256 -x247 -x299 -x354 -x230 -x206 -x346 -x227 -x398 x314 -x392
22.78/22.86 v -x327 -x307 -x267 -x254 -x317 -x356 -x350 -x285 -x284 -x258 -x229 -x243 -x212 -x324 -x351 -x224 -x309 x334 -x278 -x368 -x372
22.78/22.86 v -x272 -x236 -x305 -x387 -x237 -x298 -x249 -x238 -x378 -x360 -x263 -x253 -x219 x209 -x225 -x390 -x400 -x283 -x323 x348 -x289
22.78/22.86 v -x288 -x295 -x291 -x279 -x362 -x207 -x375 -x215 -x255 -x399 -x269 x201 -x396 -x393 -x357 -x353 -x349 -x337 -x332 -x321 -x319
22.78/22.86 v -x303 -x294 -x282 -x261 -x221 x220 -x338 -x286 -x248 x274 -x239 -x343 -x316 -x296 -x376 -x242 -x203 -x340 x394 x325 -x259 -x265
22.78/22.86 v -x202 -x377 -x273 x341 -x226 -x241 -x369 -x386 -x347 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
22.78/22.86 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169
22.78/22.86 v -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
22.78/22.86 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
22.78/22.86 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
22.78/22.86 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
22.78/22.86 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
22.78/22.86 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 -x31
22.78/22.86 v 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 -x3
22.78/22.86 v -x2 -x1
22.78/22.86 c SCIP Status : solving was interrupted [solution limit reached]
22.78/22.86 c Solving Time : 22.43
22.78/22.86 c Original Problem :
22.78/22.86 c Problem name : HOME/instance-1870748-1245218073.opb
22.78/22.86 c Variables : 6616 (6616 binary, 0 integer, 0 implicit integer, 0 continuous)
22.78/22.86 c Constraints : 6818 initial, 6818 maximal
22.78/22.86 c Presolved Problem :
22.78/22.86 c Problem name : t_HOME/instance-1870748-1245218073.opb
22.78/22.86 c Variables : 6616 (6616 binary, 0 integer, 0 implicit integer, 0 continuous)
22.78/22.86 c Constraints : 6818 initial, 6819 maximal
22.78/22.86 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
22.78/22.86 c trivial : 0.00 0 0 0 0 0 0 0 0
22.78/22.86 c dualfix : 0.00 0 0 0 0 0 0 0 0
22.78/22.86 c boundshift : 0.00 0 0 0 0 0 0 0 0
22.78/22.86 c inttobinary : 0.00 0 0 0 0 0 0 0 0
22.78/22.86 c implics : 0.00 0 0 0 0 0 0 0 0
22.78/22.86 c probing : 0.00 0 0 0 0 0 0 0 0
22.78/22.86 c knapsack : 0.01 0 0 0 0 0 0 0 0
22.78/22.86 c setppc : 0.00 0 0 0 0 0 0 0 0
22.78/22.86 c and : 0.17 0 0 0 0 0 0 0 0
22.78/22.86 c linear : 0.05 0 0 0 0 0 0 0 0
22.78/22.86 c logicor : 0.00 0 0 0 0 0 0 0 0
22.78/22.86 c root node : - 0 - - 0 - - - -
22.78/22.86 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
22.78/22.86 c integral : 0 0 0 54 0 0 0 0 0 56
22.78/22.86 c knapsack : 1 5 95 26 0 0 0 0 0 0
22.78/22.86 c setppc : 400 5 95 26 0 1 105 0 0 0
22.78/22.86 c and : 6216 33 94 26 0 0 1029 809 0 0
22.78/22.86 c linear : 1 5 94 1 0 0 0 0 0 0
22.78/22.86 c logicor : 200+ 5 32 1 0 0 22 0 0 0
22.78/22.86 c countsols : 0 0 0 1 0 0 0 0 0 0
22.78/22.86 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
22.78/22.86 c integral : 12.25 0.00 0.00 12.25 0.00
22.78/22.86 c knapsack : 0.00 0.00 0.00 0.00 0.00
22.78/22.86 c setppc : 0.00 0.00 0.00 0.00 0.00
22.78/22.86 c and : 0.20 0.11 0.05 0.04 0.00
22.78/22.86 c linear : 0.00 0.00 0.00 0.00 0.00
22.78/22.86 c logicor : 0.01 0.00 0.01 0.00 0.00
22.78/22.86 c countsols : 0.00 0.00 0.00 0.00 0.00
22.78/22.86 c Propagators : Time Calls Cutoffs DomReds
22.78/22.86 c rootredcost : 0.00 0 0 0
22.78/22.86 c pseudoobj : 0.13 96 0 0
22.78/22.86 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
22.78/22.86 c propagation : 0.00 1 1 1 3.0 0 0.0 -
22.78/22.86 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
22.78/22.86 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
22.78/22.86 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
22.78/22.86 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
22.78/22.86 c applied globally : - - - 1 3.0 - - -
22.78/22.86 c applied locally : - - - 0 0.0 - - -
22.78/22.86 c Separators : Time Calls Cutoffs DomReds Cuts Conss
22.78/22.86 c cut pool : 0.00 4 - - 4 - (maximal pool size: 22)
22.78/22.86 c redcost : 0.03 33 0 0 0 0
22.78/22.86 c impliedbounds : 0.00 5 0 0 0 0
22.78/22.86 c intobj : 0.00 0 0 0 0 0
22.78/22.86 c gomory : 4.82 5 0 0 1500 0
22.78/22.86 c strongcg : 3.30 5 0 0 2085 0
22.78/22.86 c cmir : 0.00 0 0 0 0 0
22.78/22.86 c flowcover : 0.00 0 0 0 0 0
22.78/22.86 c clique : 0.04 5 0 0 0 0
22.78/22.86 c zerohalf : 0.00 0 0 0 0 0
22.78/22.86 c mcf : 0.27 2 0 0 0 0
22.78/22.86 c Pricers : Time Calls Vars
22.78/22.86 c problem variables: 0.00 0 0
22.78/22.86 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
22.78/22.86 c relpscost : 12.25 28 0 0 0 0 56
22.78/22.86 c pscost : 0.00 0 0 0 0 0 0
22.78/22.86 c inference : 0.00 0 0 0 0 0 0
22.78/22.86 c mostinf : 0.00 0 0 0 0 0 0
22.78/22.86 c leastinf : 0.00 0 0 0 0 0 0
22.78/22.86 c fullstrong : 0.00 0 0 0 0 0 0
22.78/22.86 c allfullstrong : 0.00 0 0 0 0 0 0
22.78/22.86 c random : 0.00 0 0 0 0 0 0
22.78/22.86 c Primal Heuristics : Time Calls Found
22.78/22.86 c LP solutions : 0.00 - 1
22.78/22.86 c pseudo solutions : 0.00 - 0
22.78/22.86 c simplerounding : 0.00 0 0
22.78/22.86 c rounding : 0.00 0 0
22.78/22.86 c shifting : 0.00 0 0
22.78/22.86 c intshifting : 0.00 0 0
22.78/22.86 c oneopt : 0.00 0 0
22.78/22.86 c fixandinfer : 0.00 0 0
22.78/22.86 c feaspump : 0.00 0 0
22.78/22.86 c coefdiving : 0.00 0 0
22.78/22.86 c pscostdiving : 0.00 0 0
22.78/22.86 c fracdiving : 0.00 0 0
22.78/22.86 c veclendiving : 0.00 0 0
22.78/22.86 c intdiving : 0.00 0 0
22.78/22.86 c actconsdiving : 0.00 0 0
22.78/22.86 c objpscostdiving : 0.00 0 0
22.78/22.86 c rootsoldiving : 0.00 0 0
22.78/22.86 c linesearchdiving : 0.00 0 0
22.78/22.86 c guideddiving : 0.00 0 0
22.78/22.86 c octane : 0.00 0 0
22.78/22.86 c rens : 0.00 0 0
22.78/22.86 c rins : 0.00 0 0
22.78/22.86 c localbranching : 0.00 0 0
22.78/22.86 c mutation : 0.00 0 0
22.78/22.86 c crossover : 0.00 0 0
22.78/22.86 c dins : 0.00 0 0
22.78/22.86 c LP : Time Calls Iterations Iter/call Iter/sec
22.78/22.86 c primal LP : 0.04 0 0 0.00 0.00
22.78/22.86 c dual LP : 0.57 87 1035 11.90 1815.79
22.78/22.86 c barrier LP : 0.00 0 0 0.00 -
22.78/22.86 c diving/probing LP: 0.00 0 0 0.00 -
22.78/22.86 c strong branching : 12.24 325 9786 30.11 799.51
22.78/22.86 c (at root node) : - 33 6848 207.52 -
22.78/22.86 c conflict analysis: 0.00 0 0 0.00 -
22.78/22.86 c B&B Tree :
22.78/22.86 c number of runs : 1
22.78/22.86 c nodes : 30
22.78/22.86 c nodes (total) : 30
22.78/22.86 c nodes left : 27
22.78/22.86 c max depth : 28
22.78/22.86 c max depth (total): 28
22.78/22.86 c backtracks : 0 (0.0%)
22.78/22.86 c delayed cutoffs : 0
22.78/22.86 c repropagations : 15 (34 domain reductions, 0 cutoffs)
22.78/22.86 c avg switch length: 1.97
22.78/22.86 c switching time : 0.07
22.78/22.86 c Solution :
22.78/22.86 c Solutions found : 1 (1 improvements)
22.78/22.86 c Primal Bound : +3.30000000000000e+01 (in run 1, after 30 nodes, 22.43 seconds, depth 28, found by <relaxation>)
22.78/22.86 c Dual Bound : +3.00000000000000e+01
22.78/22.86 c Gap : 10.00 %
22.78/22.86 c Root Dual Bound : +3.00000000000000e+01
22.88/22.96 c Time complete: 22.94.