0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3737670-1338730054.opb>
0.00/0.00 c original problem has 72 variables (72 bin, 0 int, 0 impl, 0 cont) and 103 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 o 0
0.00/0.00 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 92 del conss, 20 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 436 impls, 19 clqs
0.00/0.01 c (round 2) 52 del vars, 92 del conss, 20 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 30 upgd conss, 436 impls, 0 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 52 deleted vars, 92 deleted constraints, 20 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 436 implications, 0 cliques
0.00/0.01 c presolved problem has 20 variables (20 bin, 0 int, 0 impl, 0 cont) and 31 constraints
0.00/0.01 c 20 constraints of type <knapsack>
0.00/0.01 c 10 constraints of type <setppc>
0.00/0.01 c 1 constraints of type <linear>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.0.1.5
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
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 # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
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 -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 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.01 c t 0.0s| 1 | 0 | 35 | - | 342k| 0 | 20 | 20 | 31 | 20 | 31 | 0 | 0 | 0 |-5.000000e+00 | 0.000000e+00 | 100.00%
0.00/0.01 o -1
0.00/0.01 c R 0.0s| 1 | 0 | 35 | - | 343k| 0 | 20 | 20 | 31 | 20 | 31 | 0 | 0 | 0 |-5.000000e+00 |-1.000000e+00 | 80.00%
0.00/0.02 o -3
0.00/0.02 c y 0.0s| 1 | 0 | 35 | - | 367k| 0 | 20 | 20 | 31 | 20 | 31 | 0 | 0 | 0 |-5.000000e+00 |-3.000000e+00 | 40.00%
0.00/0.03 c 0.0s| 1 | 0 | 38 | - | 412k| 0 | 20 | 20 | 86 | 20 | 33 | 2 | 0 | 0 |-5.000000e+00 |-3.000000e+00 | 40.00%
0.00/0.03 c 0.0s| 1 | 0 | 43 | - | 438k| 0 | 20 | 20 | 86 | 20 | 35 | 4 | 0 | 0 |-5.000000e+00 |-3.000000e+00 | 40.00%
0.00/0.03 c 0.0s| 1 | 0 | 54 | - | 469k| 0 | 20 | 20 | 86 | 20 | 40 | 9 | 0 | 0 |-5.000000e+00 |-3.000000e+00 | 40.00%
0.00/0.03 c 0.0s| 1 | 0 | 67 | - | 511k| 0 | 20 | 20 | 86 | 20 | 45 | 14 | 0 | 0 |-4.936670e+00 |-3.000000e+00 | 39.23%
0.00/0.03 c 0.0s| 1 | 0 | 73 | - | 526k| 0 | 20 | 20 | 86 | 20 | 49 | 18 | 0 | 0 |-4.896156e+00 |-3.000000e+00 | 38.73%
0.00/0.04 c 0.0s| 1 | 0 | 84 | - | 539k| 0 | 20 | 20 | 86 | 20 | 52 | 21 | 0 | 0 |-4.870813e+00 |-3.000000e+00 | 38.41%
0.00/0.04 c 0.0s| 1 | 0 | 89 | - | 563k| 0 | 20 | 20 | 86 | 20 | 54 | 23 | 0 | 0 |-4.860057e+00 |-3.000000e+00 | 38.27%
0.00/0.04 c 0.0s| 1 | 0 | 96 | - | 582k| 0 | 20 | 20 | 86 | 20 | 56 | 25 | 0 | 0 |-4.846337e+00 |-3.000000e+00 | 38.10%
0.00/0.05 c 0.0s| 1 | 0 | 124 | - | 602k| 0 | 19 | 20 | 86 | 20 | 60 | 29 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.00/0.05 c 0.0s| 1 | 0 | 137 | - | 635k| 0 | 19 | 20 | 86 | 20 | 65 | 34 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.00/0.05 c 0.1s| 1 | 0 | 141 | - | 657k| 0 | 19 | 20 | 86 | 20 | 65 | 35 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.00/0.05 c 0.1s| 1 | 0 | 152 | - | 688k| 0 | 19 | 20 | 86 | 20 | 67 | 37 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.00/0.06 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.06 c 0.1s| 1 | 0 | 158 | - | 718k| 0 | 19 | 20 | 86 | 20 | 69 | 39 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.00/0.06 c 0.1s| 1 | 0 | 165 | - | 744k| 0 | 19 | 20 | 86 | 20 | 72 | 42 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.00/0.07 c 0.1s| 1 | 0 | 182 | - | 741k| 0 | 18 | 20 | 83 | 20 | 72 | 42 | 0 | 10 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.00/0.07 c 0.1s| 1 | 0 | 191 | - | 810k| 0 | 19 | 20 | 83 | 20 | 75 | 45 | 0 | 10 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.00/0.08 c 0.1s| 1 | 0 | 215 | - | 808k| 0 | 17 | 20 | 82 | 20 | 67 | 45 | 0 | 20 |-4.372300e+00 |-3.000000e+00 | 31.39%
0.00/0.08 c 0.1s| 1 | 0 | 221 | - | 892k| 0 | 16 | 20 | 82 | 20 | 72 | 50 | 0 | 20 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.00/0.08 c 0.1s| 1 | 2 | 221 | - | 893k| 0 | 16 | 20 | 82 | 20 | 72 | 50 | 0 | 20 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.00/0.08 c (run 1, node 1) restarting after 3 global fixings of integer variables
0.00/0.08 c
0.00/0.08 c (restart) converted 3 cuts from the global cut pool into linear constraints
0.00/0.08 c
0.00/0.08 c presolving:
0.00/0.08 c (round 1) 3 del vars, 9 del conss, 0 add conss, 0 chg bounds, 20 chg sides, 14 chg coeffs, 0 upgd conss, 436 impls, 0 clqs
0.00/0.08 c (round 2) 3 del vars, 17 del conss, 0 add conss, 0 chg bounds, 20 chg sides, 14 chg coeffs, 50 upgd conss, 436 impls, 0 clqs
0.00/0.08 c presolving (3 rounds):
0.00/0.08 c 3 deleted vars, 17 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 20 changed sides, 14 changed coefficients
0.00/0.08 c 436 implications, 0 cliques
0.00/0.08 c presolved problem has 17 variables (17 bin, 0 int, 0 impl, 0 cont) and 68 constraints
0.00/0.08 c 20 constraints of type <knapsack>
0.00/0.08 c 8 constraints of type <setppc>
0.00/0.08 c 1 constraints of type <linear>
0.00/0.08 c 39 constraints of type <logicor>
0.00/0.08 c transformed objective value is always integral (scale: 1)
0.00/0.08 c Presolving Time: 0.01
0.00/0.08 c
0.00/0.09 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.09 c 0.1s| 1 | 0 | 245 | - | 358k| 0 | 14 | 17 | 68 | 17 | 29 | 0 | 0 | 20 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.00/0.09 c 0.1s| 1 | 0 | 257 | - | 392k| 0 | 14 | 17 | 68 | 17 | 30 | 2 | 0 | 20 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.00/0.09 c 0.1s| 1 | 0 | 257 | - | 393k| 0 | 14 | 17 | 68 | 17 | 30 | 2 | 0 | 21 |-3.000000e+00 |-3.000000e+00 | 0.00%
0.00/0.09 c
0.00/0.09 c SCIP Status : problem is solved [optimal solution found]
0.00/0.09 c Solving Time (sec) : 0.09
0.00/0.09 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.00/0.09 c Primal Bound : -3.00000000000000e+00 (6 solutions)
0.00/0.09 c Dual Bound : -3.00000000000000e+00
0.00/0.09 c Gap : 0.00 %
0.00/0.09 s OPTIMUM FOUND
0.00/0.09 v -x12 x18 -x14 x15 -x11 -x20 -x13 -x19 -x16 x17 x10 -x9 -x8 -x7 -x6 -x5 -x4 x3 -x2 x1
0.00/0.09 c SCIP Status : problem is solved [optimal solution found]
0.00/0.09 c Total Time : 0.09
0.00/0.09 c solving : 0.09
0.00/0.09 c presolving : 0.01 (included in solving)
0.00/0.09 c reading : 0.00 (included in solving)
0.00/0.09 c Original Problem :
0.00/0.09 c Problem name : HOME/instance-3737670-1338730054.opb
0.00/0.09 c Variables : 72 (72 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.09 c Constraints : 103 initial, 103 maximal
0.00/0.09 c Presolved Problem :
0.00/0.09 c Problem name : t_HOME/instance-3737670-1338730054.opb
0.00/0.09 c Variables : 17 (17 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.09 c Constraints : 68 initial, 68 maximal
0.00/0.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.09 c trivial : 0.00 3 0 0 0 0 0 0 0 0
0.00/0.09 c dualfix : 0.00 52 0 0 0 0 0 0 0 0
0.00/0.09 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.09 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.09 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.09 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.09 c knapsack : 0.00 0 0 0 0 0 3 0 14 14
0.00/0.09 c setppc : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.09 c linear : 0.00 0 0 0 0 0 6 0 6 0
0.00/0.09 c logicor : 0.00 0 0 0 0 0 8 0 0 0
0.00/0.09 c pseudoboolean : 0.00 0 0 0 0 0 92 20 0 0
0.00/0.09 c root node : - 4 - - 4 - - - - -
0.00/0.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.09 c integral : 0 0 0 4 0 12 0 1 3 0 0 2
0.00/0.09 c knapsack : 20 17 45 0 0 6 0 0 0 24 0 0
0.00/0.09 c setppc : 8 17 45 0 0 5 0 0 0 0 0 0
0.00/0.09 c linear : 1 18 46 0 0 5 0 0 0 0 0 0
0.00/0.09 c logicor : 39 1 1 0 0 0 0 0 0 0 0 0
0.00/0.09 c countsols : 0 0 0 0 0 9 0 0 0 0 0 0
0.00/0.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.09 c integral : 0.01 0.00 0.00 0.01 0.00 0.00 0.00
0.00/0.09 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.09 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.09 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.09 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.09 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.09 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.09 c vbounds : 0 0 0 0
0.00/0.09 c rootredcost : 0 0 0 0
0.00/0.09 c pseudoobj : 15 0 0 0
0.00/0.09 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.09 c vbounds : 0.00 0.00 0.00
0.00/0.09 c rootredcost : 0.00 0.00 0.00
0.00/0.09 c pseudoobj : 0.00 0.00 0.00
0.00/0.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.09 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.09 c applied globally : - - - 0 0.0 - - -
0.00/0.09 c applied locally : - - - 0 0.0 - - -
0.00/0.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 44)
0.00/0.09 c redcost : 0.00 17 0 1 0 0
0.00/0.09 c impliedbounds : 0.00 17 0 0 0 0
0.00/0.09 c intobj : 0.00 0 0 0 0 0
0.00/0.09 c gomory : 0.01 17 0 0 90 0
0.00/0.09 c cgmip : 0.00 0 0 0 0 0
0.00/0.09 c closecuts : 0.00 0 0 0 0 0
0.00/0.09 c strongcg : 0.01 17 0 0 466 0
0.00/0.09 c cmir : 0.00 11 0 0 41 0
0.00/0.09 c flowcover : 0.01 11 0 0 52 0
0.00/0.09 c clique : 0.00 2 0 0 0 0
0.00/0.09 c zerohalf : 0.00 0 0 0 0 0
0.00/0.09 c mcf : 0.00 2 0 0 0 0
0.00/0.09 c oddcycle : 0.00 0 0 0 0 0
0.00/0.09 c rapidlearning : 0.02 1 0 0 0 55
0.00/0.09 c Pricers : Time Calls Vars
0.00/0.09 c problem variables: 0.00 0 0
0.00/0.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.09 c relpscost : 0.01 4 1 3 0 0 2
0.00/0.09 c pscost : 0.00 0 0 0 0 0 0
0.00/0.09 c inference : 0.00 0 0 0 0 0 0
0.00/0.09 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.09 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.09 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.09 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.09 c random : 0.00 0 0 0 0 0 0
0.00/0.09 c Primal Heuristics : Time Calls Found
0.00/0.09 c LP solutions : 0.00 - 0
0.00/0.09 c pseudo solutions : 0.00 - 0
0.00/0.09 c oneopt : 0.00 1 0
0.00/0.09 c trivial : 0.00 2 1
0.00/0.09 c shiftandpropagate: 0.00 0 0
0.00/0.09 c simplerounding : 0.00 0 0
0.00/0.09 c zirounding : 0.00 0 0
0.00/0.09 c rounding : 0.00 21 1
0.00/0.09 c shifting : 0.00 21 3
0.00/0.09 c intshifting : 0.00 0 0
0.00/0.09 c twoopt : 0.00 0 0
0.00/0.09 c fixandinfer : 0.00 0 0
0.00/0.09 c feaspump : 0.00 0 0
0.00/0.09 c clique : 0.00 0 0
0.00/0.09 c coefdiving : 0.00 0 0
0.00/0.09 c pscostdiving : 0.00 0 0
0.00/0.09 c fracdiving : 0.00 0 0
0.00/0.09 c veclendiving : 0.00 0 0
0.00/0.09 c intdiving : 0.00 0 0
0.00/0.09 c actconsdiving : 0.00 0 0
0.00/0.09 c objpscostdiving : 0.00 0 0
0.00/0.09 c rootsoldiving : 0.00 0 0
0.00/0.09 c linesearchdiving : 0.00 0 0
0.00/0.09 c guideddiving : 0.00 0 0
0.00/0.09 c octane : 0.00 0 0
0.00/0.09 c rens : 0.01 0 0
0.00/0.09 c rins : 0.00 0 0
0.00/0.09 c localbranching : 0.00 0 0
0.00/0.09 c mutation : 0.00 0 0
0.00/0.09 c crossover : 0.00 0 0
0.00/0.09 c dins : 0.00 0 0
0.00/0.09 c vbounds : 0.00 0 0
0.00/0.09 c undercover : 0.00 0 0
0.00/0.09 c subnlp : 0.00 0 0
0.00/0.09 c trysol : 0.00 0 0
0.00/0.09 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.09 c primal LP : 0.00 0 0 0.00 -
0.00/0.09 c dual LP : 0.00 21 257 12.24 -
0.00/0.09 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.09 c barrier LP : 0.00 0 0 0.00 -
0.00/0.09 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.09 c strong branching : 0.01 21 757 36.05 62253.29
0.00/0.09 c (at root node) : - 21 757 36.05 -
0.00/0.09 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.09 c B&B Tree :
0.00/0.09 c number of runs : 2
0.00/0.09 c nodes : 1
0.00/0.09 c nodes (total) : 2
0.00/0.09 c nodes left : 0
0.00/0.09 c max depth : 0
0.00/0.09 c max depth (total): 0
0.00/0.09 c backtracks : 0 (0.0%)
0.00/0.09 c delayed cutoffs : 0
0.00/0.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.09 c avg switch length: 2.00
0.00/0.09 c switching time : 0.00
0.00/0.09 c Solution :
0.00/0.09 c Solutions found : 6 (3 improvements)
0.00/0.09 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.09 c Primal Bound : -3.00000000000000e+00 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <trysol>)
0.00/0.09 c Dual Bound : -3.00000000000000e+00
0.00/0.09 c Gap : 0.00 %
0.00/0.09 c Root Dual Bound : -3.00000000000000e+00
0.00/0.09 c Root Iterations : 257
0.00/0.09 c Time complete: 0.09.
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-3737670-1338730054/watcher-3737670-1338730054 -o /tmp/evaluation-result-3737670-1338730054/solver-3737670-1338730054 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3737670-1338730054.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.00 2.00 3/176 15922
/proc/meminfo: memFree=27195360/32873648 swapFree=6860/6860
[pid=15922] ppid=15920 vsize=9588 CPUtime=0 cores=1,3,5,7
/proc/15922/stat : 15922 (scip-2.0.1.4b_2) R 15920 15922 13307 0 -1 4202496 1522 0 0 0 0 0 0 0 20 0 1 0 339131499 9818112 1477 33554432000 4194304 9016284 140736822782016 140736996944184 7824814 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/15922/statm: 2397 1477 311 1178 0 1215 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.097278
CPU time (s): 0.094985
CPU user time (s): 0.082987
CPU system time (s): 0.011998
CPU usage (%): 97.6429
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.082987
system time used= 0.011998
maximum resident set size= 23496
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6668
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.000999 second user time and 0.006998 second system time
The end