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-1867992-1245114071.opb>
0.00/0.02 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.00/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.00/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.00/0.05 c presolving (3 rounds):
0.00/0.05 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 9460 implications, 0 cliques
0.00/0.05 c presolved problem has 308 variables (308 bin, 0 int, 0 impl, 0 cont) and 476 constraints
0.00/0.05 c 202 constraints of type <knapsack>
0.00/0.05 c 274 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.03
0.00/0.05 c SATUNSAT-LIN
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/flowcover/freq = c -1
0.00/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/cmir/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/veclendiving/freq = c -1
0.00/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/simplerounding/freq = c -1
0.00/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/shifting/freq = c -1
0.00/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/rounding/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/rootsoldiving/freq = c -1
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/rens/nodesofs = c 2000
0.00/0.05 c # minimum percentage of integer variables that have to be fixable
0.00/0.05 c # [type: real, range: [0,1], default: 0.5]
0.00/0.05 c heuristics/rens/minfixingrate = c 0.3
0.00/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/rens/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/pscostdiving/freq = c -1
0.00/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/oneopt/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.05 c # [type: real, range: [0,1], default: 0.01]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/objpscostdiving/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/linesearchdiving/freq = c -1
0.00/0.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/intshifting/freq = c -1
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/guideddiving/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/fracdiving/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/feaspump/freq = c -1
0.00/0.05 c # minimum percentage of integer variables that have to be fixed
0.00/0.05 c # [type: real, range: [0,1], default: 0.666]
0.00/0.05 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.05 c # [type: real, range: [0,1], default: 0.1]
0.00/0.05 c heuristics/crossover/nodesquot = c 0.15
0.00/0.05 c # number of nodes without incumbent change that heuristic should wait
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.05 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/crossover/nodesofs = c 750
0.00/0.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.05 c heuristics/crossover/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/coefdiving/freq = c -1
0.00/0.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c presolving/probing/maxrounds = c 0
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.05 c constraints/knapsack/disaggregation = c FALSE
0.00/0.05 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.05 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/maxroundsroot = c 5
0.00/0.05 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.05 c separating/maxrounds = c 1
0.00/0.05 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c limits/solutions = c 1
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = c 1620
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = c 1791
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = c 10000
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving problem
0.00/0.05 c
0.00/0.07 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.07 c 0.1s| 1 | 0 | 208 |1853k| 0 | 114 | 308 | 476 | 476 | 308 | 468 | 0 | 0 | 0 | 3.920000e+01 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 350 |2764k| 0 | 165 | 308 | 476 | 476 | 308 | 718 | 250 | 0 | 0 | 4.057971e+01 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 676 |4281k| 0 | 296 | 308 | 476 | 476 | 308 |1097 | 629 | 0 | 0 | 4.366741e+01 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 798 |4758k| 0 | 297 | 308 | 476 | 476 | 308 |1102 | 634 | 0 | 0 | 4.384398e+01 | -- | Inf
0.99/1.04 c 1.0s| 1 | 0 | 894 |4762k| 0 | 294 | 308 | 476 | 476 | 308 |1103 | 635 | 0 | 0 | 4.388953e+01 | -- | Inf
1.19/1.27 c 1.2s| 1 | 0 | 947 |5079k| 0 | 294 | 308 | 476 | 476 | 308 |1106 | 638 | 0 | 0 | 4.391413e+01 | -- | Inf
6.09/6.16 c 6.1s| 1 | 2 | 947 |5080k| 0 | 294 | 308 | 476 | 476 | 308 |1106 | 638 | 0 | 26 | 4.391413e+01 | -- | Inf
109.86/109.99 c 109s| 10000 | 6329 |393691 | 15M| 60 | 160 | 308 | 573 | 364 | 308 | 712 | 638 | 379 |2556 | 4.937811e+01 | -- | Inf
170.35/170.48 c 168s| 20000 | 11450 |669703 | 24M| 60 | 70 | 308 | 591 | 258 | 308 | 712 | 638 | 844 |3431 | 5.014719e+01 | -- | Inf
188.64/188.70 c * 186s| 22968 | 12274 |755016 | 25M| 60 | - | 308 | 614 | 22 | 308 | 712 | 638 | 944 |3652 | 5.038140e+01 | 7.600000e+01 | 50.85%
188.64/188.70 c
188.64/188.70 c SCIP Status : solving was interrupted [solution limit reached]
188.64/188.70 c Solving Time (sec) : 186.04
188.64/188.70 c Solving Nodes : 22968
188.64/188.70 c Primal Bound : +7.60000000000000e+01 (1 solutions)
188.64/188.70 c Dual Bound : +5.03813997750181e+01
188.64/188.70 c Gap : 50.85 %
188.64/188.70 c NODE 22968
188.64/188.70 c DUAL BOUND 50.3814
188.64/188.70 c PRIMAL BOUND 76
188.64/188.70 c GAP 0.508493
188.64/188.70 s SATISFIABLE
188.64/188.70 v x315 -x316 x313 -x314 -x311 x312 -x309 x310 -x307 x308 x305 -x306 x303 -x304 -x301 -x302 -x299 -x300 x297 -x298 x295 -x296 x293
188.64/188.70 v -x294 x291 -x292 x289 -x290 x287 -x288 x285 -x286 x283 -x284 x281 -x282 -x279 -x280 -x277 x278 -x275 x276 -x273 x274 -x271 x272
188.64/188.70 v -x269 x270 -x267 x268 -x265 -x266 -x263 -x264 -x261 -x262 -x259 -x260 -x257 -x258 -x255 -x256 -x253 -x254 -x251 x252 -x249
188.64/188.70 v x250 -x247 x248 -x245 x246 x243 -x244 x241 -x242 x239 -x240 x237 -x238 x235 -x236 x233 -x234 -x231 x232 -x229 x230 -x227 x228
188.64/188.70 v -x225 x226 -x223 x224 -x221 x222 x219 -x220 x217 -x218 x215 -x216 x213 -x214 -x211 x212 -x209 x210 -x207 x208 x205 -x206 -x203
188.64/188.70 v x204 -x201 x202 x200 x198 -x196 -x194 -x192 -x190 -x188 -x186 -x184 -x182 x180 x178 x176 -x174 -x172 -x170 -x168 -x166 -x164
188.64/188.70 v -x162 x160 x158 x156 x154 -x152 -x150 -x148 -x146 -x144 -x142 -x140 x138 x136 x134 -x132 -x130 -x128 -x126 -x124 -x122 -x120
188.64/188.70 v -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98 -x96 -x94 -x92 -x90 -x88 -x86 -x84 -x82 -x80 -x78 -x76
188.64/188.70 v -x74 -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
188.64/188.70 v -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x199 -x197 -x195 -x193 -x191 -x189 -x187 -x185 -x183 -x181 -x179 -x177
188.64/188.70 v -x175 -x173 -x171 -x169 -x167 -x165 -x163 -x161 -x159 -x157 -x155 -x153 -x151 -x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135
188.64/188.70 v -x133 -x131 -x129 -x127 -x125 -x123 -x121 -x119 -x117 -x115 -x113 -x111 -x109 x107 x105 x103 x101 -x99 -x97 -x95 -x93 -x91
188.64/188.70 v -x89 -x87 x85 x83 x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65 x63 x61 -x59 -x57 -x55 -x53 -x51 -x49 -x47 -x45 -x43 -x41 -x39
188.64/188.70 v -x37 -x35 -x33 x31 x29 -x27 -x25 -x23 -x21 -x19 -x17 -x15 -x13 x11 x9 x7 -x5 -x3 -x1
188.64/188.70 c SCIP Status : solving was interrupted [solution limit reached]
188.64/188.70 c Solving Time : 186.04
188.64/188.70 c Original Problem :
188.64/188.70 c Problem name : HOME/instance-1867992-1245114071.opb
188.64/188.70 c Variables : 316 (316 binary, 0 integer, 0 implicit integer, 0 continuous)
188.64/188.70 c Constraints : 476 initial, 476 maximal
188.64/188.70 c Presolved Problem :
188.64/188.70 c Problem name : t_HOME/instance-1867992-1245114071.opb
188.64/188.70 c Variables : 308 (308 binary, 0 integer, 0 implicit integer, 0 continuous)
188.64/188.70 c Constraints : 476 initial, 636 maximal
188.64/188.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
188.64/188.70 c trivial : 0.00 0 0 0 0 0 0 0 0
188.64/188.70 c dualfix : 0.00 0 0 0 0 0 0 0 0
188.64/188.70 c boundshift : 0.00 0 0 0 0 0 0 0 0
188.64/188.70 c inttobinary : 0.00 0 0 0 0 0 0 0 0
188.64/188.70 c implics : 0.00 0 8 0 0 0 0 0 0
188.64/188.70 c probing : 0.00 0 0 0 0 0 0 0 0
188.64/188.70 c knapsack : 0.01 0 0 0 0 0 0 0 0
188.64/188.70 c logicor : 0.01 0 0 0 0 0 0 0 0
188.64/188.70 c root node : - 0 - - 0 - - - -
188.64/188.70 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
188.64/188.70 c integral : 0 0 0 18069 0 3 163 0 0 35998
188.64/188.70 c knapsack : 202 5 60250 0 0 4737 286827 249 0 0
188.64/188.70 c logicor : 274+ 5 41261 1 0 55 105221 0 0 0
188.64/188.70 c countsols : 0 0 0 1 0 0 0 0 0 0
188.64/188.70 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
188.64/188.70 c integral : 34.16 0.00 0.00 34.16 0.00
188.64/188.70 c knapsack : 1.31 0.01 1.30 0.00 0.00
188.64/188.70 c logicor : 0.97 0.00 0.97 0.00 0.00
188.64/188.70 c countsols : 0.00 0.00 0.00 0.00 0.00
188.64/188.70 c Propagators : Time Calls Cutoffs DomReds
188.64/188.70 c rootredcost : 0.03 0 0 0
188.64/188.70 c pseudoobj : 1.09 60553 0 0
188.64/188.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
188.64/188.70 c propagation : 0.15 577 554 3846 58.2 2 84.0 -
188.64/188.70 c infeasible LP : 0.05 173 0 0 0.0 0 0.0 0
188.64/188.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
188.64/188.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
188.64/188.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
188.64/188.70 c applied globally : - - - 934 19.9 - - -
188.64/188.70 c applied locally : - - - 10 32.8 - - -
188.64/188.70 c Separators : Time Calls Cutoffs DomReds Cuts Conss
188.64/188.70 c cut pool : 0.00 4 - - 228 - (maximal pool size: 1958)
188.64/188.70 c redcost : 0.25 18019 0 0 0 0
188.64/188.70 c impliedbounds : 0.00 5 0 0 823 0
188.64/188.70 c intobj : 0.00 0 0 0 0 0
188.64/188.70 c gomory : 0.43 5 0 0 404 0
188.64/188.70 c strongcg : 0.38 5 0 0 1014 0
188.64/188.70 c cmir : 0.00 0 0 0 0 0
188.64/188.70 c flowcover : 0.00 0 0 0 0 0
188.64/188.70 c clique : 0.01 1 0 0 0 0
188.64/188.70 c zerohalf : 0.00 0 0 0 0 0
188.64/188.70 c mcf : 0.00 1 0 0 0 0
188.64/188.70 c Pricers : Time Calls Vars
188.64/188.70 c problem variables: 0.00 0 0
188.64/188.70 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
188.64/188.70 c relpscost : 34.11 18068 3 163 0 0 35998
188.64/188.70 c pscost : 0.00 0 0 0 0 0 0
188.64/188.70 c inference : 0.00 0 0 0 0 0 0
188.64/188.70 c mostinf : 0.00 0 0 0 0 0 0
188.64/188.70 c leastinf : 0.00 0 0 0 0 0 0
188.64/188.70 c fullstrong : 0.00 0 0 0 0 0 0
188.64/188.70 c allfullstrong : 0.00 0 0 0 0 0 0
188.64/188.70 c random : 0.00 0 0 0 0 0 0
188.64/188.70 c Primal Heuristics : Time Calls Found
188.64/188.70 c LP solutions : 0.00 - 1
188.64/188.70 c pseudo solutions : 0.00 - 0
188.64/188.70 c simplerounding : 0.00 0 0
188.64/188.70 c rounding : 0.00 0 0
188.64/188.70 c shifting : 0.00 0 0
188.64/188.70 c intshifting : 0.00 0 0
188.64/188.70 c oneopt : 0.00 0 0
188.64/188.70 c fixandinfer : 0.00 0 0
188.64/188.70 c feaspump : 0.00 0 0
188.64/188.70 c coefdiving : 0.00 0 0
188.64/188.70 c pscostdiving : 0.00 0 0
188.64/188.70 c fracdiving : 0.00 0 0
188.64/188.70 c veclendiving : 0.00 0 0
188.64/188.70 c intdiving : 0.00 0 0
188.64/188.70 c actconsdiving : 0.00 0 0
188.64/188.70 c objpscostdiving : 0.00 0 0
188.64/188.70 c rootsoldiving : 0.00 0 0
188.64/188.70 c linesearchdiving : 0.00 0 0
188.64/188.70 c guideddiving : 0.00 0 0
188.64/188.70 c octane : 0.00 0 0
188.64/188.70 c rens : 0.00 0 0
188.64/188.70 c rins : 0.00 0 0
188.64/188.70 c localbranching : 0.00 0 0
188.64/188.70 c mutation : 0.00 0 0
188.64/188.70 c crossover : 0.00 0 0
188.64/188.70 c dins : 0.00 0 0
188.64/188.70 c LP : Time Calls Iterations Iter/call Iter/sec
188.64/188.70 c primal LP : 0.00 0 0 0.00 -
188.64/188.70 c dual LP : 139.44 18248 755016 41.38 5414.63
188.64/188.70 c barrier LP : 0.00 0 0 0.00 -
188.64/188.70 c diving/probing LP: 0.00 0 0 0.00 -
188.64/188.70 c strong branching : 33.15 3652 142957 39.14 4312.43
188.64/188.70 c (at root node) : - 26 11248 432.62 -
188.64/188.70 c conflict analysis: 0.00 0 0 0.00 -
188.64/188.70 c B&B Tree :
188.64/188.70 c number of runs : 1
188.64/188.70 c nodes : 22968
188.64/188.70 c nodes (total) : 22968
188.64/188.70 c nodes left : 12274
188.64/188.70 c max depth : 60
188.64/188.70 c max depth (total): 60
188.64/188.70 c backtracks : 2960 (12.9%)
188.64/188.70 c delayed cutoffs : 3
188.64/188.70 c repropagations : 1648 (1558 domain reductions, 3 cutoffs)
188.64/188.70 c avg switch length: 5.43
188.64/188.70 c switching time : 2.26
188.64/188.70 c Solution :
188.64/188.70 c Solutions found : 1 (1 improvements)
188.64/188.70 c Primal Bound : +7.60000000000000e+01 (in run 1, after 22968 nodes, 186.04 seconds, depth 36, found by <relaxation>)
188.64/188.70 c Dual Bound : +5.03813997750181e+01
188.64/188.70 c Gap : 50.85 %
188.64/188.70 c Root Dual Bound : +4.39141287476727e+01
188.64/188.77 c Time complete: 188.71.