0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver Clp 1.8.2
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1867983-1245113715.opb>
0.00/0.02 c original problem has 370 variables (370 bin, 0 int, 0 impl, 0 cont) and 809 constraints
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c start presolving problem
0.00/0.03 c presolving:
0.00/0.03 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.00/0.04 c (round 2) 16 del vars, 20 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.00/0.04 c (round 3) 16 del vars, 33 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.00/0.06 c (round 4) 16 del vars, 33 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 776 upgd conss, 406 impls, 0 clqs
0.00/0.07 c (round 5) 22 del vars, 33 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 776 upgd conss, 11256 impls, 6 clqs
0.00/0.08 c presolving (6 rounds):
0.00/0.08 c 22 deleted vars, 33 deleted constraints, 14 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.08 c 11256 implications, 6 cliques
0.00/0.08 c presolved problem has 348 variables (348 bin, 0 int, 0 impl, 0 cont) and 776 constraints
0.00/0.08 c 240 constraints of type <knapsack>
0.00/0.08 c 536 constraints of type <logicor>
0.00/0.08 c transformed objective value is always integral (scale: 1)
0.00/0.08 c Presolving Time: 0.04
0.00/0.08 c SATUNSAT-LIN
0.00/0.08 c -----------------------------------------------------------------------------------------------
0.00/0.08 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c separating/flowcover/freq = c -1
0.00/0.08 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c separating/cmir/freq = c -1
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.08 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/veclendiving/freq = c -1
0.00/0.08 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/simplerounding/freq = c -1
0.00/0.08 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/shifting/freq = c -1
0.00/0.08 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/rounding/freq = c -1
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.08 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.08 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.08 c heuristics/rootsoldiving/freq = c -1
0.00/0.08 c # number of nodes added to the contingent of the total nodes
0.00/0.08 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.08 c heuristics/rens/nodesofs = c 2000
0.00/0.08 c # minimum percentage of integer variables that have to be fixable
0.00/0.08 c # [type: real, range: [0,1], default: 0.5]
0.00/0.08 c heuristics/rens/minfixingrate = c 0.3
0.00/0.08 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c heuristics/rens/freq = c -1
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.08 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/pscostdiving/freq = c -1
0.00/0.08 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/oneopt/freq = c -1
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.08 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.08 c # [type: real, range: [0,1], default: 0.01]
0.00/0.08 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.08 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.08 c heuristics/objpscostdiving/freq = c -1
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.08 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/linesearchdiving/freq = c -1
0.00/0.08 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/intshifting/freq = c -1
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.08 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/guideddiving/freq = c -1
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.08 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/fracdiving/freq = c -1
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.08 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.08 c heuristics/feaspump/freq = c -1
0.00/0.08 c # minimum percentage of integer variables that have to be fixed
0.00/0.08 c # [type: real, range: [0,1], default: 0.666]
0.00/0.08 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.08 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.08 c # [type: real, range: [0,1], default: 0.1]
0.00/0.08 c heuristics/crossover/nodesquot = c 0.15
0.00/0.08 c # number of nodes without incumbent change that heuristic should wait
0.00/0.08 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.08 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.08 c # number of nodes added to the contingent of the total nodes
0.00/0.08 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.08 c heuristics/crossover/nodesofs = c 750
0.00/0.08 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.08 c heuristics/crossover/freq = c -1
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.08 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/coefdiving/freq = c -1
0.00/0.08 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c presolving/probing/maxrounds = c 0
0.00/0.08 c # should presolving try to simplify knapsacks
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.08 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.08 c constraints/knapsack/disaggregation = c FALSE
0.00/0.08 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.08 c # should presolving try to simplify inequalities
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.08 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c separating/maxroundsroot = c 5
0.00/0.08 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.08 c separating/maxrounds = c 1
0.00/0.08 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c limits/solutions = c 1
0.00/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/memory = c 1620
0.00/0.08 c # maximal time in seconds to run
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/time = c 1791
0.00/0.08 c # frequency for displaying node information lines
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.08 c display/freq = c 10000
0.00/0.08 c -----------------------------------------------------------------------------------------------
0.00/0.08 c start solving problem
0.00/0.08 c
0.19/0.23 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.23 c 0.2s| 1 | 0 | 800 |2475k| 0 | 263 | 348 | 776 | 776 | 348 | 770 | 0 | 0 | 0 | 5.148456e+01 | -- | Inf
1.09/1.11 c 1.1s| 1 | 0 | 2168 |7132k| 0 | 308 | 348 | 776 | 776 | 348 |1368 | 598 | 0 | 0 | 5.915089e+01 | -- | Inf
1.79/1.81 c 1.8s| 1 | 0 | 2743 |9730k| 0 | 320 | 348 | 776 | 776 | 348 |1492 | 722 | 0 | 0 | 5.985900e+01 | -- | Inf
2.29/2.39 c 2.3s| 1 | 0 | 2987 | 11M| 0 | 316 | 348 | 776 | 776 | 348 |1499 | 729 | 0 | 0 | 5.995109e+01 | -- | Inf
2.99/3.00 c 2.9s| 1 | 0 | 3108 | 13M| 0 | 318 | 348 | 776 | 776 | 348 |1502 | 732 | 0 | 0 | 5.997128e+01 | -- | Inf
3.59/3.62 c 3.5s| 1 | 0 | 3241 | 14M| 0 | 324 | 348 | 776 | 776 | 348 |1506 | 736 | 0 | 0 | 5.998471e+01 | -- | Inf
4.89/4.97 c 4.9s| 1 | 2 | 3241 | 14M| 0 | 324 | 348 | 776 | 776 | 348 |1506 | 736 | 0 | 18 | 5.998471e+01 | -- | Inf
105.44/105.51 c * 105s| 1991 | 239 |199883 | 14M| 34 | - | 348 |1150 | 63 | 348 |1169 | 736 | 453 |1318 | 6.310188e+01 | 9.000000e+01 | 42.63%
105.44/105.51 c
105.44/105.51 c SCIP Status : solving was interrupted [solution limit reached]
105.44/105.51 c Solving Time (sec) : 105.08
105.44/105.51 c Solving Nodes : 1991
105.44/105.51 c Primal Bound : +9.00000000000000e+01 (1 solutions)
105.44/105.51 c Dual Bound : +6.31018776705644e+01
105.44/105.51 c Gap : 42.63 %
105.44/105.52 c NODE 1991
105.44/105.52 c DUAL BOUND 63.1019
105.44/105.52 c PRIMAL BOUND 90
105.44/105.52 c GAP 0.426265
105.44/105.52 s SATISFIABLE
105.44/105.52 v x369 -x370 x367 -x368 x365 -x366 -x363 x364 x361 -x362 x359 -x360 x357 -x358 x355 -x356 -x353 -x354 -x351 -x352 -x349 -x350 x347
105.44/105.52 v -x348 x345 -x346 x343 -x344 x341 -x342 x339 -x340 -x337 x338 x335 -x336 x333 -x334 x331 -x332 -x329 x330 x327 -x328 -x325 x326
105.44/105.52 v -x323 x324 -x321 x322 -x319 x320 -x317 x318 -x315 -x316 -x313 x314 -x311 -x312 -x309 x310 -x307 x308 -x305 -x306 -x303 -x304
105.44/105.52 v -x301 -x302 -x299 x300 -x297 x298 -x295 x296 x293 -x294 -x291 x292 x289 -x290 -x287 x288 x285 -x286 x283 -x284 x281 -x282
105.44/105.52 v x279 -x280 x277 -x278 -x275 x276 -x273 x274 -x271 x272 -x269 x270 -x267 x268 -x265 x266 -x263 x264 x261 -x262 x259 -x260 x257
105.44/105.52 v -x258 -x255 x256 -x253 x254 -x251 x252 x249 -x250 x247 -x248 -x245 x246 -x243 x244 -x242 -x240 -x238 -x236 -x234 -x232 -x230
105.44/105.52 v -x228 -x226 -x224 -x222 x220 -x218 x216 -x214 x212 -x210 -x208 -x206 -x204 -x202 -x200 x198 x196 -x194 x192 -x190 -x188 -x186
105.44/105.52 v -x184 -x182 -x180 -x178 x176 x174 x172 -x170 x168 -x166 -x164 -x162 -x160 -x158 -x156 -x154 -x152 -x150 -x148 -x146 -x144
105.44/105.52 v -x142 -x140 -x138 -x136 -x134 -x132 -x130 -x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102
105.44/105.52 v -x100 -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
105.44/105.52 v -x48 -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
105.44/105.52 v -x237 -x235 -x233 -x231 x229 -x227 -x225 -x223 x221 -x219 -x217 -x215 -x213 -x211 -x209 -x207 -x205 -x203 -x201 -x199 -x197
105.44/105.52 v -x195 -x193 -x191 -x189 -x187 -x185 -x183 -x181 -x179 -x177 -x175 -x173 -x171 -x169 -x167 -x165 -x163 -x161 -x159 -x157 -x155
105.44/105.52 v -x153 -x151 -x149 -x147 -x145 -x143 x141 -x139 x137 x135 x133 -x131 -x129 -x127 -x125 -x123 x121 -x119 x117 -x115 x113 x111
105.44/105.52 v -x109 -x107 -x105 -x103 -x101 -x99 x97 -x95 x93 -x91 x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65 -x63 -x61
105.44/105.52 v -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
105.44/105.52 v x9 -x7 -x5 -x3 x1
105.44/105.52 c SCIP Status : solving was interrupted [solution limit reached]
105.44/105.52 c Solving Time : 105.08
105.44/105.52 c Original Problem :
105.44/105.52 c Problem name : HOME/instance-1867983-1245113715.opb
105.44/105.52 c Variables : 370 (370 binary, 0 integer, 0 implicit integer, 0 continuous)
105.44/105.52 c Constraints : 809 initial, 809 maximal
105.44/105.52 c Presolved Problem :
105.44/105.52 c Problem name : t_HOME/instance-1867983-1245113715.opb
105.44/105.52 c Variables : 348 (348 binary, 0 integer, 0 implicit integer, 0 continuous)
105.44/105.52 c Constraints : 776 initial, 1150 maximal
105.44/105.52 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
105.44/105.52 c trivial : 0.00 0 0 0 0 0 0 0 0
105.44/105.52 c dualfix : 0.00 0 0 0 0 0 0 0 0
105.44/105.52 c boundshift : 0.00 0 0 0 0 0 0 0 0
105.44/105.52 c inttobinary : 0.00 0 0 0 0 0 0 0 0
105.44/105.52 c implics : 0.00 0 8 0 0 0 0 0 0
105.44/105.52 c probing : 0.00 0 0 0 0 0 0 0 0
105.44/105.52 c knapsack : 0.01 0 0 0 0 0 0 0 0
105.44/105.52 c linear : 0.02 14 0 0 14 0 33 0 0
105.44/105.52 c logicor : 0.01 0 0 0 0 0 0 0 0
105.44/105.52 c root node : - 1 - - 1 - - - -
105.44/105.52 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
105.44/105.52 c integral : 0 0 0 1172 0 5 80 0 0 2282
105.44/105.52 c knapsack : 240 5 7732 1 0 538 24614 316 0 0
105.44/105.52 c logicor : 536+ 5 5924 1 0 124 12392 0 0 0
105.44/105.52 c countsols : 0 0 0 1 0 0 0 0 0 0
105.44/105.52 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
105.44/105.52 c integral : 47.66 0.00 0.00 47.66 0.00
105.44/105.52 c knapsack : 0.21 0.01 0.20 0.00 0.00
105.44/105.52 c logicor : 0.14 0.00 0.14 0.00 0.00
105.44/105.52 c countsols : 0.00 0.00 0.00 0.00 0.00
105.44/105.52 c Propagators : Time Calls Cutoffs DomReds
105.44/105.52 c rootredcost : 0.00 0 0 0
105.44/105.52 c pseudoobj : 0.17 7771 0 0
105.44/105.52 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
105.44/105.52 c propagation : 0.13 273 268 2623 71.1 3 40.0 -
105.44/105.52 c infeasible LP : 0.01 227 0 0 0.0 0 0.0 0
105.44/105.52 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
105.44/105.52 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
105.44/105.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
105.44/105.52 c applied globally : - - - 453 15.4 - - -
105.44/105.52 c applied locally : - - - 0 0.0 - - -
105.44/105.52 c Separators : Time Calls Cutoffs DomReds Cuts Conss
105.44/105.52 c cut pool : 0.01 4 - - 58 - (maximal pool size: 2687)
105.44/105.52 c redcost : 0.02 1163 0 0 0 0
105.44/105.52 c impliedbounds : 0.00 5 0 0 1021 0
105.44/105.52 c intobj : 0.00 0 0 0 0 0
105.44/105.52 c gomory : 1.25 5 0 0 25 0
105.44/105.52 c strongcg : 1.02 5 0 0 2073 0
105.44/105.52 c cmir : 0.00 0 0 0 0 0
105.44/105.52 c flowcover : 0.00 0 0 0 0 0
105.44/105.52 c clique : 0.00 5 0 0 13 0
105.44/105.52 c zerohalf : 0.00 0 0 0 0 0
105.44/105.52 c mcf : 0.00 1 0 0 0 0
105.44/105.52 c Pricers : Time Calls Vars
105.44/105.52 c problem variables: 0.00 0 0
105.44/105.52 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
105.44/105.52 c relpscost : 47.65 1171 5 80 0 0 2282
105.44/105.52 c pscost : 0.00 0 0 0 0 0 0
105.44/105.52 c inference : 0.00 0 0 0 0 0 0
105.44/105.52 c mostinf : 0.00 0 0 0 0 0 0
105.44/105.52 c leastinf : 0.00 0 0 0 0 0 0
105.44/105.52 c fullstrong : 0.00 0 0 0 0 0 0
105.44/105.52 c allfullstrong : 0.00 0 0 0 0 0 0
105.44/105.52 c random : 0.00 0 0 0 0 0 0
105.44/105.52 c Primal Heuristics : Time Calls Found
105.44/105.52 c LP solutions : 0.00 - 1
105.44/105.52 c pseudo solutions : 0.00 - 0
105.44/105.52 c simplerounding : 0.00 0 0
105.44/105.52 c rounding : 0.00 0 0
105.44/105.52 c shifting : 0.00 0 0
105.44/105.52 c intshifting : 0.00 0 0
105.44/105.52 c oneopt : 0.00 0 0
105.44/105.52 c fixandinfer : 0.00 0 0
105.44/105.52 c feaspump : 0.00 0 0
105.44/105.52 c coefdiving : 0.00 0 0
105.44/105.52 c pscostdiving : 0.00 0 0
105.44/105.52 c fracdiving : 0.00 0 0
105.44/105.52 c veclendiving : 0.00 0 0
105.44/105.52 c intdiving : 0.00 0 0
105.44/105.52 c actconsdiving : 0.00 0 0
105.44/105.52 c objpscostdiving : 0.00 0 0
105.44/105.52 c rootsoldiving : 0.00 0 0
105.44/105.52 c linesearchdiving : 0.00 0 0
105.44/105.52 c guideddiving : 0.00 0 0
105.44/105.52 c octane : 0.00 0 0
105.44/105.52 c rens : 0.00 0 0
105.44/105.52 c rins : 0.00 0 0
105.44/105.52 c localbranching : 0.00 0 0
105.44/105.52 c mutation : 0.00 0 0
105.44/105.52 c crossover : 0.00 0 0
105.44/105.52 c dins : 0.00 0 0
105.44/105.52 c LP : Time Calls Iterations Iter/call Iter/sec
105.44/105.52 c primal LP : 0.05 0 0 0.00 0.00
105.44/105.52 c dual LP : 53.74 1404 199883 142.37 3719.45
105.44/105.52 c barrier LP : 0.00 0 0 0.00 -
105.44/105.52 c diving/probing LP: 0.00 0 0 0.00 -
105.44/105.52 c strong branching : 47.57 1318 167684 127.23 3524.99
105.44/105.52 c (at root node) : - 18 3240 180.00 -
105.44/105.52 c conflict analysis: 0.00 0 0 0.00 -
105.44/105.52 c B&B Tree :
105.44/105.52 c number of runs : 1
105.44/105.52 c nodes : 1991
105.44/105.52 c nodes (total) : 1991
105.44/105.52 c nodes left : 239
105.44/105.52 c max depth : 34
105.44/105.52 c max depth (total): 34
105.44/105.52 c backtracks : 339 (17.0%)
105.44/105.52 c delayed cutoffs : 51
105.44/105.52 c repropagations : 755 (2776 domain reductions, 45 cutoffs)
105.44/105.52 c avg switch length: 3.96
105.44/105.52 c switching time : 0.26
105.44/105.52 c Solution :
105.44/105.52 c Solutions found : 1 (1 improvements)
105.44/105.52 c Primal Bound : +9.00000000000000e+01 (in run 1, after 1991 nodes, 105.08 seconds, depth 30, found by <relaxation>)
105.44/105.52 c Dual Bound : +6.31018776705644e+01
105.44/105.52 c Gap : 42.63 %
105.44/105.52 c Root Dual Bound : +5.99847076274010e+01
105.44/105.53 c Time complete: 105.48.