0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver SoPlex 1.4.1
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1867996-1245114179.opb>
0.00/0.02 c original problem has 370 variables (370 bin, 0 int, 0 impl, 0 cont) and 557 constraints
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c start presolving problem
0.00/0.02 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 557 upgd conss, 402 impls, 0 clqs
0.00/0.06 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 557 upgd conss, 12226 impls, 0 clqs
0.00/0.06 c presolving (3 rounds):
0.00/0.06 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.06 c 12226 implications, 0 cliques
0.00/0.06 c presolved problem has 362 variables (362 bin, 0 int, 0 impl, 0 cont) and 557 constraints
0.00/0.06 c 244 constraints of type <knapsack>
0.00/0.06 c 313 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.03
0.00/0.06 c SATUNSAT-LIN
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/flowcover/freq = c -1
0.00/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/cmir/freq = c -1
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/veclendiving/freq = c -1
0.00/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/simplerounding/freq = c -1
0.00/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/shifting/freq = c -1
0.00/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/rounding/freq = c -1
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/rootsoldiving/freq = c -1
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/rens/nodesofs = c 2000
0.00/0.06 c # minimum percentage of integer variables that have to be fixable
0.00/0.06 c # [type: real, range: [0,1], default: 0.5]
0.00/0.06 c heuristics/rens/minfixingrate = c 0.3
0.00/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/rens/freq = c -1
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/pscostdiving/freq = c -1
0.00/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/oneopt/freq = c -1
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.06 c # [type: real, range: [0,1], default: 0.01]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/objpscostdiving/freq = c -1
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/linesearchdiving/freq = c -1
0.00/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/intshifting/freq = c -1
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/guideddiving/freq = c -1
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/fracdiving/freq = c -1
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/feaspump/freq = c -1
0.00/0.06 c # minimum percentage of integer variables that have to be fixed
0.00/0.06 c # [type: real, range: [0,1], default: 0.666]
0.00/0.06 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.06 c # [type: real, range: [0,1], default: 0.1]
0.00/0.06 c heuristics/crossover/nodesquot = c 0.15
0.00/0.06 c # number of nodes without incumbent change that heuristic should wait
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.06 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/crossover/nodesofs = c 750
0.00/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.06 c heuristics/crossover/freq = c -1
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/coefdiving/freq = c -1
0.00/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c presolving/probing/maxrounds = c 0
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.06 c constraints/knapsack/disaggregation = c FALSE
0.00/0.06 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/maxroundsroot = c 5
0.00/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.06 c separating/maxrounds = c 1
0.00/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c limits/solutions = c 1
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = c 1620
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = c 1791
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = c 10000
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving problem
0.00/0.06 c
0.00/0.08 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.08 c 0.1s| 1 | 0 | 260 |2176k| 0 | 141 | 362 | 557 | 557 | 362 | 549 | 0 | 0 | 0 | 4.636364e+01 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 517 |3381k| 0 | 148 | 362 | 557 | 557 | 362 | 859 | 310 | 0 | 0 | 4.822222e+01 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 1162 |5640k| 0 | 337 | 362 | 557 | 557 | 362 |1298 | 749 | 0 | 0 | 5.123303e+01 | -- | Inf
1.09/1.18 c 1.1s| 1 | 0 | 1319 |8077k| 0 | 347 | 362 | 557 | 557 | 362 |1347 | 798 | 0 | 0 | 5.152774e+01 | -- | Inf
1.50/1.59 c 1.5s| 1 | 0 | 1473 |8286k| 0 | 353 | 362 | 557 | 557 | 362 |1350 | 801 | 0 | 0 | 5.161834e+01 | -- | Inf
1.99/2.00 c 1.9s| 1 | 0 | 1614 |8652k| 0 | 353 | 362 | 557 | 557 | 362 |1351 | 802 | 0 | 0 | 5.168460e+01 | -- | Inf
7.29/7.38 c 7.3s| 1 | 2 | 1614 |8652k| 0 | 353 | 362 | 557 | 557 | 362 |1351 | 802 | 0 | 21 | 5.168460e+01 | -- | Inf
108.35/108.48 c 107s| 10000 | 3610 |262177 | 15M| 63 | 20 | 362 | 665 | 96 | 362 | 868 | 802 | 518 |2395 | 5.670579e+01 | -- | Inf
177.33/177.41 c 175s| 20000 | 7101 |520417 | 21M| 75 | 45 | 362 | 668 | 130 | 362 | 868 | 802 | 951 |2862 | 5.786872e+01 | -- | Inf
229.22/229.33 c 227s| 30000 | 9607 |721586 | 26M| 83 | 60 | 362 | 692 | 200 | 362 | 868 | 802 |1627 |3105 | 5.846502e+01 | -- | Inf
288.70/288.89 c 285s| 40000 | 12374 |940794 | 31M| 83 | 28 | 362 | 721 | 88 | 362 | 868 | 802 |2158 |3769 | 5.893109e+01 | -- | Inf
345.99/346.17 c 342s| 50000 | 14864 | 1154k| 36M| 90 | - | 362 | 777 | 149 | 0 | 0 | 802 |2753 |4267 | 5.930349e+01 | -- | Inf
394.27/394.40 c * 390s| 59262 | 16895 | 1339k| 40M| 90 | - | 362 | 805 | 60 | 362 | 868 | 802 |3389 |4603 | 5.956495e+01 | 9.200000e+01 | 54.45%
394.27/394.40 c
394.27/394.40 c SCIP Status : solving was interrupted [solution limit reached]
394.27/394.40 c Solving Time (sec) : 389.55
394.27/394.40 c Solving Nodes : 59262
394.27/394.40 c Primal Bound : +9.20000000000000e+01 (1 solutions)
394.27/394.40 c Dual Bound : +5.95649489634332e+01
394.27/394.40 c Gap : 54.45 %
394.27/394.40 c NODE 59262
394.27/394.40 c DUAL BOUND 59.5649
394.27/394.40 c PRIMAL BOUND 92
394.27/394.40 c GAP 0.544533
394.27/394.40 s SATISFIABLE
394.27/394.40 v -x369 x370 -x367 x368 -x365 x366 -x363 x364 -x361 x362 -x359 x360 -x357 x358 -x355 x356 -x353 x354 -x351 x352 -x349 -x350 -x347
394.27/394.40 v -x348 -x345 x346 -x343 x344 -x341 x342 x339 -x340 x337 -x338 -x335 x336 x333 -x334 x331 -x332 -x329 x330 -x327 x328 -x325 x326
394.27/394.40 v x323 -x324 x321 -x322 x319 -x320 -x317 x318 -x315 x316 -x313 -x314 -x311 -x312 -x309 -x310 -x307 -x308 x305 -x306 x303 -x304
394.27/394.40 v x301 -x302 x299 -x300 x297 -x298 x295 -x296 x293 -x294 x291 -x292 x289 -x290 -x287 x288 -x285 x286 -x283 x284 -x281 x282 -x279
394.27/394.40 v x280 -x277 x278 x275 -x276 x273 -x274 -x271 x272 x269 -x270 x267 -x268 x265 -x266 x263 -x264 x261 -x262 -x259 x260 x257
394.27/394.40 v -x258 x255 -x256 x253 -x254 x251 -x252 -x249 x250 -x247 x248 -x245 x246 -x243 x244 -x242 -x240 -x238 -x236 -x234 x232 x230 -x228
394.27/394.40 v x226 x224 -x222 -x220 -x218 -x216 -x214 -x212 x210 -x208 -x206 x204 -x202 -x200 -x198 -x196 -x194 -x192 -x190 -x188 -x186
394.27/394.40 v -x184 -x182 -x180 -x178 -x176 -x174 -x172 -x170 -x168 x166 x164 -x162 -x160 -x158 x156 -x154 -x152 -x150 -x148 -x146 x144 -x142
394.27/394.40 v -x140 -x138 x136 x134 -x132 -x130 -x128 -x126 -x124 -x122 -x120 -x118 x116 x114 x112 -x110 -x108 -x106 -x104 -x102 -x100
394.27/394.40 v -x98 -x96 x94 x92 -x90 -x88 -x86 -x84 -x82 -x80 -x78 -x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 -x48
394.27/394.40 v -x46 -x44 -x42 -x40 -x38 -x36 -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x241 -x239
394.27/394.40 v -x237 -x235 -x233 -x231 -x229 -x227 -x225 -x223 -x221 -x219 -x217 -x215 -x213 -x211 -x209 -x207 -x205 -x203 -x201 -x199 x197
394.27/394.40 v x195 x193 -x191 -x189 -x187 -x185 -x183 -x181 -x179 -x177 -x175 -x173 -x171 -x169 -x167 -x165 -x163 -x161 -x159 -x157 -x155
394.27/394.40 v -x153 -x151 -x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131 -x129 -x127 -x125 -x123 -x121 -x119 -x117 -x115 -x113
394.27/394.40 v -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 x87 -x85 -x83 x81 x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65 -x63
394.27/394.40 v x61 x59 x57 -x55 -x53 -x51 -x49 -x47 -x45 -x43 x41 x39 x37 -x35 -x33 -x31 x29 -x27 -x25 -x23 x21 x19 x17 -x15 -x13 -x11 -x9
394.27/394.40 v x7 -x5 -x3 -x1
394.27/394.40 c SCIP Status : solving was interrupted [solution limit reached]
394.27/394.40 c Solving Time : 389.55
394.27/394.40 c Original Problem :
394.27/394.40 c Problem name : HOME/instance-1867996-1245114179.opb
394.27/394.40 c Variables : 370 (370 binary, 0 integer, 0 implicit integer, 0 continuous)
394.27/394.40 c Constraints : 557 initial, 557 maximal
394.27/394.40 c Presolved Problem :
394.27/394.40 c Problem name : t_HOME/instance-1867996-1245114179.opb
394.27/394.40 c Variables : 362 (362 binary, 0 integer, 0 implicit integer, 0 continuous)
394.27/394.40 c Constraints : 557 initial, 832 maximal
394.27/394.40 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
394.27/394.40 c trivial : 0.00 0 0 0 0 0 0 0 0
394.27/394.40 c dualfix : 0.00 0 0 0 0 0 0 0 0
394.27/394.40 c boundshift : 0.00 0 0 0 0 0 0 0 0
394.27/394.40 c inttobinary : 0.00 0 0 0 0 0 0 0 0
394.27/394.40 c implics : 0.00 0 8 0 0 0 0 0 0
394.27/394.40 c probing : 0.00 0 0 0 0 0 0 0 0
394.27/394.40 c knapsack : 0.01 0 0 0 0 0 0 0 0
394.27/394.40 c logicor : 0.00 0 0 0 0 0 0 0 0
394.27/394.40 c root node : - 0 - - 0 - - - -
394.27/394.40 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
394.27/394.40 c integral : 0 0 0 38317 0 17 266 0 0 76394
394.27/394.40 c knapsack : 244 5 157807 0 0 17340 646120 319 0 0
394.27/394.40 c logicor : 313+ 5 102675 1 0 193 240507 0 0 0
394.27/394.40 c countsols : 0 0 0 1 0 0 0 0 0 0
394.27/394.40 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
394.27/394.40 c integral : 60.99 0.00 0.00 60.99 0.00
394.27/394.40 c knapsack : 3.86 0.01 3.85 0.00 0.00
394.27/394.40 c logicor : 2.03 0.00 2.03 0.00 0.00
394.27/394.40 c countsols : 0.00 0.00 0.00 0.00 0.00
394.27/394.40 c Propagators : Time Calls Cutoffs DomReds
394.27/394.40 c rootredcost : 0.05 0 0 0
394.27/394.40 c pseudoobj : 2.83 158598 0 0
394.27/394.40 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
394.27/394.40 c propagation : 0.79 2593 2419 19152 79.0 15 97.1 -
394.27/394.40 c infeasible LP : 0.90 3537 0 0 0.0 0 0.0 0
394.27/394.40 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
394.27/394.40 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
394.27/394.40 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
394.27/394.40 c applied globally : - - - 3285 22.7 - - -
394.27/394.40 c applied locally : - - - 104 43.5 - - -
394.27/394.40 c Separators : Time Calls Cutoffs DomReds Cuts Conss
394.27/394.40 c cut pool : 0.01 4 - - 368 - (maximal pool size: 2829)
394.27/394.40 c redcost : 0.65 38238 0 0 0 0
394.27/394.40 c impliedbounds : 0.00 5 0 0 1024 0
394.27/394.40 c intobj : 0.00 0 0 0 0 0
394.27/394.40 c gomory : 0.61 5 0 0 730 0
394.27/394.40 c strongcg : 0.54 5 0 0 1436 0
394.27/394.40 c cmir : 0.00 0 0 0 0 0
394.27/394.40 c flowcover : 0.00 0 0 0 0 0
394.27/394.40 c clique : 0.01 1 0 0 0 0
394.27/394.40 c zerohalf : 0.00 0 0 0 0 0
394.27/394.40 c mcf : 0.00 1 0 0 0 0
394.27/394.40 c Pricers : Time Calls Vars
394.27/394.40 c problem variables: 0.00 0 0
394.27/394.40 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
394.27/394.40 c relpscost : 60.89 38316 17 266 0 0 76394
394.27/394.40 c pscost : 0.00 0 0 0 0 0 0
394.27/394.40 c inference : 0.00 0 0 0 0 0 0
394.27/394.40 c mostinf : 0.00 0 0 0 0 0 0
394.27/394.40 c leastinf : 0.00 0 0 0 0 0 0
394.27/394.40 c fullstrong : 0.00 0 0 0 0 0 0
394.27/394.40 c allfullstrong : 0.00 0 0 0 0 0 0
394.27/394.40 c random : 0.00 0 0 0 0 0 0
394.27/394.40 c Primal Heuristics : Time Calls Found
394.27/394.40 c LP solutions : 0.00 - 1
394.27/394.40 c pseudo solutions : 0.00 - 0
394.27/394.40 c simplerounding : 0.00 0 0
394.27/394.40 c rounding : 0.00 0 0
394.27/394.40 c shifting : 0.00 0 0
394.27/394.40 c intshifting : 0.00 0 0
394.27/394.40 c oneopt : 0.00 0 0
394.27/394.40 c fixandinfer : 0.00 0 0
394.27/394.40 c feaspump : 0.00 0 0
394.27/394.40 c coefdiving : 0.00 0 0
394.27/394.40 c pscostdiving : 0.00 0 0
394.27/394.40 c fracdiving : 0.00 0 0
394.27/394.40 c veclendiving : 0.00 0 0
394.27/394.40 c intdiving : 0.00 0 0
394.27/394.40 c actconsdiving : 0.00 0 0
394.27/394.40 c objpscostdiving : 0.00 0 0
394.27/394.40 c rootsoldiving : 0.00 0 0
394.27/394.40 c linesearchdiving : 0.00 0 0
394.27/394.40 c guideddiving : 0.00 0 0
394.27/394.40 c octane : 0.00 0 0
394.27/394.40 c rens : 0.00 0 0
394.27/394.40 c rins : 0.00 0 0
394.27/394.40 c localbranching : 0.00 0 0
394.27/394.40 c mutation : 0.00 0 0
394.27/394.40 c crossover : 0.00 0 0
394.27/394.40 c dins : 0.00 0 0
394.27/394.40 c LP : Time Calls Iterations Iter/call Iter/sec
394.27/394.40 c primal LP : 0.00 0 0 0.00 -
394.27/394.40 c dual LP : 295.68 41897 1339313 31.97 4529.60
394.27/394.40 c barrier LP : 0.00 0 0 0.00 -
394.27/394.40 c diving/probing LP: 0.00 0 0 0.00 -
394.27/394.40 c strong branching : 59.12 4603 225010 48.88 3805.99
394.27/394.40 c (at root node) : - 21 10088 480.38 -
394.27/394.40 c conflict analysis: 0.00 0 0 0.00 -
394.27/394.40 c B&B Tree :
394.27/394.40 c number of runs : 1
394.27/394.40 c nodes : 59262
394.27/394.40 c nodes (total) : 59262
394.27/394.40 c nodes left : 16895
394.27/394.40 c max depth : 90
394.27/394.40 c max depth (total): 90
394.27/394.40 c backtracks : 6468 (10.9%)
394.27/394.40 c delayed cutoffs : 88
394.27/394.40 c repropagations : 12091 (12312 domain reductions, 72 cutoffs)
394.27/394.40 c avg switch length: 6.13
394.27/394.40 c switching time : 7.17
394.27/394.40 c Solution :
394.27/394.40 c Solutions found : 1 (1 improvements)
394.27/394.40 c Primal Bound : +9.20000000000000e+01 (in run 1, after 59262 nodes, 389.55 seconds, depth 44, found by <relaxation>)
394.27/394.40 c Dual Bound : +5.95649489634332e+01
394.27/394.40 c Gap : 54.45 %
394.27/394.40 c Root Dual Bound : +5.16846016615471e+01
394.37/394.50 c Time complete: 394.37.