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: a3bf3a4-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-3717500-1338186118.wbo>
0.00/0.00 c original problem has 431 variables (431 bin, 0 int, 0 impl, 0 cont) and 42 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 13 clqs
0.00/0.01 c (round 2) 0 del vars, 1 del conss, 0 add conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 13 clqs
0.00/0.01 c (round 3) 0 del vars, 1 del conss, 0 add conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 0 impls, 13 clqs
0.00/0.01 c (round 4) 0 del vars, 1 del conss, 0 add conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 30 upgd conss, 0 impls, 13 clqs
0.00/0.01 c (0.0s) probing: 51/431 (11.8%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.01 c presolving (5 rounds):
0.00/0.01 c 0 deleted vars, 1 deleted constraints, 0 added constraints, 11 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 11 implications, 13 cliques
0.00/0.01 c presolved problem has 442 variables (431 bin, 0 int, 11 impl, 0 cont) and 52 constraints
0.00/0.01 c 13 constraints of type <setppc>
0.00/0.01 c 11 constraints of type <linear>
0.00/0.01 c 11 constraints of type <indicator>
0.00/0.01 c 17 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.1.1.4
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1797
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # force restart if we have a max FS instance and gap is 1?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/forcerestart = TRUE
0.00/0.01 c
0.00/0.01 c # priority of branching rule <inference>
0.00/0.01 c # [type: int, range: [-536870912,536870911], default: 1000]
0.00/0.01 c branching/inference/priority = 1000000
0.00/0.01 c
0.00/0.01 c # frequency offset for calling primal heuristic <coefdiving>
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1]
0.00/0.01 c heuristics/coefdiving/freqofs = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/shiftandpropagate/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/undercover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <indrounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c heuristics/indrounding/freq = 1
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.02 o 1
0.00/0.02 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.02 c * 0.0s| 1 | 0 | 336 | - |1255k| 0 | - | 442 | 52 | 442 | 52 | 0 | 0 | 0 | 1.000000e+00 | 1.000000e+00 | 0.00%
0.00/0.02 c 0.0s| 1 | 0 | 336 | - |1255k| 0 | - | 442 | 52 | 442 | 52 | 0 | 0 | 0 | 1.000000e+00 | 1.000000e+00 | 0.00%
0.00/0.02 c
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Solving Time (sec) : 0.02
0.00/0.02 c Solving Nodes : 1
0.00/0.02 c Primal Bound : +1.00000000000000e+00 (1 solutions)
0.00/0.02 c Dual Bound : +1.00000000000000e+00
0.00/0.02 c Gap : 0.00 %
0.00/0.02 s OPTIMUM FOUND
0.00/0.02 v -x420 -x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 x406 -x405 -x404 -x403 -x402 -x401 -x400 -x399
0.00/0.02 v x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x382 -x381 -x380 -x379 -x378
0.00/0.02 v -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 -x366 -x365 x364 -x363 -x362 -x361 -x360 -x359 -x358 -x357
0.00/0.02 v -x356 -x355 -x354 -x353 -x352 -x351 -x350 x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 x337 -x336
0.00/0.02 v -x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319 -x318 -x317 -x316 x315
0.00/0.02 v -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294
0.00/0.02 v -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273
0.00/0.02 v -x272 -x271 -x270 -x269 -x268 x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252
0.00/0.02 v -x251 -x250 -x249 x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233 -x232 -x231
0.00/0.02 v -x230 -x229 -x228 -x227 -x226 -x225 -x224 x223 -x222 -x221 -x220 -x219 -x218 -x217 x216 -x215 -x214 -x213 -x212 -x211 -x210
0.00/0.02 v -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189
0.00/0.02 v -x188 -x187 -x186 -x185 -x184 -x183 -x182 x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168
0.00/0.02 v -x167 -x166 x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 x150 -x149 -x148 -x147
0.00/0.02 v -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 x131 -x130 -x129 -x128 -x127 -x126
0.00/0.02 v -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105
0.00/0.02 v -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81
0.00/0.02 v -x80 -x79 -x78 -x77 -x76 -x75 x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 x59 -x58 -x57 -x56
0.00/0.02 v -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31
0.00/0.02 v -x30 -x29 -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
0.00/0.02 v -x3 -x2 -x1
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Total Time : 0.02
0.00/0.02 c solving : 0.02
0.00/0.02 c presolving : 0.01 (included in solving)
0.00/0.02 c reading : 0.00 (included in solving)
0.00/0.02 c copying : 0.00 (0 times copied the problem)
0.00/0.02 c Original Problem :
0.00/0.02 c Problem name : HOME/instance-3717500-1338186118.wbo
0.00/0.02 c Variables : 431 (431 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 42 initial, 42 maximal
0.00/0.02 c Objective sense : minimize
0.00/0.02 c Presolved Problem :
0.00/0.02 c Problem name : t_HOME/instance-3717500-1338186118.wbo
0.00/0.02 c Variables : 442 (431 binary, 0 integer, 11 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 52 initial, 52 maximal
0.00/0.02 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.02 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c setppc : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c linear : 0.00 0.00 0 0 0 11 0 1 0 0 0
0.00/0.02 c indicator : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c root node : - - 0 - - 0 - - - - -
0.00/0.02 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.00/0.02 c integral : 0 0 0 0 0 0 88 0 0 0 0 0 0
0.00/0.02 c setppc : 13 13 0 100 0 0 86 0 0 0 0 0 0
0.00/0.02 c linear : 11 11 0 100 0 0 84 0 0 0 0 0 0
0.00/0.02 c indicator : 11 11 0 100 0 0 82 0 0 0 0 0 0
0.00/0.02 c logicor : 17 17 0 35 0 0 82 0 0 0 0 0 0
0.00/0.02 c countsols : 0 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.02 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.00/0.02 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c indicator : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.02 c rootredcost : 0 0 0 0
0.00/0.02 c pseudoobj : 1 0 0 0
0.00/0.02 c vbounds : 1 0 0 0
0.00/0.02 c redcost : 0 0 0 0
0.00/0.02 c probing : 0 0 0 0
0.00/0.02 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.00/0.02 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c redcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c probing : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c applied globally : - - - 0 0.0 - - -
0.00/0.02 c applied locally : - - - 0 0.0 - - -
0.00/0.02 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.00/0.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 11)
0.00/0.02 c clique : 0.00 0.00 0 0 0 0 0
0.00/0.02 c closecuts : 0.00 0.00 0 0 0 0 0
0.00/0.02 c cgmip : 0.00 0.00 0 0 0 0 0
0.00/0.02 c cmir : 0.00 0.00 0 0 0 0 0
0.00/0.02 c flowcover : 0.00 0.00 0 0 0 0 0
0.00/0.02 c gomory : 0.00 0.00 0 0 0 0 0
0.00/0.02 c impliedbounds : 0.00 0.00 0 0 0 0 0
0.00/0.02 c intobj : 0.00 0.00 0 0 0 0 0
0.00/0.02 c mcf : 0.00 0.00 0 0 0 0 0
0.00/0.02 c oddcycle : 0.00 0.00 0 0 0 0 0
0.00/0.02 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.00/0.02 c strongcg : 0.00 0.00 0 0 0 0 0
0.00/0.02 c zerohalf : 0.00 0.00 0 0 0 0 0
0.00/0.02 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.02 c problem variables: 0.00 - 0 0
0.00/0.02 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.00/0.02 c pscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c inference : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c random : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c Primal Heuristics : ExecTime SetupTime Calls Found
0.00/0.02 c LP solutions : 0.00 - - 0
0.00/0.02 c pseudo solutions : 0.00 - - 0
0.00/0.02 c oneopt : 0.00 0.00 0 0
0.00/0.02 c smallcard : 0.00 0.00 0 0
0.00/0.02 c trivial : 0.00 0.00 2 0
0.00/0.02 c shiftandpropagate: 0.00 0.00 0 0
0.00/0.02 c simplerounding : 0.00 0.00 0 0
0.00/0.02 c zirounding : 0.00 0.00 0 0
0.00/0.02 c rounding : 0.00 0.00 0 0
0.00/0.02 c shifting : 0.00 0.00 0 0
0.00/0.02 c intshifting : 0.00 0.00 0 0
0.00/0.02 c twoopt : 0.00 0.00 0 0
0.00/0.02 c indtwoopt : 0.00 0.00 0 0
0.00/0.02 c indoneopt : 0.00 0.00 1 0
0.00/0.02 c fixandinfer : 0.00 0.00 0 0
0.00/0.02 c feaspump : 0.00 0.00 0 0
0.00/0.02 c clique : 0.00 0.00 0 0
0.00/0.02 c indrounding : 0.00 0.00 0 0
0.00/0.02 c indcoefdiving : 0.00 0.00 0 0
0.00/0.02 c coefdiving : 0.00 0.00 0 0
0.00/0.02 c pscostdiving : 0.00 0.00 0 0
0.00/0.02 c nlpdiving : 0.00 0.00 0 0
0.00/0.02 c fracdiving : 0.00 0.00 0 0
0.00/0.02 c veclendiving : 0.00 0.00 0 0
0.00/0.02 c intdiving : 0.00 0.00 0 0
0.00/0.02 c actconsdiving : 0.00 0.00 0 0
0.00/0.02 c objpscostdiving : 0.00 0.00 0 0
0.00/0.02 c rootsoldiving : 0.00 0.00 0 0
0.00/0.02 c linesearchdiving : 0.00 0.00 0 0
0.00/0.02 c guideddiving : 0.00 0.00 0 0
0.00/0.02 c octane : 0.00 0.00 0 0
0.00/0.02 c rens : 0.00 0.00 0 0
0.00/0.02 c rins : 0.00 0.00 0 0
0.00/0.02 c localbranching : 0.00 0.00 0 0
0.00/0.02 c mutation : 0.00 0.00 0 0
0.00/0.02 c crossover : 0.00 0.00 0 0
0.00/0.02 c dins : 0.00 0.00 0 0
0.00/0.02 c vbounds : 0.00 0.00 0 0
0.00/0.02 c undercover : 0.00 0.00 0 0
0.00/0.02 c subnlp : 0.00 0.00 0 0
0.00/0.02 c trysol : 0.00 0.00 0 0
0.00/0.02 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.00/0.02 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.02 c dual LP : 0.00 1 336 336.00 - 0.00 0
0.00/0.02 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.02 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.02 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.02 c strong branching : 0.00 0 0 0.00 -
0.00/0.02 c (at root node) : - 0 0 0.00 -
0.00/0.02 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.02 c B&B Tree :
0.00/0.02 c number of runs : 1
0.00/0.02 c nodes : 1
0.00/0.02 c nodes (total) : 1
0.00/0.02 c nodes left : 0
0.00/0.02 c max depth : 0
0.00/0.02 c max depth (total): 0
0.00/0.02 c backtracks : 0 (0.0%)
0.00/0.02 c delayed cutoffs : 0
0.00/0.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.02 c avg switch length: 2.00
0.00/0.02 c switching time : 0.00
0.00/0.02 c Solution :
0.00/0.02 c Solutions found : 1 (1 improvements)
0.00/0.02 c First Solution : +1.00000000000000e+00 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <relaxation>)
0.00/0.02 c Primal Bound : +1.00000000000000e+00 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <relaxation>)
0.00/0.02 c Dual Bound : +1.00000000000000e+00
0.00/0.02 c Gap : 0.00 %
0.00/0.02 c Root Dual Bound : +1.00000000000000e+00
0.00/0.02 c Root Iterations : 336
0.00/0.03 c Time complete: 0.01.
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-3717500-1338186118/watcher-3717500-1338186118 -o /tmp/evaluation-result-3717500-1338186118/solver-3717500-1338186118 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4fix.linux.x86_64.gnu.opt.spx -f HOME/instance-3717500-1338186118.wbo -t 1800 -m 15500
running on 4 cores: 0,2,4,6
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: 1.31 1.58 1.82 3/176 11717
/proc/meminfo: memFree=31245188/32873844 swapFree=7112/7112
[pid=11717] ppid=11715 vsize=12880 CPUtime=0 cores=0,2,4,6
/proc/11717/stat : 11717 (scip-2.1.1.4fix) R 11715 11717 10153 0 -1 4202496 1948 0 0 0 0 0 0 0 20 0 1 0 284736664 13189120 1903 33554432000 4194304 10173063 140733990437344 140734405956712 4941840 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/11717/statm: 3220 1903 471 1460 0 1751 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0307831
CPU time (s): 0.028994
CPU user time (s): 0.019996
CPU system time (s): 0.008998
CPU usage (%): 94.188
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.019996
system time used= 0.008998
maximum resident set size= 15660
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4233
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= 1
runsolver used 0.001999 second user time and 0.004999 second system time
The end