0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3691893-1338038074.opb>
0.00/0.03 c original problem has 6626 variables (400 bin, 0 int, 6226 impl, 0 cont) and 7228 constraints
0.00/0.03 c problem read in 0.03
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c presolving settings loaded
0.04/0.06 c presolving:
0.19/0.29 c (round 1) 0 del vars, 7026 del conss, 400 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 201 upgd conss, 25304 impls, 399 clqs
0.29/0.32 c (round 2) 6226 del vars, 7026 del conss, 400 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 25304 impls, 0 clqs
0.29/0.33 c presolving (3 rounds):
0.29/0.33 c 6226 deleted vars, 7026 deleted constraints, 400 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.33 c 25304 implications, 0 cliques
0.29/0.33 c presolved problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 602 constraints
0.29/0.33 c 401 constraints of type <knapsack>
0.29/0.33 c 200 constraints of type <setppc>
0.29/0.33 c 1 constraints of type <linear>
0.29/0.33 c transformed objective value is always integral (scale: 1)
0.29/0.33 c Presolving Time: 0.27
0.29/0.33 c - non default parameters ----------------------------------------------------------------------
0.29/0.33 c # SCIP version 2.1.1.4
0.29/0.33 c
0.29/0.33 c # maximal time in seconds to run
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.33 c limits/time = 1797
0.29/0.33 c
0.29/0.33 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.33 c limits/memory = 13950
0.29/0.33 c
0.29/0.33 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c limits/solutions = 1
0.29/0.33 c
0.29/0.33 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.33 c separating/maxrounds = 1
0.29/0.33 c
0.29/0.33 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c separating/maxroundsroot = 5
0.29/0.33 c
0.29/0.33 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.29/0.33 c # [type: int, range: [1,2], default: 1]
0.29/0.33 c timing/clocktype = 2
0.29/0.33 c
0.29/0.33 c # belongs reading time to solving time?
0.29/0.33 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.33 c timing/reading = TRUE
0.29/0.33 c
0.29/0.33 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.33 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.33 c constraints/knapsack/disaggregation = FALSE
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/coefdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/coefdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/coefdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.33 c heuristics/crossover/freq = -1
0.29/0.33 c
0.29/0.33 c # number of nodes added to the contingent of the total nodes
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.33 c heuristics/crossover/nodesofs = 750
0.29/0.33 c
0.29/0.33 c # number of nodes without incumbent change that heuristic should wait
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.33 c heuristics/crossover/nwaitingnodes = 100
0.29/0.33 c
0.29/0.33 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.33 c # [type: real, range: [0,1], default: 0.1]
0.29/0.33 c heuristics/crossover/nodesquot = 0.15
0.29/0.33 c
0.29/0.33 c # minimum percentage of integer variables that have to be fixed
0.29/0.33 c # [type: real, range: [0,1], default: 0.666]
0.29/0.33 c heuristics/crossover/minfixingrate = 0.5
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/feaspump/freq = -1
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/feaspump/maxlpiterofs = 2000
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/fracdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/fracdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/fracdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/guideddiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/guideddiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/guideddiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/intdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/intshifting/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/linesearchdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/objpscostdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.33 c # [type: real, range: [0,1], default: 0.01]
0.29/0.33 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/oneopt/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/pscostdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/pscostdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c heuristics/rens/freq = -1
0.29/0.33 c
0.29/0.33 c # minimum percentage of integer variables that have to be fixable
0.29/0.33 c # [type: real, range: [0,1], default: 0.5]
0.29/0.33 c heuristics/rens/minfixingrate = 0.3
0.29/0.33 c
0.29/0.33 c # number of nodes added to the contingent of the total nodes
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.33 c heuristics/rens/nodesofs = 2000
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/rootsoldiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.33 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/rounding/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c heuristics/shiftandpropagate/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/shifting/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/simplerounding/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/subnlp/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c heuristics/trivial/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/trysol/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c heuristics/undercover/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/veclendiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/veclendiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/veclendiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/zirounding/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c propagating/probing/maxprerounds = 0
0.29/0.33 c
0.29/0.33 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c separating/cmir/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c separating/flowcover/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c separating/rapidlearning/freq = 0
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/indoneopt/freq = -1
0.29/0.33 c
0.29/0.33 c -----------------------------------------------------------------------------------------------
0.29/0.33 c start solving
0.29/0.33 c
0.29/0.34 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.34 c 0.3s| 1 | 0 | 58 | - | 17M| 0 | 28 | 400 | 602 | 400 | 602 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.48/0.50 c y 0.5s| 1 | 0 | 58 | - | 17M| 0 | - | 400 | 602 | 400 | 602 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.48/0.51 c 0.5s| 1 | 0 | 58 | - | 17M| 0 | - | 400 | 602 | 400 | 602 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.48/0.51 c
0.48/0.51 c SCIP Status : problem is solved [optimal solution found]
0.48/0.51 c Solving Time (sec) : 0.51
0.48/0.51 c Solving Nodes : 1
0.48/0.51 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.48/0.51 c Dual Bound : +0.00000000000000e+00
0.48/0.51 c Gap : 0.00 %
0.48/0.52 s SATISFIABLE
0.48/0.52 v x383 x316 x245 x260 x248 x378 x310 x305 x293 x257 x230 x355 x387 x352 x380 x394 x240 x393 x385 x376 x301 x360 -x290 -x297 -x350
0.48/0.52 v -x209 -x338 -x259 -x218 -x306 -x334 -x323 -x348 -x231 -x388 -x312 -x336 -x357 -x339 -x296 -x255 -x239 -x369 -x286 -x299 -x329
0.48/0.52 v -x373 -x330 -x232 -x311 -x226 -x256 -x358 -x372 -x284 -x322 -x370 -x326 -x283 -x246 -x319 -x242 -x396 -x268 -x252 -x346 -x222
0.48/0.52 v -x308 -x204 -x364 -x356 -x331 -x318 -x292 -x262 -x258 -x241 -x397 -x270 -x237 -x313 -x210 -x351 -x371 -x207 -x302 -x320 -x315
0.48/0.52 v -x377 -x344 -x353 -x379 -x219 -x392 -x203 -x395 -x381 -x375 -x300 -x213 -x235 -x295 -x264 -x279 -x275 -x345 -x291 -x340 -x289
0.48/0.52 v -x269 -x234 -x317 -x243 -x390 -x228 -x202 -x398 -x363 -x359 -x349 -x337 -x333 -x307 -x303 -x298 -x288 -x282 -x251 -x247
0.48/0.52 v -x244 -x212 -x324 -x386 -x354 -x389 -x223 -x294 -x224 -x236 -x266 -x214 -x254 -x272 -x341 -x362 -x400 -x309 -x285 -x328 -x347
0.48/0.52 v -x201 -x391 -x367 -x365 -x361 -x343 -x342 -x335 -x327 -x325 -x314 -x304 -x281 -x278 -x271 -x267 -x265 -x263 -x238 -x225 -x220
0.48/0.52 v -x217 -x216 -x208 -x205 -x368 -x253 -x384 -x332 -x374 -x280 -x206 -x215 -x287 -x229 -x221 -x399 -x261 -x249 -x227 -x382 -x274
0.48/0.52 v -x250 -x321 -x233 -x277 -x273 -x211 -x366 -x276 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 x190 -x189 -x188
0.48/0.52 v -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167
0.48/0.52 v -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146
0.48/0.52 v -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 x134 -x133 -x132 -x131 -x130 -x129 -x128 x127 -x126 x125
0.48/0.52 v -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108 -x107 -x106 -x105 -x104
0.48/0.52 v -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79
0.48/0.52 v -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54
0.48/0.52 v -x53 -x52 -x51 -x50 x49 -x48 -x47 -x46 -x45 x44 x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29
0.48/0.52 v -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 x13 -x12 -x11 x10 x9 x8 x7 x6 x5 x4 x3 x2 x1
0.48/0.52 c SCIP Status : problem is solved [optimal solution found]
0.48/0.52 c Total Time : 0.51
0.48/0.52 c solving : 0.51
0.48/0.52 c presolving : 0.27 (included in solving)
0.48/0.52 c reading : 0.03 (included in solving)
0.48/0.52 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.48/0.52 c Original Problem :
0.48/0.52 c Problem name : HOME/instance-3691893-1338038074.opb
0.48/0.52 c Variables : 6626 (400 binary, 0 integer, 6226 implicit integer, 0 continuous)
0.48/0.52 c Constraints : 7228 initial, 7228 maximal
0.48/0.52 c Objective sense : minimize
0.48/0.52 c Presolved Problem :
0.48/0.52 c Problem name : t_HOME/instance-3691893-1338038074.opb
0.48/0.52 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
0.48/0.52 c Constraints : 602 initial, 602 maximal
0.48/0.52 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.48/0.52 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c dualfix : 0.01 0.00 6226 0 0 0 0 0 0 0 0
0.48/0.52 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c knapsack : 0.02 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c setppc : 0.01 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c linear : 0.02 0.00 0 0 0 0 0 0 0 0 0
0.48/0.52 c pseudoboolean : 0.02 0.00 0 0 0 0 0 7026 400 0 0
0.48/0.52 c root node : - - 0 - - 0 - - - - -
0.48/0.52 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.48/0.52 c integral : 0 0 0 0 0 0 4 0 0 0 0 0 0
0.48/0.52 c knapsack : 401 401 1 1 0 0 1 0 0 0 54 0 0
0.48/0.52 c setppc : 200 200 1 1 0 0 1 0 0 0 0 0 0
0.48/0.52 c linear : 1 1 1 1 0 0 1 0 0 0 0 0 0
0.48/0.52 c countsols : 0 0 0 0 0 0 3 0 0 0 0 0 0
0.48/0.52 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.48/0.52 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.48/0.52 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.48/0.52 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.48/0.52 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.48/0.52 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.48/0.52 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.48/0.52 c rootredcost : 0 0 0 0
0.48/0.52 c pseudoobj : 0 0 0 0
0.48/0.52 c vbounds : 0 0 0 0
0.48/0.52 c redcost : 1 0 0 0
0.48/0.52 c probing : 0 0 0 0
0.48/0.52 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.48/0.52 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.48/0.52 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.48/0.52 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.48/0.52 c redcost : 0.00 0.00 0.00 0.00 0.00
0.48/0.52 c probing : 0.00 0.00 0.00 0.00 0.00
0.48/0.52 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.48/0.52 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.48/0.52 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.48/0.52 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.48/0.52 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.48/0.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.48/0.52 c applied globally : - - - 0 0.0 - - -
0.48/0.52 c applied locally : - - - 0 0.0 - - -
0.48/0.52 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.48/0.52 c cut pool : 0.00 0 - - 0 - (maximal pool size: 25)
0.48/0.52 c closecuts : 0.00 0.00 0 0 0 0 0
0.48/0.52 c impliedbounds : 0.00 0.00 1 0 0 0 0
0.48/0.52 c intobj : 0.00 0.00 0 0 0 0 0
0.48/0.52 c gomory : 0.03 0.00 1 0 0 6 0
0.48/0.52 c cgmip : 0.00 0.00 0 0 0 0 0
0.48/0.52 c strongcg : 0.02 0.00 1 0 0 33 0
0.48/0.52 c cmir : 0.00 0.00 0 0 0 0 0
0.48/0.52 c flowcover : 0.00 0.00 0 0 0 0 0
0.48/0.52 c clique : 0.00 0.00 1 0 0 0 0
0.48/0.52 c zerohalf : 0.00 0.00 0 0 0 0 0
0.48/0.52 c mcf : 0.00 0.00 1 0 0 0 0
0.48/0.52 c oddcycle : 0.00 0.00 0 0 0 0 0
0.48/0.52 c rapidlearning : 0.11 0.00 1 0 0 0 0
0.48/0.52 c Pricers : ExecTime SetupTime Calls Vars
0.48/0.52 c problem variables: 0.00 - 0 0
0.48/0.52 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.48/0.52 c pscost : 0.00 0.00 0 0 0 0 0 0
0.48/0.52 c inference : 0.00 0.00 0 0 0 0 0 0
0.48/0.52 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.48/0.52 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.48/0.52 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.48/0.52 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.48/0.52 c random : 0.00 0.00 0 0 0 0 0 0
0.48/0.52 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.48/0.52 c Primal Heuristics : ExecTime SetupTime Calls Found
0.48/0.52 c LP solutions : 0.00 - - 0
0.48/0.52 c pseudo solutions : 0.00 - - 0
0.48/0.52 c smallcard : 0.00 0.00 0 0
0.48/0.52 c trivial : 0.00 0.00 1 0
0.48/0.52 c shiftandpropagate: 0.00 0.00 0 0
0.48/0.52 c simplerounding : 0.00 0.00 0 0
0.48/0.52 c zirounding : 0.00 0.00 0 0
0.48/0.52 c rounding : 0.00 0.00 0 0
0.48/0.52 c shifting : 0.00 0.00 0 0
0.48/0.52 c intshifting : 0.00 0.00 0 0
0.48/0.52 c oneopt : 0.00 0.00 0 0
0.48/0.52 c twoopt : 0.00 0.00 0 0
0.48/0.52 c indtwoopt : 0.00 0.00 0 0
0.48/0.52 c indoneopt : 0.00 0.00 0 0
0.48/0.52 c fixandinfer : 0.00 0.00 0 0
0.48/0.52 c feaspump : 0.00 0.00 0 0
0.48/0.52 c clique : 0.00 0.00 0 0
0.48/0.52 c indrounding : 0.00 0.00 0 0
0.48/0.52 c indcoefdiving : 0.00 0.00 0 0
0.48/0.52 c coefdiving : 0.00 0.00 0 0
0.48/0.52 c pscostdiving : 0.00 0.00 0 0
0.48/0.52 c nlpdiving : 0.00 0.00 0 0
0.48/0.52 c fracdiving : 0.00 0.00 0 0
0.48/0.52 c veclendiving : 0.00 0.00 0 0
0.48/0.52 c intdiving : 0.00 0.00 0 0
0.48/0.52 c actconsdiving : 0.00 0.00 0 0
0.48/0.52 c objpscostdiving : 0.00 0.00 0 0
0.48/0.52 c rootsoldiving : 0.00 0.00 0 0
0.48/0.52 c linesearchdiving : 0.00 0.00 0 0
0.48/0.52 c guideddiving : 0.00 0.00 0 0
0.48/0.52 c octane : 0.00 0.00 0 0
0.48/0.52 c rens : 0.00 0.00 0 0
0.48/0.52 c rins : 0.00 0.00 0 0
0.48/0.52 c localbranching : 0.00 0.00 0 0
0.48/0.52 c mutation : 0.00 0.00 0 0
0.48/0.52 c crossover : 0.00 0.00 0 0
0.48/0.52 c dins : 0.00 0.00 0 0
0.48/0.52 c vbounds : 0.00 0.00 0 0
0.48/0.52 c undercover : 0.00 0.00 0 0
0.48/0.52 c subnlp : 0.00 0.00 0 0
0.48/0.52 c trysol : 0.00 0.00 0 0
0.48/0.52 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.48/0.52 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.48/0.52 c dual LP : 0.00 1 58 58.00 - 0.00 0
0.48/0.52 c lex dual LP : 0.00 0 0 0.00 -
0.48/0.52 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.48/0.52 c diving/probing LP: 0.00 0 0 0.00 -
0.48/0.52 c strong branching : 0.00 0 0 0.00 -
0.48/0.52 c (at root node) : - 0 0 0.00 -
0.48/0.52 c conflict analysis: 0.00 0 0 0.00 -
0.48/0.52 c B&B Tree :
0.48/0.52 c number of runs : 1
0.48/0.52 c nodes : 1
0.48/0.52 c nodes (total) : 1
0.48/0.52 c nodes left : 0
0.48/0.52 c max depth : 0
0.48/0.52 c max depth (total): 0
0.48/0.52 c backtracks : 0 (0.0%)
0.48/0.52 c delayed cutoffs : 0
0.48/0.52 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.48/0.52 c avg switch length: 2.00
0.48/0.52 c switching time : 0.00
0.48/0.52 c Solution :
0.48/0.52 c Solutions found : 1 (1 improvements)
0.48/0.52 c First Solution : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.50 seconds, depth 0, found by <trysol>)
0.48/0.52 c Primal Bound : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.50 seconds, depth 0, found by <trysol>)
0.48/0.52 c Dual Bound : +0.00000000000000e+00
0.48/0.52 c Gap : 0.00 %
0.48/0.52 c Root Dual Bound : +0.00000000000000e+00
0.48/0.52 c Root Iterations : 58
0.48/0.55 c Time complete: 0.54.