0.07/0.08 c SCIP version 1.1.0.7
0.07/0.08 c LP-Solver Clp 1.8.2
0.07/0.08 c user parameter file <scip.set> not found - using default parameters
0.07/0.08 c read problem <HOME/instance-1870645-1245214874.opb>
0.07/0.08 c original problem has 6626 variables (6626 bin, 0 int, 0 impl, 0 cont) and 6828 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, 50208 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 50208 implications, 400 cliques
0.49/0.55 c presolved problem has 6626 variables (6626 bin, 0 int, 0 impl, 0 cont) and 6828 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 6226 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.27
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.70 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.70 c 0.4s| 1 | 0 | 76 | 29M| 0 | 50 |6626 |6828 |6828 |6626 | 13k| 0 | 0 | 0 | 3.000000e+01 | -- | Inf
1.49/1.52 c 1.2s| 1 | 0 | 88 | 29M| 0 | 52 |6626 |6828 |6828 |6626 | 13k| 1 | 0 | 0 | 3.000000e+01 | -- | Inf
1.99/2.06 c 1.7s| 1 | 0 | 121 | 29M| 0 | 51 |6626 |6828 |6828 |6626 | 13k| 2 | 0 | 0 | 3.000000e+01 | -- | Inf
3.29/3.36 c 3.0s| 1 | 0 | 139 | 29M| 0 | 55 |6626 |6828 |6828 |6626 | 13k| 3 | 0 | 0 | 3.000000e+01 | -- | Inf
5.49/5.52 c 5.2s| 1 | 0 | 142 | 29M| 0 | 54 |6626 |6828 |6828 |6626 | 13k| 4 | 0 | 0 | 3.000000e+01 | -- | Inf
7.69/7.76 c 7.4s| 1 | 0 | 177 | 29M| 0 | 51 |6626 |6828 |6828 |6626 | 13k| 5 | 0 | 0 | 3.000000e+01 | -- | Inf
10.28/10.30 c 9.9s| 1 | 2 | 177 | 29M| 0 | 51 |6626 |6828 |6828 |6626 | 13k| 5 | 0 | 33 | 3.000000e+01 | -- | Inf
12.68/12.79 c *12.4s| 35 | 21 | 1048 | 31M| 29 | - |6626 |6833 |2856 |6626 | 955 | 615 | 5 | 230 | 3.000000e+01 | 3.200000e+01 | 6.67%
12.68/12.79 c
12.68/12.79 c SCIP Status : solving was interrupted [solution limit reached]
12.68/12.79 c Solving Time (sec) : 12.42
12.68/12.79 c Solving Nodes : 35
12.68/12.79 c Primal Bound : +3.20000000000000e+01 (1 solutions)
12.68/12.79 c Dual Bound : +3.00000000000000e+01
12.68/12.79 c Gap : 6.67 %
12.78/12.81 c NODE 35
12.78/12.81 c DUAL BOUND 30
12.78/12.81 c PRIMAL BOUND 32
12.78/12.81 c GAP 0.0666667
12.78/12.81 s SATISFIABLE
12.78/12.81 v -x383 -x316 -x245 -x260 -x248 -x378 -x310 -x305 -x293 -x257 x230 -x355 -x387 x352 -x380 -x394 -x240 -x393 -x385 -x376 -x301 -x360
12.78/12.81 v x290 -x297 -x350 -x209 x338 -x259 -x218 -x306 -x334 -x323 x348 -x231 -x388 -x312 -x336 -x357 -x339 -x296 -x255 -x239 -x369
12.78/12.81 v -x286 -x299 -x329 -x373 -x330 -x232 -x311 -x226 -x256 -x358 -x372 -x284 -x322 x370 -x326 -x283 -x246 -x319 -x242 -x396 -x268
12.78/12.81 v -x252 -x346 -x222 -x308 -x204 -x364 -x356 -x331 -x318 -x292 -x262 -x258 -x241 -x397 -x270 -x237 -x313 -x210 -x351 -x371 -x207
12.78/12.81 v -x302 -x320 -x315 -x377 -x344 -x353 -x379 -x219 x392 -x203 -x395 x381 -x375 -x300 -x213 -x235 x295 -x264 x279 -x275 -x345 -x291
12.78/12.81 v -x340 -x289 -x269 x234 -x317 -x243 -x390 x228 -x202 -x398 -x363 -x359 -x349 -x337 -x333 -x307 -x303 -x298 -x288 -x282 -x251
12.78/12.81 v -x247 -x244 -x212 -x324 -x386 -x354 -x389 -x223 -x294 -x224 -x236 -x266 -x214 -x254 -x272 -x341 -x362 -x400 -x309 -x285 -x328
12.78/12.81 v -x347 -x201 -x391 -x367 -x365 -x361 -x343 x342 x335 -x327 -x325 -x314 -x304 -x281 -x278 -x271 -x267 -x265 -x263 -x238 -x225
12.78/12.81 v -x220 -x217 -x216 -x208 -x205 -x368 -x253 x384 -x332 -x374 -x280 -x206 -x215 -x287 -x229 -x221 -x399 -x261 -x249 -x227 -x382
12.78/12.81 v -x274 -x250 -x321 -x233 -x277 -x273 -x211 -x366 -x276 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
12.78/12.81 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169
12.78/12.81 v -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 x151 -x150 -x149 -x148
12.78/12.81 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
12.78/12.81 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 x107 -x106
12.78/12.81 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
12.78/12.81 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 -x56
12.78/12.81 v -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
12.78/12.81 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
12.78/12.81 v x2 -x1
12.78/12.81 c SCIP Status : solving was interrupted [solution limit reached]
12.78/12.81 c Solving Time : 12.42
12.78/12.81 c Original Problem :
12.78/12.81 c Problem name : HOME/instance-1870645-1245214874.opb
12.78/12.81 c Variables : 6626 (6626 binary, 0 integer, 0 implicit integer, 0 continuous)
12.78/12.81 c Constraints : 6828 initial, 6828 maximal
12.78/12.81 c Presolved Problem :
12.78/12.81 c Problem name : t_HOME/instance-1870645-1245214874.opb
12.78/12.81 c Variables : 6626 (6626 binary, 0 integer, 0 implicit integer, 0 continuous)
12.78/12.81 c Constraints : 6828 initial, 6833 maximal
12.78/12.81 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
12.78/12.81 c trivial : 0.00 0 0 0 0 0 0 0 0
12.78/12.81 c dualfix : 0.01 0 0 0 0 0 0 0 0
12.78/12.81 c boundshift : 0.00 0 0 0 0 0 0 0 0
12.78/12.81 c inttobinary : 0.00 0 0 0 0 0 0 0 0
12.78/12.81 c implics : 0.00 0 0 0 0 0 0 0 0
12.78/12.81 c probing : 0.00 0 0 0 0 0 0 0 0
12.78/12.81 c knapsack : 0.01 0 0 0 0 0 0 0 0
12.78/12.81 c setppc : 0.01 0 0 0 0 0 0 0 0
12.78/12.81 c and : 0.15 0 0 0 0 0 0 0 0
12.78/12.81 c linear : 0.05 0 0 0 0 0 0 0 0
12.78/12.81 c logicor : 0.01 0 0 0 0 0 0 0 0
12.78/12.81 c root node : - 0 - - 0 - - - -
12.78/12.81 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
12.78/12.81 c integral : 0 0 0 64 0 0 0 0 0 58
12.78/12.81 c knapsack : 1 5 110 35 0 0 0 0 0 0
12.78/12.81 c setppc : 400 5 110 35 0 5 262 0 0 0
12.78/12.81 c and : 6226 34 105 35 0 0 3827 610 0 0
12.78/12.81 c linear : 1 5 105 1 0 0 0 0 0 0
12.78/12.81 c logicor : 200+ 5 34 1 0 0 27 0 0 0
12.78/12.81 c countsols : 0 0 0 1 0 0 0 0 0 0
12.78/12.81 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
12.78/12.81 c integral : 3.28 0.00 0.00 3.28 0.00
12.78/12.81 c knapsack : 0.00 0.00 0.00 0.00 0.00
12.78/12.81 c setppc : 0.02 0.00 0.02 0.00 0.00
12.78/12.81 c and : 0.21 0.13 0.01 0.07 0.00
12.78/12.81 c linear : 0.01 0.00 0.01 0.00 0.00
12.78/12.81 c logicor : 0.01 0.00 0.01 0.00 0.00
12.78/12.81 c countsols : 0.00 0.00 0.00 0.00 0.00
12.78/12.81 c Propagators : Time Calls Cutoffs DomReds
12.78/12.81 c rootredcost : 0.00 0 0 0
12.78/12.81 c pseudoobj : 0.17 111 0 0
12.78/12.81 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
12.78/12.81 c propagation : 0.00 5 5 5 3.0 0 0.0 -
12.78/12.81 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
12.78/12.81 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
12.78/12.81 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
12.78/12.81 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
12.78/12.81 c applied globally : - - - 5 3.0 - - -
12.78/12.81 c applied locally : - - - 0 0.0 - - -
12.78/12.81 c Separators : Time Calls Cutoffs DomReds Cuts Conss
12.78/12.81 c cut pool : 0.00 4 - - 1 - (maximal pool size: 23)
12.78/12.81 c redcost : 0.06 34 0 0 0 0
12.78/12.81 c impliedbounds : 0.01 5 0 0 0 0
12.78/12.81 c intobj : 0.00 0 0 0 0 0
12.78/12.81 c gomory : 4.81 5 0 0 1528 0
12.78/12.81 c strongcg : 1.73 5 0 0 2500 0
12.78/12.81 c cmir : 0.00 0 0 0 0 0
12.78/12.81 c flowcover : 0.00 0 0 0 0 0
12.78/12.81 c clique : 0.03 5 0 0 0 0
12.78/12.81 c zerohalf : 0.00 0 0 0 0 0
12.78/12.81 c mcf : 0.27 2 0 0 0 0
12.78/12.81 c Pricers : Time Calls Vars
12.78/12.81 c problem variables: 0.00 0 0
12.78/12.81 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
12.78/12.81 c relpscost : 3.28 29 0 0 0 0 58
12.78/12.81 c pscost : 0.00 0 0 0 0 0 0
12.78/12.81 c inference : 0.00 0 0 0 0 0 0
12.78/12.81 c mostinf : 0.00 0 0 0 0 0 0
12.78/12.81 c leastinf : 0.00 0 0 0 0 0 0
12.78/12.81 c fullstrong : 0.00 0 0 0 0 0 0
12.78/12.81 c allfullstrong : 0.00 0 0 0 0 0 0
12.78/12.81 c random : 0.00 0 0 0 0 0 0
12.78/12.81 c Primal Heuristics : Time Calls Found
12.78/12.81 c LP solutions : 0.01 - 1
12.78/12.81 c pseudo solutions : 0.00 - 0
12.78/12.81 c simplerounding : 0.00 0 0
12.78/12.81 c rounding : 0.00 0 0
12.78/12.81 c shifting : 0.00 0 0
12.78/12.81 c intshifting : 0.00 0 0
12.78/12.81 c oneopt : 0.00 0 0
12.78/12.81 c fixandinfer : 0.00 0 0
12.78/12.81 c feaspump : 0.00 0 0
12.78/12.81 c coefdiving : 0.00 0 0
12.78/12.81 c pscostdiving : 0.00 0 0
12.78/12.81 c fracdiving : 0.00 0 0
12.78/12.81 c veclendiving : 0.00 0 0
12.78/12.81 c intdiving : 0.00 0 0
12.78/12.81 c actconsdiving : 0.00 0 0
12.78/12.81 c objpscostdiving : 0.00 0 0
12.78/12.81 c rootsoldiving : 0.00 0 0
12.78/12.81 c linesearchdiving : 0.00 0 0
12.78/12.81 c guideddiving : 0.00 0 0
12.78/12.81 c octane : 0.00 0 0
12.78/12.81 c rens : 0.00 0 0
12.78/12.81 c rins : 0.00 0 0
12.78/12.81 c localbranching : 0.00 0 0
12.78/12.81 c mutation : 0.00 0 0
12.78/12.81 c crossover : 0.00 0 0
12.78/12.81 c dins : 0.00 0 0
12.78/12.81 c LP : Time Calls Iterations Iter/call Iter/sec
12.78/12.81 c primal LP : 0.27 0 0 0.00 0.00
12.78/12.81 c dual LP : 0.81 94 1048 11.15 1293.83
12.78/12.81 c barrier LP : 0.00 0 0 0.00 -
12.78/12.81 c diving/probing LP: 0.00 0 0 0.00 -
12.78/12.81 c strong branching : 3.27 230 6337 27.55 1937.92
12.78/12.81 c (at root node) : - 33 2897 87.79 -
12.78/12.81 c conflict analysis: 0.00 0 0 0.00 -
12.78/12.81 c B&B Tree :
12.78/12.81 c number of runs : 1
12.78/12.81 c nodes : 35
12.78/12.81 c nodes (total) : 35
12.78/12.81 c nodes left : 21
12.78/12.81 c max depth : 29
12.78/12.81 c max depth (total): 29
12.78/12.81 c backtracks : 0 (0.0%)
12.78/12.81 c delayed cutoffs : 0
12.78/12.81 c repropagations : 18 (167 domain reductions, 0 cutoffs)
12.78/12.81 c avg switch length: 1.89
12.78/12.81 c switching time : 0.31
12.78/12.81 c Solution :
12.78/12.81 c Solutions found : 1 (1 improvements)
12.78/12.81 c Primal Bound : +3.20000000000000e+01 (in run 1, after 35 nodes, 12.41 seconds, depth 29, found by <relaxation>)
12.78/12.81 c Dual Bound : +3.00000000000000e+01
12.78/12.81 c Gap : 6.67 %
12.78/12.81 c Root Dual Bound : +3.00000000000000e+01
12.88/12.92 c Time complete: 12.9.