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-1867980-1245113594.opb>
0.00/0.02 c original problem has 316 variables (316 bin, 0 int, 0 impl, 0 cont) and 686 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.03 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 352 impls, 0 clqs
0.00/0.03 c (round 2) 15 del vars, 19 del conss, 13 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 352 impls, 0 clqs
0.00/0.03 c (round 3) 15 del vars, 31 del conss, 13 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 352 impls, 0 clqs
0.00/0.06 c (round 4) 15 del vars, 31 del conss, 13 chg bounds, 0 chg sides, 0 chg coeffs, 655 upgd conss, 352 impls, 0 clqs
0.00/0.07 c (round 5) 21 del vars, 31 del conss, 13 chg bounds, 0 chg sides, 0 chg coeffs, 655 upgd conss, 8648 impls, 6 clqs
0.00/0.07 c presolving (6 rounds):
0.00/0.07 c 21 deleted vars, 31 deleted constraints, 13 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.07 c 8648 implications, 6 cliques
0.00/0.07 c presolved problem has 295 variables (295 bin, 0 int, 0 impl, 0 cont) and 655 constraints
0.00/0.07 c 199 constraints of type <knapsack>
0.00/0.07 c 456 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.03
0.00/0.07 c SATUNSAT-LIN
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c separating/flowcover/freq = c -1
0.00/0.07 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c separating/cmir/freq = c -1
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.07 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/veclendiving/freq = c -1
0.00/0.07 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/simplerounding/freq = c -1
0.00/0.07 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/shifting/freq = c -1
0.00/0.07 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/rounding/freq = c -1
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.07 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.07 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/rootsoldiving/freq = c -1
0.00/0.07 c # number of nodes added to the contingent of the total nodes
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.07 c heuristics/rens/nodesofs = c 2000
0.00/0.07 c # minimum percentage of integer variables that have to be fixable
0.00/0.07 c # [type: real, range: [0,1], default: 0.5]
0.00/0.07 c heuristics/rens/minfixingrate = c 0.3
0.00/0.07 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/rens/freq = c -1
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.07 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/pscostdiving/freq = c -1
0.00/0.07 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/oneopt/freq = c -1
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.07 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.07 c # [type: real, range: [0,1], default: 0.01]
0.00/0.07 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.07 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/objpscostdiving/freq = c -1
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.07 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/linesearchdiving/freq = c -1
0.00/0.07 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/intshifting/freq = c -1
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.07 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/guideddiving/freq = c -1
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.07 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/fracdiving/freq = c -1
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.07 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/feaspump/freq = c -1
0.00/0.07 c # minimum percentage of integer variables that have to be fixed
0.00/0.07 c # [type: real, range: [0,1], default: 0.666]
0.00/0.07 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.07 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.07 c # [type: real, range: [0,1], default: 0.1]
0.00/0.07 c heuristics/crossover/nodesquot = c 0.15
0.00/0.07 c # number of nodes without incumbent change that heuristic should wait
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.07 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.07 c # number of nodes added to the contingent of the total nodes
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.07 c heuristics/crossover/nodesofs = c 750
0.00/0.07 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.07 c heuristics/crossover/freq = c -1
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.07 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/coefdiving/freq = c -1
0.00/0.07 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c presolving/probing/maxrounds = c 0
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.07 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.07 c constraints/knapsack/disaggregation = c FALSE
0.00/0.07 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.07 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/maxroundsroot = c 5
0.00/0.07 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.07 c separating/maxrounds = c 1
0.00/0.07 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c limits/solutions = c 1
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = c 1620
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = c 1791
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = c 10000
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving problem
0.00/0.07 c
0.19/0.25 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.25 c 0.2s| 1 | 0 | 1236 |2093k| 0 | 214 | 295 | 655 | 655 | 295 | 649 | 0 | 0 | 0 | 4.396150e+01 | -- | Inf
0.79/0.89 c 0.8s| 1 | 0 | 2116 |5547k| 0 | 252 | 295 | 655 | 655 | 295 |1119 | 470 | 0 | 0 | 5.102099e+01 | -- | Inf
1.39/1.49 c 1.4s| 1 | 0 | 2582 |6901k| 0 | 270 | 295 | 655 | 655 | 295 |1248 | 599 | 0 | 0 | 5.180591e+01 | -- | Inf
1.89/1.99 c 1.9s| 1 | 0 | 2842 |7835k| 0 | 270 | 295 | 655 | 655 | 295 |1261 | 612 | 0 | 0 | 5.188308e+01 | -- | Inf
2.39/2.49 c 2.4s| 1 | 0 | 3024 |9072k| 0 | 268 | 295 | 655 | 655 | 295 |1264 | 615 | 0 | 0 | 5.193810e+01 | -- | Inf
2.89/2.95 c 2.9s| 1 | 0 | 3138 | 10M| 0 | 272 | 295 | 655 | 655 | 295 |1265 | 616 | 0 | 0 | 5.196848e+01 | -- | Inf
22.68/22.71 c 22.6s| 1 | 2 | 3138 | 10M| 0 | 272 | 295 | 655 | 655 | 295 |1265 | 616 | 0 | 43 | 5.196848e+01 | -- | Inf
152.23/152.39 c * 151s| 5242 | 598 |251551 | 11M| 38 | - | 295 |1245 | 80 | 295 | 992 | 616 | 964 |1155 | 5.806687e+01 | 7.800000e+01 | 34.33%
152.23/152.39 c
152.23/152.39 c SCIP Status : solving was interrupted [solution limit reached]
152.23/152.39 c Solving Time (sec) : 151.08
152.23/152.39 c Solving Nodes : 5242
152.23/152.39 c Primal Bound : +7.80000000000000e+01 (1 solutions)
152.23/152.39 c Dual Bound : +5.80668665211570e+01
152.23/152.39 c Gap : 34.33 %
152.23/152.39 c NODE 5242
152.23/152.39 c DUAL BOUND 58.0669
152.23/152.39 c PRIMAL BOUND 78
152.23/152.39 c GAP 0.343279
152.23/152.39 s SATISFIABLE
152.23/152.39 v x315 -x316 x313 -x314 x311 -x312 x309 -x310 x307 -x308 x305 -x306 x303 -x304 x301 -x302 -x299 -x300 -x297 -x298 -x295 -x296 -x293
152.23/152.39 v -x294 x291 -x292 x289 -x290 x287 -x288 -x285 x286 -x283 x284 -x281 x282 -x279 x280 x277 -x278 x275 -x276 x273 -x274 -x271
152.23/152.39 v x272 -x269 x270 -x267 x268 -x265 -x266 -x263 -x264 -x261 -x262 -x259 x260 -x257 x258 -x255 x256 -x253 x254 -x251 x252 -x249 x250
152.23/152.39 v -x247 x248 -x245 x246 -x243 x244 -x241 -x242 x239 -x240 x237 -x238 x235 -x236 x233 -x234 x231 -x232 x229 -x230 -x227 x228
152.23/152.39 v -x225 x226 -x223 x224 -x221 x222 -x219 x220 -x217 x218 -x215 x216 x213 -x214 x211 -x212 -x209 x210 -x207 x208 x205 -x206 x203
152.23/152.39 v -x204 x201 -x202 -x200 -x198 -x196 -x194 -x192 -x190 -x188 -x186 -x184 -x182 -x180 -x178 -x176 -x174 -x172 -x170 -x168 -x166
152.23/152.39 v -x164 -x162 -x160 -x158 -x156 -x154 -x152 -x150 -x148 -x146 -x144 -x142 x140 x138 x136 -x134 -x132 -x130 -x128 -x126 -x124
152.23/152.39 v -x122 x120 x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98 -x96 -x94 -x92 -x90 -x88 -x86 -x84 -x82 -x80 -x78
152.23/152.39 v -x76 -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
152.23/152.39 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
152.23/152.39 v -x173 -x171 -x169 x167 x165 x163 -x161 -x159 -x157 -x155 -x153 -x151 -x149 x147 x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131
152.23/152.39 v -x129 -x127 -x125 -x123 -x121 -x119 -x117 -x115 -x113 -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87
152.23/152.39 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 -x35
152.23/152.39 v -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19 -x17 -x15 -x13 -x11 -x9 -x7 -x5 -x3 -x1
152.23/152.39 c SCIP Status : solving was interrupted [solution limit reached]
152.23/152.39 c Solving Time : 151.08
152.23/152.39 c Original Problem :
152.23/152.39 c Problem name : HOME/instance-1867980-1245113594.opb
152.23/152.39 c Variables : 316 (316 binary, 0 integer, 0 implicit integer, 0 continuous)
152.23/152.39 c Constraints : 686 initial, 686 maximal
152.23/152.39 c Presolved Problem :
152.23/152.39 c Problem name : t_HOME/instance-1867980-1245113594.opb
152.23/152.39 c Variables : 295 (295 binary, 0 integer, 0 implicit integer, 0 continuous)
152.23/152.39 c Constraints : 655 initial, 1249 maximal
152.23/152.39 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
152.23/152.39 c trivial : 0.00 0 0 0 0 0 0 0 0
152.23/152.39 c dualfix : 0.00 0 0 0 0 0 0 0 0
152.23/152.39 c boundshift : 0.00 0 0 0 0 0 0 0 0
152.23/152.39 c inttobinary : 0.00 0 0 0 0 0 0 0 0
152.23/152.39 c implics : 0.00 0 8 0 0 0 0 0 0
152.23/152.39 c probing : 0.00 0 0 0 0 0 0 0 0
152.23/152.39 c knapsack : 0.01 0 0 0 0 0 0 0 0
152.23/152.39 c linear : 0.02 13 0 0 13 0 31 0 0
152.23/152.39 c logicor : 0.00 0 0 0 0 0 0 0 0
152.23/152.39 c root node : - 0 - - 0 - - - -
152.23/152.39 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
152.23/152.39 c integral : 0 0 0 2987 0 1 92 0 0 5914
152.23/152.39 c knapsack : 199 5 18976 1 0 1140 55522 294 0 0
152.23/152.39 c logicor : 456+ 5 15015 1 0 250 30907 0 0 0
152.23/152.39 c countsols : 0 0 0 1 0 0 0 0 0 0
152.23/152.39 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
152.23/152.39 c integral : 74.49 0.00 0.00 74.49 0.00
152.23/152.39 c knapsack : 0.40 0.01 0.39 0.00 0.00
152.23/152.39 c logicor : 0.41 0.00 0.41 0.00 0.00
152.23/152.39 c countsols : 0.00 0.00 0.00 0.00 0.00
152.23/152.39 c Propagators : Time Calls Cutoffs DomReds
152.23/152.39 c rootredcost : 0.00 0 0 0
152.23/152.39 c pseudoobj : 0.29 19056 0 0
152.23/152.39 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
152.23/152.39 c propagation : 0.16 536 508 4661 57.0 12 35.0 -
152.23/152.39 c infeasible LP : 0.19 914 0 0 0.0 0 0.0 0
152.23/152.39 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
152.23/152.39 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
152.23/152.39 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
152.23/152.39 c applied globally : - - - 959 17.8 - - -
152.23/152.39 c applied locally : - - - 5 74.4 - - -
152.23/152.39 c Separators : Time Calls Cutoffs DomReds Cuts Conss
152.23/152.39 c cut pool : 0.00 4 - - 30 - (maximal pool size: 2194)
152.23/152.39 c redcost : 0.03 2972 0 0 0 0
152.23/152.39 c impliedbounds : 0.01 5 0 0 868 0
152.23/152.39 c intobj : 0.00 0 0 0 0 0
152.23/152.39 c gomory : 0.89 5 0 0 51 0
152.23/152.39 c strongcg : 0.83 5 0 0 1816 0
152.23/152.39 c cmir : 0.00 0 0 0 0 0
152.23/152.39 c flowcover : 0.00 0 0 0 0 0
152.23/152.39 c clique : 0.00 5 0 0 8 0
152.23/152.39 c zerohalf : 0.00 0 0 0 0 0
152.23/152.39 c mcf : 0.00 1 0 0 0 0
152.23/152.39 c Pricers : Time Calls Vars
152.23/152.39 c problem variables: 0.00 0 0
152.23/152.39 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
152.23/152.39 c relpscost : 74.48 2986 1 92 0 0 5914
152.23/152.39 c pscost : 0.00 0 0 0 0 0 0
152.23/152.39 c inference : 0.00 0 0 0 0 0 0
152.23/152.39 c mostinf : 0.00 0 0 0 0 0 0
152.23/152.39 c leastinf : 0.00 0 0 0 0 0 0
152.23/152.39 c fullstrong : 0.00 0 0 0 0 0 0
152.23/152.39 c allfullstrong : 0.00 0 0 0 0 0 0
152.23/152.39 c random : 0.00 0 0 0 0 0 0
152.23/152.39 c Primal Heuristics : Time Calls Found
152.23/152.39 c LP solutions : 0.00 - 1
152.23/152.39 c pseudo solutions : 0.00 - 0
152.23/152.39 c simplerounding : 0.00 0 0
152.23/152.39 c rounding : 0.00 0 0
152.23/152.39 c shifting : 0.00 0 0
152.23/152.39 c intshifting : 0.00 0 0
152.23/152.39 c oneopt : 0.00 0 0
152.23/152.39 c fixandinfer : 0.00 0 0
152.23/152.39 c feaspump : 0.00 0 0
152.23/152.39 c coefdiving : 0.00 0 0
152.23/152.39 c pscostdiving : 0.00 0 0
152.23/152.39 c fracdiving : 0.00 0 0
152.23/152.39 c veclendiving : 0.00 0 0
152.23/152.39 c intdiving : 0.00 0 0
152.23/152.39 c actconsdiving : 0.00 0 0
152.23/152.39 c objpscostdiving : 0.00 0 0
152.23/152.39 c rootsoldiving : 0.00 0 0
152.23/152.39 c linesearchdiving : 0.00 0 0
152.23/152.39 c guideddiving : 0.00 0 0
152.23/152.39 c octane : 0.00 0 0
152.23/152.39 c rens : 0.00 0 0
152.23/152.39 c rins : 0.00 0 0
152.23/152.39 c localbranching : 0.00 0 0
152.23/152.39 c mutation : 0.00 0 0
152.23/152.39 c crossover : 0.00 0 0
152.23/152.39 c dins : 0.00 0 0
152.23/152.39 c LP : Time Calls Iterations Iter/call Iter/sec
152.23/152.39 c primal LP : 0.00 0 0 0.00 -
152.23/152.39 c dual LP : 71.54 3942 251551 63.81 3516.23
152.23/152.39 c barrier LP : 0.00 0 0 0.00 -
152.23/152.39 c diving/probing LP: 0.00 0 0 0.00 -
152.23/152.39 c strong branching : 74.34 1155 207016 179.23 2784.72
152.23/152.39 c (at root node) : - 43 39581 920.49 -
152.23/152.39 c conflict analysis: 0.00 0 0 0.00 -
152.23/152.39 c B&B Tree :
152.23/152.39 c number of runs : 1
152.23/152.39 c nodes : 5242
152.23/152.39 c nodes (total) : 5242
152.23/152.39 c nodes left : 598
152.23/152.39 c max depth : 38
152.23/152.39 c max depth (total): 38
152.23/152.39 c backtracks : 924 (17.6%)
152.23/152.39 c delayed cutoffs : 59
152.23/152.39 c repropagations : 893 (3834 domain reductions, 58 cutoffs)
152.23/152.39 c avg switch length: 3.66
152.23/152.39 c switching time : 0.52
152.23/152.39 c Solution :
152.23/152.39 c Solutions found : 1 (1 improvements)
152.23/152.39 c Primal Bound : +7.80000000000000e+01 (in run 1, after 5242 nodes, 151.08 seconds, depth 25, found by <relaxation>)
152.23/152.39 c Dual Bound : +5.80668665211570e+01
152.23/152.39 c Gap : 34.33 %
152.23/152.39 c Root Dual Bound : +5.19684757832651e+01
152.33/152.41 c Time complete: 152.35.