0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2665701-1276269743.opb>
0.01/0.02 c original problem has 316 variables (316 bin, 0 int, 0 impl, 0 cont) and 476 constraints
0.01/0.02 c problem read
0.01/0.02 c No objective function, only one solution is needed.
0.01/0.02 c presolving settings loaded
0.01/0.03 c presolving:
0.01/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.01/0.06 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.01/0.06 c presolving (3 rounds):
0.01/0.06 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.06 c 9460 implications, 0 cliques
0.01/0.06 c presolved problem has 308 variables (308 bin, 0 int, 0 impl, 0 cont) and 476 constraints
0.01/0.06 c 202 constraints of type <knapsack>
0.01/0.06 c 274 constraints of type <logicor>
0.01/0.06 c transformed objective value is always integral (scale: 1)
0.01/0.06 c Presolving Time: 0.03
0.01/0.06 c - non default parameters ----------------------------------------------------------------------
0.01/0.06 c # SCIP version 1.2.1.2
0.01/0.06 c
0.01/0.06 c # frequency for displaying node information lines
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.06 c display/freq = 10000
0.01/0.06 c
0.01/0.06 c # maximal time in seconds to run
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06 c limits/time = 1799.99
0.01/0.06 c
0.01/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06 c limits/memory = 1620
0.01/0.06 c
0.01/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c limits/solutions = 1
0.01/0.06 c
0.01/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.06 c separating/maxrounds = 1
0.01/0.06 c
0.01/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c separating/maxroundsroot = 5
0.01/0.06 c
0.01/0.06 c # should presolving try to simplify inequalities
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/linear/simplifyinequalities = TRUE
0.01/0.06 c
0.01/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.06 c constraints/knapsack/disaggregation = FALSE
0.01/0.06 c
0.01/0.06 c # should presolving try to simplify knapsacks
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.06 c
0.01/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c presolving/probing/maxrounds = 0
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/coefdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.06 c heuristics/crossover/freq = -1
0.01/0.06 c
0.01/0.06 c # number of nodes added to the contingent of the total nodes
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06 c heuristics/crossover/nodesofs = 750
0.01/0.06 c
0.01/0.06 c # number of nodes without incumbent change that heuristic should wait
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.06 c heuristics/crossover/nwaitingnodes = 100
0.01/0.06 c
0.01/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.06 c # [type: real, range: [0,1], default: 0.1]
0.01/0.06 c heuristics/crossover/nodesquot = 0.15
0.01/0.06 c
0.01/0.06 c # minimum percentage of integer variables that have to be fixed
0.01/0.06 c # [type: real, range: [0,1], default: 0.666]
0.01/0.06 c heuristics/crossover/minfixingrate = 0.5
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/feaspump/freq = -1
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/fracdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/guideddiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/intshifting/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/linesearchdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/nlp/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/objpscostdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.06 c # [type: real, range: [0,1], default: 0.01]
0.01/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/oneopt/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/pscostdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c heuristics/rens/freq = -1
0.01/0.06 c
0.01/0.06 c # minimum percentage of integer variables that have to be fixable
0.01/0.06 c # [type: real, range: [0,1], default: 0.5]
0.01/0.06 c heuristics/rens/minfixingrate = 0.3
0.01/0.06 c
0.01/0.06 c # number of nodes added to the contingent of the total nodes
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06 c heuristics/rens/nodesofs = 2000
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/rootsoldiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/rounding/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/shifting/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/simplerounding/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c heuristics/trivial/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/trysol/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/veclendiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/zirounding/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c separating/cmir/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c separating/flowcover/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c separating/rapidlearning/freq = 0
0.01/0.06 c
0.01/0.06 c -----------------------------------------------------------------------------------------------
0.01/0.06 c start solving
0.01/0.07 c
0.01/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.08 c 0.0s| 1 | 0 | 127 | - |1906k| 0 | 80 | 308 | 476 | 308 | 468 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 230 | - |2671k| 0 | 152 | 308 | 477 | 308 | 703 | 235 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 393 | - |5380k| 0 | 166 | 308 | 477 | 308 | 879 | 411 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.80 c 0.7s| 1 | 0 | 485 | - |7218k| 0 | 169 | 308 | 477 | 308 | 916 | 448 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/1.00 c 0.9s| 1 | 0 | 491 | - |8057k| 0 | 173 | 308 | 477 | 308 | 925 | 457 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.20 c 1.1s| 1 | 0 | 554 | - |8927k| 0 | 168 | 308 | 477 | 308 | 928 | 460 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.48 c 1.4s| 1 | 2 | 554 | - |8928k| 0 | 168 | 308 | 477 | 308 | 928 | 460 | 0 | 10 | 0.000000e+00 | -- | Inf
23.38/23.47 c 21.8s| 10000 | 95 | 85046 | 8.5 |9407k| 40 | - | 308 | 830 | 0 | 0 | 460 | 528 |1756 | 0.000000e+00 | -- | Inf
38.38/38.49 c *35.9s| 18270 | 0 |158109 | 8.6 |9294k| 40 | - | 308 | 889 | 308 | 624 | 460 |1053 |1996 | 0.000000e+00 | 0.000000e+00 | 0.00%
38.38/38.49 c
38.38/38.49 c SCIP Status : problem is solved [optimal solution found]
38.38/38.49 c Solving Time (sec) : 35.89
38.38/38.49 c Solving Nodes : 18270
38.38/38.49 c Primal Bound : +0.00000000000000e+00 (1 solutions)
38.38/38.49 c Dual Bound : +0.00000000000000e+00
38.38/38.49 c Gap : 0.00 %
38.38/38.49 s SATISFIABLE
38.38/38.49 v x315 -x316 -x313 x314 -x311 x312 -x309 x310 x307 -x308 x305 -x306 x303 -x304 x301 -x302 -x299 -x300 -x297 -x298 x295 -x296 -x293
38.38/38.49 v -x294 x291 -x292 -x289 -x290 x287 -x288 x285 -x286 x283 -x284 x281 -x282 x279 -x280 -x277 x278 x275 -x276 -x273 x274 -x271
38.38/38.49 v x272 -x269 x270 -x267 x268 -x265 x266 -x263 -x264 -x261 x262 -x259 -x260 x257 -x258 x255 -x256 -x253 x254 -x251 x252 -x249 x250
38.38/38.49 v x247 -x248 -x245 x246 x243 -x244 -x241 x242 x239 -x240 x237 -x238 x235 -x236 x233 -x234 x231 -x232 -x229 x230 -x227 x228 -x225
38.38/38.49 v x226 x223 -x224 -x221 x222 x219 -x220 x217 -x218 x215 -x216 -x213 x214 -x211 x212 -x209 x210 x207 -x208 -x205 x206 x203
38.38/38.49 v -x204 -x201 x202 -x200 x198 -x196 x194 -x192 -x190 -x188 -x186 x184 -x182 x180 -x178 x176 -x174 x172 -x170 -x168 -x166 x164 -x162
38.38/38.49 v -x160 x158 -x156 x154 -x152 -x150 -x148 -x146 -x144 -x142 -x140 -x138 -x136 -x134 -x132 -x130 -x128 -x126 -x124 -x122 -x120
38.38/38.49 v -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98 -x96 -x94 -x92 -x90 -x88 -x86 -x84 -x82 x80 x78 -x76 -x74
38.38/38.49 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 -x22
38.38/38.49 v -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x199 -x197 -x195 -x193 -x191 -x189 -x187 -x185 -x183 -x181 -x179 -x177 -x175
38.38/38.49 v -x173 -x171 -x169 -x167 -x165 -x163 -x161 -x159 -x157 -x155 -x153 -x151 -x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135 -x133
38.38/38.49 v -x131 -x129 -x127 x125 -x123 x121 -x119 -x117 -x115 -x113 -x111 -x109 x107 -x105 -x103 x101 -x99 -x97 -x95 -x93 -x91 x89
38.38/38.49 v -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 -x37
38.38/38.49 v -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19 -x17 -x15 -x13 -x11 x9 x7 x5 -x3 x1
38.38/38.49 c SCIP Status : problem is solved [optimal solution found]
38.38/38.49 c Solving Time : 35.89
38.38/38.49 c Original Problem :
38.38/38.49 c Problem name : HOME/instance-2665701-1276269743.opb
38.38/38.49 c Variables : 316 (316 binary, 0 integer, 0 implicit integer, 0 continuous)
38.38/38.49 c Constraints : 476 initial, 476 maximal
38.38/38.49 c Presolved Problem :
38.38/38.49 c Problem name : t_HOME/instance-2665701-1276269743.opb
38.38/38.49 c Variables : 308 (308 binary, 0 integer, 0 implicit integer, 0 continuous)
38.38/38.49 c Constraints : 476 initial, 969 maximal
38.38/38.49 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
38.38/38.49 c trivial : 0.00 0 0 0 0 0 0 0 0
38.38/38.49 c dualfix : 0.00 0 0 0 0 0 0 0 0
38.38/38.49 c boundshift : 0.00 0 0 0 0 0 0 0 0
38.38/38.49 c inttobinary : 0.00 0 0 0 0 0 0 0 0
38.38/38.49 c implics : 0.00 0 8 0 0 0 0 0 0
38.38/38.49 c probing : 0.00 0 0 0 0 0 0 0 0
38.38/38.49 c knapsack : 0.01 0 0 0 0 0 0 0 0
38.38/38.49 c linear : 0.01 0 0 0 0 0 0 0 0
38.38/38.49 c logicor : 0.01 0 0 0 0 0 0 0 0
38.38/38.49 c root node : - 0 - - 0 - - - -
38.38/38.49 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
38.38/38.49 c integral : 0 0 0 9416 0 16 245 0 0 18530
38.38/38.49 c knapsack : 202 5 47544 0 0 7203 164562 457 0 0
38.38/38.49 c linear : 0+ 5 30 0 0 0 0 0 0 0
38.38/38.49 c logicor : 274+ 5 31330 1 0 160 72907 0 0 0
38.38/38.49 c countsols : 0 0 0 1 0 0 0 0 0 0
38.38/38.49 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
38.38/38.49 c integral : 6.27 0.00 0.00 6.27 0.00
38.38/38.49 c knapsack : 1.60 0.03 1.57 0.00 0.00
38.38/38.49 c linear : 0.00 0.00 0.00 0.00 0.00
38.38/38.49 c logicor : 0.72 0.00 0.72 0.00 0.00
38.38/38.49 c countsols : 0.00 0.00 0.00 0.00 0.00
38.38/38.49 c Propagators : Time Calls Cutoffs DomReds
38.38/38.49 c vbounds : 0.04 1 0 0
38.38/38.49 c rootredcost : 0.01 0 0 0
38.38/38.49 c pseudoobj : 0.02 0 0 0
38.38/38.49 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
38.38/38.49 c propagation : 0.45 1279 1031 6925 71.9 19 80.2 -
38.38/38.49 c infeasible LP : 0.32 1776 0 0 0.0 0 0.0 0
38.38/38.49 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
38.38/38.49 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
38.38/38.49 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
38.38/38.49 c applied globally : - - - 1043 15.4 - - -
38.38/38.49 c applied locally : - - - 10 45.1 - - -
38.38/38.49 c Separators : Time Calls Cutoffs DomReds Cuts Conss
38.38/38.49 c cut pool : 0.00 4 - - 97 - (maximal pool size: 1690)
38.38/38.49 c redcost : 0.07 9324 0 0 0 0
38.38/38.49 c impliedbounds : 0.00 5 0 0 728 0
38.38/38.49 c intobj : 0.00 0 0 0 0 0
38.38/38.49 c cgmip : 0.00 0 0 0 0 0
38.38/38.49 c gomory : 0.36 5 0 0 202 0
38.38/38.49 c strongcg : 0.39 5 0 0 2140 0
38.38/38.49 c cmir : 0.00 0 0 0 0 0
38.38/38.49 c flowcover : 0.00 0 0 0 0 0
38.38/38.49 c clique : 0.01 1 0 0 0 0
38.38/38.49 c zerohalf : 0.00 0 0 0 0 0
38.38/38.49 c mcf : 0.00 1 0 0 0 0
38.38/38.49 c rapidlearning : 0.11 1 0 0 0 1
38.38/38.49 c Pricers : Time Calls Vars
38.38/38.49 c problem variables: 0.00 0 0
38.38/38.49 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
38.38/38.49 c relpscost : 6.27 9415 16 245 0 0 18530
38.38/38.49 c pscost : 0.00 0 0 0 0 0 0
38.38/38.49 c inference : 0.00 0 0 0 0 0 0
38.38/38.49 c mostinf : 0.00 0 0 0 0 0 0
38.38/38.49 c leastinf : 0.00 0 0 0 0 0 0
38.38/38.49 c fullstrong : 0.00 0 0 0 0 0 0
38.38/38.49 c allfullstrong : 0.00 0 0 0 0 0 0
38.38/38.49 c random : 0.00 0 0 0 0 0 0
38.38/38.49 c Primal Heuristics : Time Calls Found
38.38/38.49 c LP solutions : 0.00 - 1
38.38/38.49 c pseudo solutions : 0.00 - 0
38.38/38.49 c trivial : 0.00 1 0
38.38/38.49 c simplerounding : 0.00 0 0
38.38/38.49 c zirounding : 0.00 0 0
38.38/38.49 c rounding : 0.00 0 0
38.38/38.49 c shifting : 0.00 0 0
38.38/38.49 c intshifting : 0.00 0 0
38.38/38.49 c oneopt : 0.00 0 0
38.38/38.49 c twoopt : 0.00 0 0
38.38/38.49 c fixandinfer : 0.00 0 0
38.38/38.49 c feaspump : 0.00 0 0
38.38/38.49 c coefdiving : 0.00 0 0
38.38/38.49 c pscostdiving : 0.00 0 0
38.38/38.49 c fracdiving : 0.00 0 0
38.38/38.49 c veclendiving : 0.00 0 0
38.38/38.49 c intdiving : 0.00 0 0
38.38/38.49 c actconsdiving : 0.00 0 0
38.38/38.49 c objpscostdiving : 0.00 0 0
38.38/38.49 c rootsoldiving : 0.00 0 0
38.38/38.49 c linesearchdiving : 0.00 0 0
38.38/38.49 c guideddiving : 0.00 0 0
38.38/38.49 c octane : 0.00 0 0
38.38/38.49 c rens : 0.00 0 0
38.38/38.49 c rins : 0.00 0 0
38.38/38.49 c localbranching : 0.00 0 0
38.38/38.49 c mutation : 0.00 0 0
38.38/38.49 c crossover : 0.00 0 0
38.38/38.49 c dins : 0.00 0 0
38.38/38.49 c undercover : 0.00 0 0
38.38/38.49 c nlp : 0.00 0 0
38.38/38.49 c trysol : 0.00 0 0
38.38/38.49 c LP : Time Calls Iterations Iter/call Iter/sec
38.38/38.49 c primal LP : 0.00 0 0 0.00 -
38.38/38.49 c dual LP : 23.12 11184 158109 14.14 6838.62
38.38/38.49 c lex dual LP : 0.00 0 0 0.00 -
38.38/38.49 c barrier LP : 0.00 0 0 0.00 -
38.38/38.49 c diving/probing LP: 0.00 0 0 0.00 -
38.38/38.49 c strong branching : 6.10 1996 39563 19.82 6485.74
38.38/38.49 c (at root node) : - 10 1074 107.40 -
38.38/38.49 c conflict analysis: 0.00 0 0 0.00 -
38.38/38.49 c B&B Tree :
38.38/38.49 c number of runs : 1
38.38/38.49 c nodes : 18270
38.38/38.49 c nodes (total) : 18270
38.38/38.49 c nodes left : 0
38.38/38.49 c max depth : 40
38.38/38.49 c max depth (total): 40
38.38/38.49 c backtracks : 2753 (15.1%)
38.38/38.49 c delayed cutoffs : 154
38.38/38.49 c repropagations : 2239 (6562 domain reductions, 151 cutoffs)
38.38/38.49 c avg switch length: 2.95
38.38/38.49 c switching time : 1.04
38.38/38.49 c Solution :
38.38/38.49 c Solutions found : 1 (1 improvements)
38.38/38.49 c First Solution : +0.00000000000000e+00 (in run 1, after 18270 nodes, 35.88 seconds, depth 29, found by <relaxation>)
38.38/38.49 c Primal Bound : +0.00000000000000e+00 (in run 1, after 18270 nodes, 35.88 seconds, depth 29, found by <relaxation>)
38.38/38.49 c Dual Bound : +0.00000000000000e+00
38.38/38.49 c Gap : 0.00 %
38.38/38.49 c Root Dual Bound : +0.00000000000000e+00
38.38/38.49 c Root Iterations : 554
38.49/38.51 c Time complete: 38.49.