0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-3737691-1338717665.opb>
0.00/0.02 c original problem has 2924 variables (2924 bin, 0 int, 0 impl, 0 cont) and 3126 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.07 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 20592 impls, 400 clqs
0.00/0.09 c presolving (2 rounds):
0.00/0.09 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.09 c 20592 implications, 400 cliques
0.00/0.09 c presolved problem has 2924 variables (2924 bin, 0 int, 0 impl, 0 cont) and 3126 constraints
0.00/0.09 c 1 constraints of type <knapsack>
0.00/0.09 c 600 constraints of type <setppc>
0.00/0.09 c 2524 constraints of type <and>
0.00/0.09 c 1 constraints of type <linear>
0.00/0.09 c transformed objective value is always integral (scale: 1)
0.00/0.09 c Presolving Time: 0.06
0.00/0.09 c - non default parameters ----------------------------------------------------------------------
0.00/0.09 c # SCIP version 1.2.1.3
0.00/0.09 c
0.00/0.09 c # frequency for displaying node information lines
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.09 c display/freq = 10000
0.00/0.09 c
0.00/0.09 c # maximal time in seconds to run
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/time = 1789.99
0.00/0.09 c
0.00/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/memory = 13950
0.00/0.09 c
0.00/0.09 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c limits/solutions = 1
0.00/0.09 c
0.00/0.09 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.09 c separating/maxrounds = 1
0.00/0.09 c
0.00/0.09 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c separating/maxroundsroot = 5
0.00/0.09 c
0.00/0.09 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.09 c # [type: int, range: [1,2], default: 1]
0.00/0.09 c timing/clocktype = 2
0.00/0.09 c
0.00/0.09 c # should presolving try to simplify inequalities
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/linear/simplifyinequalities = TRUE
0.00/0.09 c
0.00/0.09 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/indicator/addCouplingCons = TRUE
0.00/0.09 c
0.00/0.09 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.09 c constraints/knapsack/disaggregation = FALSE
0.00/0.09 c
0.00/0.09 c # should presolving try to simplify knapsacks
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.09 c
0.00/0.09 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c presolving/probing/maxrounds = 0
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/coefdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.09 c heuristics/crossover/freq = -1
0.00/0.09 c
0.00/0.09 c # number of nodes added to the contingent of the total nodes
0.00/0.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.09 c heuristics/crossover/nodesofs = 750
0.00/0.09 c
0.00/0.09 c # number of nodes without incumbent change that heuristic should wait
0.00/0.09 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.09 c heuristics/crossover/nwaitingnodes = 100
0.00/0.09 c
0.00/0.09 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.09 c # [type: real, range: [0,1], default: 0.1]
0.00/0.09 c heuristics/crossover/nodesquot = 0.15
0.00/0.09 c
0.00/0.09 c # minimum percentage of integer variables that have to be fixed
0.00/0.09 c # [type: real, range: [0,1], default: 0.666]
0.00/0.09 c heuristics/crossover/minfixingrate = 0.5
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.09 c heuristics/feaspump/freq = -1
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/fracdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/guideddiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/intshifting/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/linesearchdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/nlp/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.09 c heuristics/objpscostdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.09 c # [type: real, range: [0,1], default: 0.01]
0.00/0.09 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/oneopt/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/pscostdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c heuristics/rens/freq = -1
0.00/0.09 c
0.00/0.09 c # minimum percentage of integer variables that have to be fixable
0.00/0.09 c # [type: real, range: [0,1], default: 0.5]
0.00/0.09 c heuristics/rens/minfixingrate = 0.3
0.00/0.09 c
0.00/0.09 c # number of nodes added to the contingent of the total nodes
0.00/0.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.09 c heuristics/rens/nodesofs = 2000
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.09 c heuristics/rootsoldiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.09 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/rounding/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/shifting/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/simplerounding/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c heuristics/trivial/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/trysol/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/veclendiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/zirounding/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c separating/cmir/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c separating/flowcover/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c separating/rapidlearning/freq = 0
0.00/0.09 c
0.00/0.09 c -----------------------------------------------------------------------------------------------
0.00/0.09 c start solving
0.00/0.09 c
0.19/0.23 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.23 c 0.2s| 1 | 0 | 759 | - | 13M| 0 | 355 |2924 |3126 |2924 |5650 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/1.00 c 1.0s| 1 | 0 | 854 | - | 15M| 0 | 354 |2924 |3126 |2924 |5677 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.61 c 1.6s| 1 | 0 | 897 | - | 17M| 0 | 340 |2924 |3126 |2924 |5684 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
2.20/2.21 c 2.2s| 1 | 0 | 953 | - | 19M| 0 | 352 |2924 |3126 |2924 |5691 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
2.79/2.84 c 2.8s| 1 | 0 | 1030 | - | 21M| 0 | 369 |2924 |3126 |2924 |5700 | 50 | 0 | 0 | 0.000000e+00 | -- | Inf
3.39/3.47 c 3.5s| 1 | 0 | 1088 | - | 23M| 0 | 361 |2924 |3126 |2924 |5707 | 57 | 0 | 0 | 0.000000e+00 | -- | Inf
4.30/4.32 c 4.3s| 1 | 2 | 1088 | - | 23M| 0 | 361 |2924 |3126 |2924 |5707 | 57 | 0 | 10 | 0.000000e+00 | -- | Inf
15.68/15.70 c *15.7s| 120 | 0 | 6116 | 42.3 | 23M| 91 | - |2924 |3136 |2924 |1359 |1065 | 10 |1233 | 0.000000e+00 | 0.000000e+00 | 0.00%
15.68/15.71 c
15.68/15.71 c SCIP Status : problem is solved [optimal solution found]
15.68/15.71 c Solving Time (sec) : 15.69
15.68/15.71 c Solving Nodes : 120
15.68/15.71 c Primal Bound : +0.00000000000000e+00 (1 solutions)
15.68/15.71 c Dual Bound : +0.00000000000000e+00
15.68/15.71 c Gap : 0.00 %
15.68/15.71 s SATISFIABLE
15.68/15.71 v -x337 -x254 -x326 -x298 -x375 -x353 -x329 -x311 -x351 x391 x235 -x400 -x393 -x398 -x312 -x293 -x336 -x331 -x259 -x304 -x366 -x349
15.68/15.71 v -x276 -x341 -x281 -x396 -x359 -x228 -x399 -x346 x255 -x244 -x322 -x358 -x270 -x219 -x314 -x266 -x347 -x371 -x279 -x372 -x260
15.68/15.71 v x382 x333 -x216 -x277 x243 -x269 x324 -x320 -x267 x237 -x352 -x387 x310 -x335 -x214 -x261 x356 -x263 -x274 -x385 -x381 -x265
15.68/15.71 v x316 -x213 -x253 -x278 -x227 -x357 -x290 -x289 -x288 -x285 -x251 -x313 -x379 -x294 x210 -x272 -x241 -x378 -x249 x209 x389
15.68/15.71 v x286 x250 -x234 -x224 -x264 x306 -x361 -x268 x388 x334 -x383 x380 -x330 -x271 x247 -x301 -x239 -x291 x362 -x354 -x258 -x256 -x230
15.68/15.71 v -x211 -x308 -x340 -x392 -x232 x394 -x206 x397 -x363 -x309 -x297 -x282 x238 -x218 -x207 -x296 -x287 -x222 -x368 -x348 x390
15.68/15.71 v -x370 -x292 x246 x217 -x248 -x344 -x273 x299 -x343 -x332 -x245 -x376 -x377 -x373 x307 -x295 -x240 x236 -x262 -x223 x325 -x395
15.68/15.71 v -x220 -x300 x203 -x367 -x257 x233 -x208 x305 x221 -x321 -x283 -x323 -x319 -x374 -x369 x202 -x360 -x339 x280 -x252 -x231 -x225
15.68/15.71 v -x212 -x205 -x318 -x350 -x342 -x303 x215 x204 -x365 -x315 -x355 -x201 -x384 -x328 -x317 -x242 -x345 -x386 -x229 -x226 -x338
15.68/15.71 v -x364 -x327 -x275 -x284 -x302 -x200 -x199 x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 x187 -x186 x185
15.68/15.71 v -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 x170 -x169 -x168 -x167 x166 -x165 -x164
15.68/15.71 v -x163 -x162 -x161 -x160 x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 x148 -x147 -x146 -x145 -x144 -x143 -x142
15.68/15.71 v -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 x131 -x130 -x129 x128 -x127 x126 -x125 -x124 -x123 -x122 -x121
15.68/15.71 v -x120 -x119 -x118 x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104 -x103 -x102 -x101 -x100
15.68/15.71 v -x99 x98 -x97 x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 x78 x77 -x76 -x75 x74
15.68/15.71 v x73 x72 -x71 -x70 x69 -x68 -x67 x66 x65 -x64 x63 -x62 x61 -x60 x59 -x58 -x57 x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47
15.68/15.71 v -x46 x45 -x44 -x43 -x42 -x41 -x40 x39 -x38 -x37 -x36 -x35 x34 -x33 -x32 -x31 x30 -x29 -x28 x27 x26 -x25 -x24 -x23 x22 -x21 -x20
15.68/15.71 v x19 x18 -x17 -x16 -x15 -x14 -x13 -x12 x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 -x2 x1
15.68/15.71 c SCIP Status : problem is solved [optimal solution found]
15.68/15.71 c Solving Time : 15.69
15.68/15.71 c Original Problem :
15.68/15.71 c Problem name : HOME/instance-3737691-1338717665.opb
15.68/15.71 c Variables : 2924 (2924 binary, 0 integer, 0 implicit integer, 0 continuous)
15.68/15.71 c Constraints : 3126 initial, 3126 maximal
15.68/15.71 c Presolved Problem :
15.68/15.71 c Problem name : t_HOME/instance-3737691-1338717665.opb
15.68/15.71 c Variables : 2924 (2924 binary, 0 integer, 0 implicit integer, 0 continuous)
15.68/15.71 c Constraints : 3126 initial, 3136 maximal
15.68/15.71 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
15.68/15.71 c trivial : 0.00 0 0 0 0 0 0 0 0
15.68/15.71 c dualfix : 0.00 0 0 0 0 0 0 0 0
15.68/15.71 c boundshift : 0.00 0 0 0 0 0 0 0 0
15.68/15.71 c inttobinary : 0.00 0 0 0 0 0 0 0 0
15.68/15.71 c implics : 0.00 0 0 0 0 0 0 0 0
15.68/15.71 c probing : 0.00 0 0 0 0 0 0 0 0
15.68/15.71 c knapsack : 0.00 0 0 0 0 0 0 0 0
15.68/15.71 c setppc : 0.00 0 0 0 0 0 0 0 0
15.68/15.71 c and : 0.04 0 0 0 0 0 0 0 0
15.68/15.71 c linear : 0.01 0 0 0 0 0 0 0 0
15.68/15.71 c logicor : 0.00 0 0 0 0 0 0 0 0
15.68/15.71 c root node : - 0 - - 0 - - - -
15.68/15.71 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
15.68/15.71 c integral : 0 0 0 135 0 0 31 0 0 218
15.68/15.71 c knapsack : 1 5 486 3 0 0 0 0 0 0
15.68/15.71 c setppc : 600 5 486 3 0 9 333 0 0 0
15.68/15.71 c and : 2524 115 477 3 0 1 3247 1025 0 0
15.68/15.71 c linear : 1 5 476 1 0 0 0 0 0 0
15.68/15.71 c logicor : 0+ 0 19 0 0 0 9 0 0 0
15.68/15.71 c countsols : 0 0 0 1 0 0 0 0 0 0
15.68/15.71 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
15.68/15.71 c integral : 10.99 0.00 0.00 10.99 0.00
15.68/15.71 c knapsack : 0.03 0.03 0.00 0.00 0.00
15.68/15.71 c setppc : 0.00 0.00 0.00 0.00 0.00
15.68/15.71 c and : 0.05 0.03 0.01 0.00 0.00
15.68/15.71 c linear : 0.01 0.00 0.01 0.00 0.00
15.68/15.71 c logicor : 0.00 0.00 0.00 0.00 0.00
15.68/15.71 c countsols : 0.00 0.00 0.00 0.00 0.00
15.68/15.71 c Propagators : Time Calls Cutoffs DomReds
15.68/15.71 c vbounds : 0.00 1 0 0
15.68/15.71 c rootredcost : 0.00 0 0 0
15.68/15.71 c pseudoobj : 0.00 0 0 0
15.68/15.71 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
15.68/15.71 c propagation : 0.00 10 10 10 3.0 0 0.0 -
15.68/15.71 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
15.68/15.71 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
15.68/15.71 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
15.68/15.71 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
15.68/15.71 c applied globally : - - - 10 3.0 - - -
15.68/15.71 c applied locally : - - - 0 0.0 - - -
15.68/15.71 c Separators : Time Calls Cutoffs DomReds Cuts Conss
15.68/15.71 c cut pool : 0.00 4 - - 2 - (maximal pool size: 1011)
15.68/15.71 c redcost : 0.00 115 0 0 0 0
15.68/15.71 c impliedbounds : 0.00 5 0 0 44 0
15.68/15.71 c intobj : 0.00 0 0 0 0 0
15.68/15.71 c cgmip : 0.00 0 0 0 0 0
15.68/15.71 c gomory : 1.33 5 0 0 0 0
15.68/15.71 c strongcg : 1.48 5 0 0 2500 0
15.68/15.71 c cmir : 0.00 0 0 0 0 0
15.68/15.71 c flowcover : 0.00 0 0 0 0 0
15.68/15.71 c clique : 0.04 5 0 0 32 0
15.68/15.71 c zerohalf : 0.00 0 0 0 0 0
15.68/15.71 c mcf : 0.00 1 0 0 0 0
15.68/15.71 c rapidlearning : 0.17 1 0 0 0 0
15.68/15.71 c Pricers : Time Calls Vars
15.68/15.71 c problem variables: 0.00 0 0
15.68/15.71 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
15.68/15.71 c relpscost : 10.99 132 0 31 0 0 218
15.68/15.71 c pscost : 0.00 0 0 0 0 0 0
15.68/15.71 c inference : 0.00 0 0 0 0 0 0
15.68/15.71 c mostinf : 0.00 0 0 0 0 0 0
15.68/15.71 c leastinf : 0.00 0 0 0 0 0 0
15.68/15.71 c fullstrong : 0.00 0 0 0 0 0 0
15.68/15.71 c allfullstrong : 0.00 0 0 0 0 0 0
15.68/15.71 c random : 0.00 0 0 0 0 0 0
15.68/15.71 c Primal Heuristics : Time Calls Found
15.68/15.71 c LP solutions : 0.00 - 1
15.68/15.71 c pseudo solutions : 0.00 - 0
15.68/15.71 c trivial : 0.00 1 0
15.68/15.71 c simplerounding : 0.00 0 0
15.68/15.71 c zirounding : 0.00 0 0
15.68/15.71 c rounding : 0.00 0 0
15.68/15.71 c shifting : 0.00 0 0
15.68/15.71 c intshifting : 0.00 0 0
15.68/15.71 c oneopt : 0.00 0 0
15.68/15.71 c twoopt : 0.00 0 0
15.68/15.71 c fixandinfer : 0.00 0 0
15.68/15.71 c feaspump : 0.00 0 0
15.68/15.71 c coefdiving : 0.00 0 0
15.68/15.71 c pscostdiving : 0.00 0 0
15.68/15.71 c fracdiving : 0.00 0 0
15.68/15.71 c veclendiving : 0.00 0 0
15.68/15.71 c intdiving : 0.00 0 0
15.68/15.71 c actconsdiving : 0.00 0 0
15.68/15.71 c objpscostdiving : 0.00 0 0
15.68/15.71 c rootsoldiving : 0.00 0 0
15.68/15.71 c linesearchdiving : 0.00 0 0
15.68/15.71 c guideddiving : 0.00 0 0
15.68/15.71 c octane : 0.00 0 0
15.68/15.71 c rens : 0.00 0 0
15.68/15.71 c rins : 0.00 0 0
15.68/15.71 c localbranching : 0.00 0 0
15.68/15.71 c mutation : 0.00 0 0
15.68/15.71 c crossover : 0.00 0 0
15.68/15.71 c dins : 0.00 0 0
15.68/15.71 c undercover : 0.00 0 0
15.68/15.71 c nlp : 0.00 0 0
15.68/15.71 c trysol : 0.00 0 0
15.68/15.71 c LP : Time Calls Iterations Iter/call Iter/sec
15.68/15.71 c primal LP : 0.07 0 0 0.00 0.00
15.68/15.71 c dual LP : 1.26 242 6116 25.27 4862.28
15.68/15.71 c lex dual LP : 0.00 0 0 0.00 -
15.68/15.71 c barrier LP : 0.00 0 0 0.00 -
15.68/15.71 c diving/probing LP: 0.00 0 0 0.00 -
15.68/15.71 c strong branching : 10.98 1233 49115 39.83 4473.71
15.68/15.71 c (at root node) : - 10 1849 184.90 -
15.68/15.71 c conflict analysis: 0.00 0 0 0.00 -
15.68/15.71 c B&B Tree :
15.68/15.71 c number of runs : 1
15.68/15.71 c nodes : 120
15.68/15.71 c nodes (total) : 120
15.68/15.71 c nodes left : 0
15.68/15.71 c max depth : 91
15.68/15.71 c max depth (total): 91
15.68/15.71 c backtracks : 3 (2.5%)
15.68/15.71 c delayed cutoffs : 0
15.68/15.71 c repropagations : 180 (90 domain reductions, 0 cutoffs)
15.68/15.71 c avg switch length: 5.03
15.68/15.71 c switching time : 0.10
15.68/15.71 c Solution :
15.68/15.71 c Solutions found : 1 (1 improvements)
15.68/15.71 c First Solution : +0.00000000000000e+00 (in run 1, after 120 nodes, 15.68 seconds, depth 91, found by <relaxation>)
15.68/15.71 c Primal Bound : +0.00000000000000e+00 (in run 1, after 120 nodes, 15.68 seconds, depth 91, found by <relaxation>)
15.68/15.71 c Dual Bound : +0.00000000000000e+00
15.68/15.71 c Gap : 0.00 %
15.68/15.71 c Root Dual Bound : +0.00000000000000e+00
15.68/15.71 c Root Iterations : 1088
15.68/15.73 c Time complete: 15.72.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 989)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3737691-1338717665/watcher-3737691-1338717665 -o /tmp/evaluation-result-3737691-1338717665/solver-3737691-1338717665 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3737691-1338717665.opb -t 1800 -m 15500
running on 4 cores: 1,3,5,7
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 2.00 2.02 1.94 3/177 21999
/proc/meminfo: memFree=27539208/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=9972 CPUtime=0 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 1524 0 0 0 0 0 0 0 20 0 1 0 337891053 10211328 1470 33554432000 4194304 8395647 140734341795120 140734341794072 7382157 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 2493 1479 374 1026 0 1463 0
[startup+0.014702 s]
/proc/loadavg: 2.00 2.02 1.94 3/177 21999
/proc/meminfo: memFree=27539208/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=13500 CPUtime=0 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 2623 0 0 0 0 0 0 0 20 0 1 0 337891053 13824000 2569 33554432000 4194304 8395647 140734341795120 140734341794072 7430272 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 3375 2569 390 1026 0 2345 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 13500
[startup+0.100238 s]
/proc/loadavg: 2.00 2.02 1.94 3/177 21999
/proc/meminfo: memFree=27539208/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=29304 CPUtime=0.09 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 6552 0 0 0 8 1 0 0 20 0 1 0 337891053 30007296 6145 33554432000 4194304 8395647 140734341795120 140734341794072 6347101 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 7326 6180 523 1026 0 6296 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 29304
[startup+0.300249 s]
/proc/loadavg: 2.00 2.02 1.94 3/177 21999
/proc/meminfo: memFree=27539208/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=36916 CPUtime=0.29 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 8808 0 0 0 28 1 0 0 20 0 1 0 337891053 37801984 8254 33554432000 4194304 8395647 140734341795120 140734341790328 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 9229 8254 589 1026 0 8199 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 36916
[startup+0.700217 s]
/proc/loadavg: 2.00 2.02 1.94 3/177 21999
/proc/meminfo: memFree=27539208/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=40428 CPUtime=0.69 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 9751 0 0 0 68 1 0 0 20 0 1 0 337891053 41398272 9197 33554432000 4194304 8395647 140734341795120 140734341790328 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 10107 9197 591 1026 0 9077 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 40428
[startup+1.50021 s]
/proc/loadavg: 2.00 2.02 1.94 3/178 22000
/proc/meminfo: memFree=27500248/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=45928 CPUtime=1.49 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 15728 0 0 0 140 9 0 0 20 0 1 0 337891053 47030272 10606 33554432000 4194304 8395647 140734341795120 140734341790360 4270539 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 11482 10606 620 1026 0 10452 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 45928
[startup+3.10021 s]
/proc/loadavg: 2.00 2.02 1.94 3/178 22000
/proc/meminfo: memFree=27495660/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=54452 CPUtime=3.09 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 17956 0 0 0 299 10 0 0 20 0 1 0 337891053 55758848 12729 33554432000 4194304 8395647 140734341795120 140734341790408 6197326 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 13613 12729 620 1026 0 12583 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 54452
[startup+6.30022 s]
/proc/loadavg: 2.00 2.02 1.94 3/178 22000
/proc/meminfo: memFree=27486128/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=58248 CPUtime=6.29 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 18874 0 0 0 616 13 0 0 20 0 1 0 337891053 59645952 13647 33554432000 4194304 8395647 140734341795120 140734341790424 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 14562 13647 621 1026 0 13532 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 58248
[startup+12.7002 s]
/proc/loadavg: 2.00 2.02 1.94 3/178 22000
/proc/meminfo: memFree=27485952/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=58248 CPUtime=12.69 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 18878 0 0 0 1253 16 0 0 20 0 1 0 337891053 59645952 13651 33554432000 4194304 8395647 140734341795120 140734341789720 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 14562 13651 625 1026 0 13532 0
Current children cumulated CPU time (s) 12.69
Current children cumulated vsize (KiB) 58248
Solver just ended. Dumping a history of the last processes samples
[startup+14.3068 s]
/proc/loadavg: 2.00 2.02 1.94 3/178 22000
/proc/meminfo: memFree=27485968/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=58248 CPUtime=14.3 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 18878 0 0 0 1413 17 0 0 20 0 1 0 337891053 59645952 13651 33554432000 4194304 8395647 140734341795120 140734341790328 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 14562 13651 625 1026 0 13532 0
Current children cumulated CPU time (s) 14.3
Current children cumulated vsize (KiB) 58248
[startup+15.1002 s]
/proc/loadavg: 2.00 2.02 1.94 3/178 22000
/proc/meminfo: memFree=27485968/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=58248 CPUtime=15.09 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 18878 0 0 0 1492 17 0 0 20 0 1 0 337891053 59645952 13651 33554432000 4194304 8395647 140734341795120 140734341790328 6586871 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 14562 13651 625 1026 0 13532 0
Current children cumulated CPU time (s) 15.09
Current children cumulated vsize (KiB) 58248
[startup+15.5002 s]
/proc/loadavg: 2.00 2.02 1.94 3/178 22000
/proc/meminfo: memFree=27485968/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=58248 CPUtime=15.49 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 18878 0 0 0 1532 17 0 0 20 0 1 0 337891053 59645952 13651 33554432000 4194304 8395647 140734341795120 140734341790728 6587229 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 14562 13651 625 1026 0 13532 0
Current children cumulated CPU time (s) 15.49
Current children cumulated vsize (KiB) 58248
[startup+15.7003 s]
/proc/loadavg: 2.00 2.02 1.94 3/178 22000
/proc/meminfo: memFree=27485968/32873844 swapFree=7108/7108
[pid=21999] ppid=21997 vsize=58248 CPUtime=15.68 cores=1,3,5,7
/proc/21999/stat : 21999 (pbscip.linux.x8) R 21997 21999 21683 0 -1 4202496 18879 0 0 0 1551 17 0 0 20 0 1 0 337891053 59645952 13652 33554432000 4194304 8395647 140734341795120 140734341790728 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21999/statm: 14562 13652 626 1026 0 13532 0
Current children cumulated CPU time (s) 15.68
Current children cumulated vsize (KiB) 58248
Child status: 0
Real time (s): 15.7351
CPU time (s): 15.7326
CPU user time (s): 15.5496
CPU system time (s): 0.182972
CPU usage (%): 99.984
Max. virtual memory (cumulated for all children) (KiB): 63272
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 15.5496
system time used= 0.182972
maximum resident set size= 58996
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 18885
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 3
involuntary context switches= 18
runsolver used 0.043993 second user time and 0.177972 second system time
The end