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-1870678-1245215601.opb>
0.00/0.04 c original problem has 2882 variables (2882 bin, 0 int, 0 impl, 0 cont) and 3084 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, 20256 impls, 400 clqs
0.29/0.36 c presolving (2 rounds):
0.29/0.36 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.36 c 20256 implications, 400 cliques
0.29/0.36 c presolved problem has 2882 variables (2882 bin, 0 int, 0 impl, 0 cont) and 3084 constraints
0.29/0.36 c 1 constraints of type <knapsack>
0.29/0.36 c 400 constraints of type <setppc>
0.29/0.36 c 2482 constraints of type <and>
0.29/0.36 c 1 constraints of type <linear>
0.29/0.36 c 200 constraints of type <logicor>
0.29/0.36 c transformed objective value is always integral (scale: 1)
0.29/0.36 c Presolving Time: 0.15
0.29/0.36 c SATUNSAT-NLC
0.29/0.36 c -----------------------------------------------------------------------------------------------
0.29/0.36 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c separating/flowcover/freq = c -1
0.29/0.36 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c separating/cmir/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/veclendiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/simplerounding/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/shifting/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/rounding/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.36 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.36 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/rootsoldiving/freq = c -1
0.29/0.36 c # number of nodes added to the contingent of the total nodes
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.36 c heuristics/rens/nodesofs = c 2000
0.29/0.36 c # minimum percentage of integer variables that have to be fixable
0.29/0.36 c # [type: real, range: [0,1], default: 0.5]
0.29/0.36 c heuristics/rens/minfixingrate = c 0.3
0.29/0.36 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c heuristics/rens/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/pscostdiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/oneopt/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.36 c # [type: real, range: [0,1], default: 0.01]
0.29/0.36 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.36 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/objpscostdiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/linesearchdiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/intshifting/freq = c -1
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/guideddiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/fracdiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.36 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/feaspump/freq = c -1
0.29/0.36 c # minimum percentage of integer variables that have to be fixed
0.29/0.36 c # [type: real, range: [0,1], default: 0.666]
0.29/0.36 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.36 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.36 c # [type: real, range: [0,1], default: 0.1]
0.29/0.36 c heuristics/crossover/nodesquot = c 0.15
0.29/0.36 c # number of nodes without incumbent change that heuristic should wait
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.36 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.36 c # number of nodes added to the contingent of the total nodes
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.36 c heuristics/crossover/nodesofs = c 750
0.29/0.36 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.36 c heuristics/crossover/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/coefdiving/freq = c -1
0.29/0.36 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c presolving/probing/maxrounds = c 0
0.29/0.36 c # should presolving try to simplify knapsacks
0.29/0.36 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.36 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.36 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.36 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.36 c constraints/knapsack/disaggregation = c FALSE
0.29/0.36 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.36 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.44 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.44 c 0.2s| 1 | 0 | 96 | 12M| 0 | 46 |2882 |3084 |3084 |2882 |5566 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.69/0.78 c 0.6s| 1 | 0 | 100 | 12M| 0 | 45 |2882 |3084 |3084 |2882 |5568 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
1.19/1.22 c 1.0s| 1 | 0 | 107 | 13M| 0 | 46 |2882 |3084 |3084 |2882 |5569 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.88/1.97 c 1.7s| 1 | 0 | 119 | 13M| 0 | 44 |2882 |3084 |3084 |2882 |5570 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
2.79/2.85 c 2.6s| 1 | 0 | 151 | 13M| 0 | 42 |2882 |3084 |3084 |2882 |5571 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
3.58/3.60 c 3.3s| 1 | 0 | 182 | 13M| 0 | 43 |2882 |3084 |3084 |2882 |5572 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
6.38/6.41 c 6.1s| 1 | 2 | 182 | 13M| 0 | 43 |2882 |3084 |3084 |2882 |5572 | 6 | 0 | 33 | 3.000000e+01 | -- | Inf
6.88/6.96 c * 6.7s| 11 | 0 | 409 | 13M| 10 | - |2882 |3084 |2923 |2882 | 708 | 44 | 0 | 131 | 3.000000e+01 | 3.000000e+01 | 0.00%
6.88/6.97 c
6.88/6.97 c SCIP Status : problem is solved [optimal solution found]
6.88/6.97 c Solving Time (sec) : 6.67
6.88/6.97 c Solving Nodes : 11
6.88/6.97 c Primal Bound : +3.00000000000000e+01 (1 solutions)
6.88/6.97 c Dual Bound : +3.00000000000000e+01
6.88/6.97 c Gap : 0.00 %
6.88/6.97 c NODE 11
6.88/6.97 c DUAL BOUND 30
6.88/6.97 c PRIMAL BOUND 30
6.88/6.97 c GAP 0
6.88/6.97 s SATISFIABLE
6.88/6.97 v -x313 -x342 -x248 -x392 -x390 -x358 -x297 -x348 -x254 -x386 -x286 -x345 -x376 -x231 -x294 -x280 -x360 -x382 -x332 -x255 -x323 -x321
6.88/6.97 v -x359 -x343 -x224 -x353 -x256 -x391 -x239 -x237 -x300 -x370 -x349 -x335 -x305 -x317 -x377 -x395 -x361 -x367 -x299 -x267
6.88/6.97 v -x238 -x352 -x233 -x218 -x283 -x269 -x344 -x388 -x217 -x289 -x380 -x356 -x322 x216 -x339 -x319 -x312 -x246 -x350 -x347 -x249
6.88/6.97 v -x271 -x272 -x329 -x308 -x284 -x307 -x366 -x354 -x334 -x275 -x310 -x372 -x232 -x362 -x315 -x236 -x241 -x220 -x290 -x281 -x375
6.88/6.97 v -x262 -x302 -x253 -x318 -x303 -x298 x210 -x234 -x295 -x213 -x340 -x245 -x261 -x400 -x355 -x252 -x389 -x379 -x277 -x208 -x276
6.88/6.97 v -x266 -x219 -x351 -x244 -x365 -x215 -x346 x207 -x301 -x264 -x235 -x314 -x247 -x328 -x285 -x326 -x306 -x206 -x398 -x288 -x279
6.88/6.97 v -x278 -x265 -x258 -x242 -x226 -x282 -x397 -x357 -x381 -x292 -x214 -x205 -x393 -x311 -x296 -x274 -x240 -x225 -x221 -x371 -x325
6.88/6.97 v -x338 -x385 -x320 -x374 -x399 -x309 -x209 -x257 -x270 -x259 -x223 -x330 -x203 -x396 -x273 -x251 -x243 -x204 -x268 -x324 -x263
6.88/6.97 v -x331 -x383 -x230 -x368 -x369 -x212 -x202 -x211 x337 -x373 x227 -x341 -x327 -x364 x260 x291 -x228 x363 -x201 -x333 -x304 -x229
6.88/6.97 v x222 x250 -x293 x387 -x336 -x394 x316 x378 x287 x384 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
6.88/6.97 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169
6.88/6.97 v -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
6.88/6.97 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
6.88/6.97 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
6.88/6.97 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
6.88/6.97 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
6.88/6.97 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
6.88/6.97 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 x3
6.88/6.97 v -x2 -x1
6.88/6.97 c SCIP Status : problem is solved [optimal solution found]
6.88/6.97 c Solving Time : 6.67
6.88/6.97 c Original Problem :
6.88/6.97 c Problem name : HOME/instance-1870678-1245215601.opb
6.88/6.97 c Variables : 2882 (2882 binary, 0 integer, 0 implicit integer, 0 continuous)
6.88/6.97 c Constraints : 3084 initial, 3084 maximal
6.88/6.97 c Presolved Problem :
6.88/6.97 c Problem name : t_HOME/instance-1870678-1245215601.opb
6.88/6.97 c Variables : 2882 (2882 binary, 0 integer, 0 implicit integer, 0 continuous)
6.88/6.97 c Constraints : 3084 initial, 3084 maximal
6.88/6.97 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
6.88/6.97 c trivial : 0.00 0 0 0 0 0 0 0 0
6.88/6.97 c dualfix : 0.00 0 0 0 0 0 0 0 0
6.88/6.97 c boundshift : 0.00 0 0 0 0 0 0 0 0
6.88/6.97 c inttobinary : 0.00 0 0 0 0 0 0 0 0
6.88/6.97 c implics : 0.00 0 0 0 0 0 0 0 0
6.88/6.97 c probing : 0.00 0 0 0 0 0 0 0 0
6.88/6.97 c knapsack : 0.00 0 0 0 0 0 0 0 0
6.88/6.97 c setppc : 0.01 0 0 0 0 0 0 0 0
6.88/6.97 c and : 0.10 0 0 0 0 0 0 0 0
6.88/6.97 c linear : 0.02 0 0 0 0 0 0 0 0
6.88/6.97 c logicor : 0.01 0 0 0 0 0 0 0 0
6.88/6.97 c root node : - 0 - - 0 - - - -
6.88/6.97 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
6.88/6.97 c integral : 0 0 0 11 0 0 0 0 0 20
6.88/6.97 c knapsack : 1 5 25 1 0 0 0 0 0 0
6.88/6.97 c setppc : 400 5 25 1 0 0 0 0 0 0
6.88/6.97 c and : 2482 15 25 1 0 0 146 38 0 0
6.88/6.97 c linear : 1 5 25 1 0 0 0 0 0 0
6.88/6.97 c logicor : 200 5 7 1 0 0 5 0 0 0
6.88/6.97 c countsols : 0 0 0 1 0 0 0 0 0 0
6.88/6.97 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
6.88/6.97 c integral : 3.23 0.00 0.00 3.23 0.00
6.88/6.97 c knapsack : 0.00 0.00 0.00 0.00 0.00
6.88/6.97 c setppc : 0.00 0.00 0.00 0.00 0.00
6.88/6.97 c and : 0.04 0.04 0.00 0.00 0.00
6.88/6.97 c linear : 0.00 0.00 0.00 0.00 0.00
6.88/6.97 c logicor : 0.01 0.01 0.00 0.00 0.00
6.88/6.97 c countsols : 0.00 0.00 0.00 0.00 0.00
6.88/6.97 c Propagators : Time Calls Cutoffs DomReds
6.88/6.97 c rootredcost : 0.00 0 0 0
6.88/6.97 c pseudoobj : 0.01 26 0 0
6.88/6.97 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.88/6.97 c propagation : 0.00 0 0 0 0.0 0 0.0 -
6.88/6.97 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
6.88/6.97 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.88/6.97 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.88/6.97 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.88/6.97 c applied globally : - - - 0 0.0 - - -
6.88/6.97 c applied locally : - - - 0 0.0 - - -
6.88/6.97 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.88/6.97 c cut pool : 0.00 4 - - 16 - (maximal pool size: 47)
6.88/6.97 c redcost : 0.01 15 0 0 0 0
6.88/6.97 c impliedbounds : 0.00 5 0 0 0 0
6.88/6.97 c intobj : 0.00 0 0 0 0 0
6.88/6.97 c gomory : 1.58 5 0 0 1450 0
6.88/6.97 c strongcg : 1.35 5 0 0 2375 0
6.88/6.97 c cmir : 0.00 0 0 0 0 0
6.88/6.97 c flowcover : 0.00 0 0 0 0 0
6.88/6.97 c clique : 0.05 5 0 0 0 0
6.88/6.97 c zerohalf : 0.00 0 0 0 0 0
6.88/6.97 c mcf : 0.01 1 0 0 0 0
6.88/6.97 c Pricers : Time Calls Vars
6.88/6.97 c problem variables: 0.00 0 0
6.88/6.97 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.88/6.97 c relpscost : 3.23 10 0 0 0 0 20
6.88/6.97 c pscost : 0.00 0 0 0 0 0 0
6.88/6.97 c inference : 0.00 0 0 0 0 0 0
6.88/6.97 c mostinf : 0.00 0 0 0 0 0 0
6.88/6.97 c leastinf : 0.00 0 0 0 0 0 0
6.88/6.97 c fullstrong : 0.00 0 0 0 0 0 0
6.88/6.97 c allfullstrong : 0.00 0 0 0 0 0 0
6.88/6.97 c random : 0.00 0 0 0 0 0 0
6.88/6.97 c Primal Heuristics : Time Calls Found
6.88/6.97 c LP solutions : 0.00 - 1
6.88/6.97 c pseudo solutions : 0.00 - 0
6.88/6.97 c simplerounding : 0.00 0 0
6.88/6.97 c rounding : 0.00 0 0
6.88/6.97 c shifting : 0.00 0 0
6.88/6.97 c intshifting : 0.00 0 0
6.88/6.97 c oneopt : 0.00 0 0
6.88/6.97 c fixandinfer : 0.00 0 0
6.88/6.97 c feaspump : 0.00 0 0
6.88/6.97 c coefdiving : 0.00 0 0
6.88/6.97 c pscostdiving : 0.00 0 0
6.88/6.97 c fracdiving : 0.00 0 0
6.88/6.97 c veclendiving : 0.00 0 0
6.88/6.97 c intdiving : 0.00 0 0
6.88/6.97 c actconsdiving : 0.00 0 0
6.88/6.97 c objpscostdiving : 0.00 0 0
6.88/6.97 c rootsoldiving : 0.00 0 0
6.88/6.97 c linesearchdiving : 0.00 0 0
6.88/6.97 c guideddiving : 0.00 0 0
6.88/6.97 c octane : 0.00 0 0
6.88/6.97 c rens : 0.00 0 0
6.88/6.97 c rins : 0.00 0 0
6.88/6.97 c localbranching : 0.00 0 0
6.88/6.97 c mutation : 0.00 0 0
6.88/6.97 c crossover : 0.00 0 0
6.88/6.97 c dins : 0.00 0 0
6.88/6.97 c LP : Time Calls Iterations Iter/call Iter/sec
6.88/6.97 c primal LP : 0.00 0 0 0.00 -
6.88/6.97 c dual LP : 0.16 26 409 15.73 2556.25
6.88/6.97 c barrier LP : 0.00 0 0 0.00 -
6.88/6.97 c diving/probing LP: 0.00 0 0 0.00 -
6.88/6.97 c strong branching : 3.23 131 5854 44.69 1812.38
6.88/6.97 c (at root node) : - 33 4301 130.33 -
6.88/6.97 c conflict analysis: 0.00 0 0 0.00 -
6.88/6.97 c B&B Tree :
6.88/6.97 c number of runs : 1
6.88/6.97 c nodes : 11
6.88/6.97 c nodes (total) : 11
6.88/6.97 c nodes left : 0
6.88/6.97 c max depth : 10
6.88/6.97 c max depth (total): 10
6.88/6.97 c backtracks : 0 (0.0%)
6.88/6.97 c delayed cutoffs : 0
6.88/6.97 c repropagations : 0 (0 domain reductions, 0 cutoffs)
6.88/6.97 c avg switch length: 2.00
6.88/6.97 c switching time : 0.00
6.88/6.97 c Solution :
6.88/6.97 c Solutions found : 1 (1 improvements)
6.88/6.97 c Primal Bound : +3.00000000000000e+01 (in run 1, after 11 nodes, 6.67 seconds, depth 10, found by <relaxation>)
6.88/6.97 c Dual Bound : +3.00000000000000e+01
6.88/6.97 c Gap : 0.00 %
6.88/6.97 c Root Dual Bound : +3.00000000000000e+01
6.98/7.01 c Time complete: 7.