0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver Clp 1.8.2
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1867993-1245114071.opb>
0.00/0.01 c original problem has 316 variables (316 bin, 0 int, 0 impl, 0 cont) and 476 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.02/0.04 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 476 upgd conss, 348 impls, 0 clqs
0.02/0.05 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 476 upgd conss, 9460 impls, 0 clqs
0.02/0.05 c presolving (3 rounds):
0.02/0.05 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.05 c 9460 implications, 0 cliques
0.02/0.05 c presolved problem has 308 variables (308 bin, 0 int, 0 impl, 0 cont) and 476 constraints
0.02/0.05 c 202 constraints of type <knapsack>
0.02/0.05 c 274 constraints of type <logicor>
0.02/0.05 c transformed objective value is always integral (scale: 1)
0.02/0.05 c Presolving Time: 0.03
0.02/0.05 c SATUNSAT-LIN
0.02/0.05 c -----------------------------------------------------------------------------------------------
0.02/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.05 c separating/flowcover/freq = c -1
0.02/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.05 c separating/cmir/freq = c -1
0.02/0.05 c # additional number of allowed LP iterations
0.02/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.05 c heuristics/veclendiving/maxlpiterofs = c 1500
0.02/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.05 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.02/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.05 c heuristics/veclendiving/freq = c -1
0.02/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.05 c heuristics/simplerounding/freq = c -1
0.02/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.05 c heuristics/shifting/freq = c -1
0.02/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.05 c heuristics/rounding/freq = c -1
0.02/0.05 c # additional number of allowed LP iterations
0.02/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.05 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.02/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.05 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.02/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.05 c heuristics/rootsoldiving/freq = c -1
0.02/0.05 c # number of nodes added to the contingent of the total nodes
0.02/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.05 c heuristics/rens/nodesofs = c 2000
0.02/0.05 c # minimum percentage of integer variables that have to be fixable
0.02/0.05 c # [type: real, range: [0,1], default: 0.5]
0.02/0.05 c heuristics/rens/minfixingrate = c 0.3
0.02/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.05 c heuristics/rens/freq = c -1
0.02/0.05 c # additional number of allowed LP iterations
0.02/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.05 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.02/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.05 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.02/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.05 c heuristics/pscostdiving/freq = c -1
0.02/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.05 c heuristics/oneopt/freq = c -1
0.02/0.05 c # additional number of allowed LP iterations
0.02/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.05 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.02/0.05 c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.05 c # [type: real, range: [0,1], default: 0.01]
0.02/0.05 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.02/0.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.05 c heuristics/objpscostdiving/freq = c -1
0.02/0.05 c # additional number of allowed LP iterations
0.02/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.05 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.02/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.05 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.02/0.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.05 c heuristics/linesearchdiving/freq = c -1
0.02/0.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.05 c heuristics/intshifting/freq = c -1
0.02/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.05 c heuristics/intdiving/maxlpiterquot = c 0.075
0.02/0.05 c # additional number of allowed LP iterations
0.02/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.05 c heuristics/guideddiving/maxlpiterofs = c 1500
0.02/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.05 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.02/0.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.05 c heuristics/guideddiving/freq = c -1
0.02/0.05 c # additional number of allowed LP iterations
0.02/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.05 c heuristics/fracdiving/maxlpiterofs = c 1500
0.02/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.05 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.02/0.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.05 c heuristics/fracdiving/freq = c -1
0.02/0.05 c # additional number of allowed LP iterations
0.02/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.05 c heuristics/feaspump/maxlpiterofs = c 2000
0.02/0.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.05 c heuristics/feaspump/freq = c -1
0.02/0.05 c # minimum percentage of integer variables that have to be fixed
0.02/0.05 c # [type: real, range: [0,1], default: 0.666]
0.02/0.05 c heuristics/crossover/minfixingrate = c 0.5
0.02/0.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.05 c # [type: real, range: [0,1], default: 0.1]
0.02/0.05 c heuristics/crossover/nodesquot = c 0.15
0.02/0.05 c # number of nodes without incumbent change that heuristic should wait
0.02/0.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.05 c heuristics/crossover/nwaitingnodes = c 100
0.02/0.05 c # number of nodes added to the contingent of the total nodes
0.02/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.05 c heuristics/crossover/nodesofs = c 750
0.02/0.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.05 c heuristics/crossover/freq = c -1
0.02/0.05 c # additional number of allowed LP iterations
0.02/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.05 c heuristics/coefdiving/maxlpiterofs = c 1500
0.02/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.05 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.02/0.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.05 c heuristics/coefdiving/freq = c -1
0.02/0.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.05 c presolving/probing/maxrounds = c 0
0.02/0.05 c # should presolving try to simplify knapsacks
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/knapsack/simplifyinequalities = c TRUE
0.02/0.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.05 c constraints/knapsack/disaggregation = c FALSE
0.02/0.05 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.05 c constraints/knapsack/maxnumcardlift = c 0
0.02/0.05 c # should presolving try to simplify inequalities
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/linear/simplifyinequalities = c TRUE
0.02/0.05 c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.05 c separating/maxroundsroot = c 5
0.02/0.05 c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.05 c separating/maxrounds = c 1
0.02/0.05 c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.05 c limits/solutions = c 1
0.02/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.05 c limits/memory = c 1620
0.02/0.05 c # maximal time in seconds to run
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.05 c limits/time = c 1791
0.02/0.05 c # frequency for displaying node information lines
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.05 c display/freq = c 10000
0.02/0.05 c -----------------------------------------------------------------------------------------------
0.02/0.05 c start solving problem
0.02/0.05 c
0.02/0.07 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.07 c 0.1s| 1 | 0 | 223 |1853k| 0 | 121 | 308 | 476 | 476 | 308 | 468 | 0 | 0 | 0 | 3.920000e+01 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 416 |2904k| 0 | 186 | 308 | 476 | 476 | 308 | 734 | 266 | 0 | 0 | 4.104241e+01 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 705 |5509k| 0 | 296 | 308 | 476 | 476 | 308 |1101 | 633 | 0 | 0 | 4.369595e+01 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 817 |7541k| 0 | 297 | 308 | 476 | 476 | 308 |1105 | 637 | 0 | 0 | 4.384641e+01 | -- | Inf
1.09/1.15 c 1.1s| 1 | 0 | 942 |8890k| 0 | 299 | 308 | 476 | 476 | 308 |1106 | 638 | 0 | 0 | 4.389252e+01 | -- | Inf
1.39/1.43 c 1.4s| 1 | 0 | 993 |9027k| 0 | 299 | 308 | 476 | 476 | 308 |1107 | 639 | 0 | 0 | 4.391361e+01 | -- | Inf
3.89/3.91 c 3.9s| 1 | 2 | 993 |9028k| 0 | 299 | 308 | 476 | 476 | 308 |1107 | 639 | 0 | 39 | 4.391361e+01 | -- | Inf
67.46/67.51 c 67.0s| 10000 | 4067 |269371 | 16M| 72 | - | 308 | 700 | 189 | 0 | 0 | 639 | 592 |2540 | 4.898501e+01 | -- | Inf
105.25/105.35 c 104s| 20000 | 7625 |481816 | 23M| 72 | 22 | 308 | 731 | 138 | 308 | 738 | 639 |1220 |2738 | 4.992837e+01 | -- | Inf
145.14/145.24 c 144s| 30000 | 11002 |695005 | 29M| 74 | 78 | 308 | 758 | 313 | 308 | 738 | 639 |1973 |3371 | 5.058954e+01 | -- | Inf
183.13/183.25 c 182s| 40000 | 14068 |900121 | 34M| 74 | 52 | 308 | 725 | 149 | 308 | 738 | 639 |2697 |3788 | 5.114144e+01 | -- | Inf
219.52/219.65 c 218s| 50000 | 16991 | 1093k| 40M| 74 | 78 | 308 | 792 | 229 | 308 | 738 | 639 |3445 |4199 | 5.153162e+01 | -- | Inf
231.32/231.40 c * 229s| 53195 | 17117 | 1155k| 41M| 75 | - | 308 | 811 | 24 | 308 | 738 | 639 |3700 |4405 | 5.165444e+01 | 7.800000e+01 | 51.00%
231.32/231.40 c
231.32/231.40 c SCIP Status : solving was interrupted [solution limit reached]
231.32/231.40 c Solving Time (sec) : 229.39
231.32/231.40 c Solving Nodes : 53195
231.32/231.40 c Primal Bound : +7.80000000000000e+01 (1 solutions)
231.32/231.40 c Dual Bound : +5.16544449735318e+01
231.32/231.40 c Gap : 51.00 %
231.32/231.40 c NODE 53195
231.32/231.40 c DUAL BOUND 51.6544
231.32/231.40 c PRIMAL BOUND 78
231.32/231.40 c GAP 0.510035
231.32/231.40 s SATISFIABLE
231.32/231.40 v x315 -x316 -x313 x314 x311 -x312 -x309 x310 x307 -x308 x305 -x306 x303 -x304 -x301 -x302 -x299 -x300 x297 -x298 x295 -x296 x293
231.32/231.40 v -x294 x291 -x292 -x289 -x290 x287 -x288 x285 -x286 x283 -x284 -x281 x282 x279 -x280 -x277 x278 -x275 x276 -x273 x274 -x271 x272
231.32/231.40 v -x269 x270 -x267 -x268 -x265 x266 -x263 -x264 -x261 -x262 -x259 -x260 -x257 -x258 -x255 x256 -x253 x254 -x251 x252 -x249
231.32/231.40 v x250 x247 -x248 -x245 x246 x243 -x244 x241 -x242 x239 -x240 x237 -x238 x235 -x236 x233 -x234 x231 -x232 -x229 x230 -x227 x228
231.32/231.40 v -x225 x226 -x223 x224 -x221 x222 x219 -x220 x217 -x218 -x215 x216 -x213 x214 -x211 x212 x209 -x210 x207 -x208 -x205 x206 x203
231.32/231.40 v -x204 -x201 x202 x200 x198 -x196 x194 -x192 -x190 -x188 -x186 -x184 -x182 x180 x178 x176 -x174 x172 -x170 -x168 -x166 -x164
231.32/231.40 v -x162 -x160 -x158 -x156 -x154 -x152 -x150 -x148 -x146 -x144 -x142 -x140 -x138 -x136 -x134 -x132 -x130 -x128 -x126 -x124 -x122
231.32/231.40 v -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 x100 -x98 x96 -x94 x92 -x90 -x88 -x86 -x84 -x82 x80 x78 -x76 x74
231.32/231.40 v -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 -x48 -x46 -x44 -x42 -x40 x38 -x36 -x34 -x32 -x30 -x28 -x26 -x24
231.32/231.40 v -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x199 -x197 -x195 -x193 -x191 -x189 -x187 -x185 -x183 -x181 -x179 -x177 -x175
231.32/231.40 v -x173 -x171 -x169 -x167 -x165 -x163 -x161 -x159 -x157 -x155 -x153 -x151 -x149 x147 -x145 x143 x141 -x139 -x137 -x135 -x133
231.32/231.40 v -x131 x129 -x127 x125 x123 x121 -x119 -x117 -x115 -x113 -x111 -x109 x107 -x105 x103 x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87
231.32/231.40 v -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65 -x63 -x61 -x59 -x57 -x55 -x53 -x51 x49 -x47 -x45 -x43 x41 -x39 -x37
231.32/231.40 v -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19 -x17 -x15 -x13 -x11 x9 -x7 x5 -x3 -x1
231.32/231.40 c SCIP Status : solving was interrupted [solution limit reached]
231.32/231.40 c Solving Time : 229.39
231.32/231.40 c Original Problem :
231.32/231.40 c Problem name : HOME/instance-1867993-1245114071.opb
231.32/231.40 c Variables : 316 (316 binary, 0 integer, 0 implicit integer, 0 continuous)
231.32/231.40 c Constraints : 476 initial, 476 maximal
231.32/231.40 c Presolved Problem :
231.32/231.40 c Problem name : t_HOME/instance-1867993-1245114071.opb
231.32/231.40 c Variables : 308 (308 binary, 0 integer, 0 implicit integer, 0 continuous)
231.32/231.40 c Constraints : 476 initial, 847 maximal
231.32/231.40 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
231.32/231.40 c trivial : 0.00 0 0 0 0 0 0 0 0
231.32/231.40 c dualfix : 0.00 0 0 0 0 0 0 0 0
231.32/231.40 c boundshift : 0.00 0 0 0 0 0 0 0 0
231.32/231.40 c inttobinary : 0.00 0 0 0 0 0 0 0 0
231.32/231.40 c implics : 0.00 0 8 0 0 0 0 0 0
231.32/231.40 c probing : 0.00 0 0 0 0 0 0 0 0
231.32/231.40 c knapsack : 0.01 0 0 0 0 0 0 0 0
231.32/231.40 c logicor : 0.01 0 0 0 0 0 0 0 0
231.32/231.40 c root node : - 0 - - 0 - - - -
231.32/231.40 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
231.32/231.40 c integral : 0 0 0 35697 0 7 188 0 0 71202
231.32/231.40 c knapsack : 202 5 142411 0 0 15930 596305 270 0 0
231.32/231.40 c logicor : 274+ 5 93838 1 0 364 239600 0 0 0
231.32/231.40 c countsols : 0 0 0 1 0 0 0 0 0 0
231.32/231.40 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
231.32/231.40 c integral : 31.64 0.00 0.00 31.64 0.00
231.32/231.40 c knapsack : 3.46 0.01 3.45 0.00 0.00
231.32/231.40 c logicor : 1.96 0.00 1.96 0.00 0.00
231.32/231.40 c countsols : 0.00 0.00 0.00 0.00 0.00
231.32/231.40 c Propagators : Time Calls Cutoffs DomReds
231.32/231.40 c rootredcost : 0.06 0 0 0
231.32/231.40 c pseudoobj : 2.28 142969 0 0
231.32/231.40 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
231.32/231.40 c propagation : 0.79 2700 2540 20618 61.3 12 52.9 -
231.32/231.40 c infeasible LP : 0.03 1369 0 0 0.0 0 0.0 0
231.32/231.40 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
231.32/231.40 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
231.32/231.40 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
231.32/231.40 c applied globally : - - - 3605 20.2 - - -
231.32/231.40 c applied locally : - - - 95 37.8 - - -
231.32/231.40 c Separators : Time Calls Cutoffs DomReds Cuts Conss
231.32/231.40 c cut pool : 0.01 4 - - 322 - (maximal pool size: 2439)
231.32/231.40 c redcost : 0.50 35634 0 0 0 0
231.32/231.40 c impliedbounds : 0.00 5 0 0 841 0
231.32/231.40 c intobj : 0.00 0 0 0 0 0
231.32/231.40 c gomory : 0.47 5 0 0 321 0
231.32/231.40 c strongcg : 0.49 5 0 0 1620 0
231.32/231.40 c cmir : 0.00 0 0 0 0 0
231.32/231.40 c flowcover : 0.00 0 0 0 0 0
231.32/231.40 c clique : 0.00 1 0 0 0 0
231.32/231.40 c zerohalf : 0.00 0 0 0 0 0
231.32/231.40 c mcf : 0.00 1 0 0 0 0
231.32/231.40 c Pricers : Time Calls Vars
231.32/231.40 c problem variables: 0.00 0 0
231.32/231.40 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
231.32/231.40 c relpscost : 31.62 35696 7 188 0 0 71202
231.32/231.40 c pscost : 0.00 0 0 0 0 0 0
231.32/231.40 c inference : 0.00 0 0 0 0 0 0
231.32/231.40 c mostinf : 0.00 0 0 0 0 0 0
231.32/231.40 c leastinf : 0.00 0 0 0 0 0 0
231.32/231.40 c fullstrong : 0.00 0 0 0 0 0 0
231.32/231.40 c allfullstrong : 0.00 0 0 0 0 0 0
231.32/231.40 c random : 0.00 0 0 0 0 0 0
231.32/231.40 c Primal Heuristics : Time Calls Found
231.32/231.40 c LP solutions : 0.00 - 1
231.32/231.40 c pseudo solutions : 0.00 - 0
231.32/231.40 c simplerounding : 0.00 0 0
231.32/231.40 c rounding : 0.00 0 0
231.32/231.40 c shifting : 0.00 0 0
231.32/231.40 c intshifting : 0.00 0 0
231.32/231.40 c oneopt : 0.00 0 0
231.32/231.40 c fixandinfer : 0.00 0 0
231.32/231.40 c feaspump : 0.00 0 0
231.32/231.40 c coefdiving : 0.00 0 0
231.32/231.40 c pscostdiving : 0.00 0 0
231.32/231.40 c fracdiving : 0.00 0 0
231.32/231.40 c veclendiving : 0.00 0 0
231.32/231.40 c intdiving : 0.00 0 0
231.32/231.40 c actconsdiving : 0.00 0 0
231.32/231.40 c objpscostdiving : 0.00 0 0
231.32/231.40 c rootsoldiving : 0.00 0 0
231.32/231.40 c linesearchdiving : 0.00 0 0
231.32/231.40 c guideddiving : 0.00 0 0
231.32/231.40 c octane : 0.00 0 0
231.32/231.40 c rens : 0.00 0 0
231.32/231.40 c rins : 0.00 0 0
231.32/231.40 c localbranching : 0.00 0 0
231.32/231.40 c mutation : 0.00 0 0
231.32/231.40 c crossover : 0.00 0 0
231.32/231.40 c dins : 0.00 0 0
231.32/231.40 c LP : Time Calls Iterations Iter/call Iter/sec
231.32/231.40 c primal LP : 0.03 0 0 0.00 0.00
231.32/231.40 c dual LP : 175.97 37065 1155352 31.17 6565.62
231.32/231.40 c barrier LP : 0.00 0 0 0.00 -
231.32/231.40 c diving/probing LP: 0.00 0 0 0.00 -
231.32/231.40 c strong branching : 30.23 4405 181611 41.23 6007.64
231.32/231.40 c (at root node) : - 39 6483 166.23 -
231.32/231.40 c conflict analysis: 0.00 0 0 0.00 -
231.32/231.40 c B&B Tree :
231.32/231.40 c number of runs : 1
231.32/231.40 c nodes : 53195
231.32/231.40 c nodes (total) : 53195
231.32/231.40 c nodes left : 17117
231.32/231.40 c max depth : 75
231.32/231.40 c max depth (total): 75
231.32/231.40 c backtracks : 5540 (10.4%)
231.32/231.40 c delayed cutoffs : 79
231.32/231.40 c repropagations : 11081 (11697 domain reductions, 77 cutoffs)
231.32/231.40 c avg switch length: 6.14
231.32/231.40 c switching time : 4.31
231.32/231.40 c Solution :
231.32/231.40 c Solutions found : 1 (1 improvements)
231.32/231.40 c Primal Bound : +7.80000000000000e+01 (in run 1, after 53195 nodes, 229.39 seconds, depth 29, found by <relaxation>)
231.32/231.40 c Dual Bound : +5.16544449735318e+01
231.32/231.40 c Gap : 51.00 %
231.32/231.40 c Root Dual Bound : +4.39136067190854e+01
231.41/231.51 c Time complete: 231.42.