Trace number 2702890

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverSAT 5.61215 5.61335

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_50_25_1_5.opb
MD5SUMd6d85d35b0f961666d5965433f22c8bb
Bench CategoryDEC-SMALLINT-NLC (no optimisation, small integers, non linear constraints)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0.379942
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables100
Total number of constraints152
Number of constraints which are clauses50
Number of constraints which are cardinality constraints (but not clauses)1
Number of constraints which are nor clauses,nor cardinality constraints101
Minimum length of a constraint2
Maximum length of a constraint100
Number of terms in the objective function 0
Biggest coefficient in the objective function 0
Number of bits for the biggest coefficient in the objective function 0
Sum of the numbers in the objective function 0
Number of bits of the sum of numbers in the objective function 0
Biggest number in a constraint 5
Number of bits of the biggest number in a constraint 3
Biggest sum of numbers in a constraint 100
Number of bits of the biggest sum of numbers7
Number of products (including duplicates)2996
Sum of products size (including duplicates)5992
Number of different products1498
Sum of products size2996

Solver Data 

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-2702890-1278576185.opb>
0.00/0.02	c original problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1650 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.03/0.04	c presolving:
0.10/0.11	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 12084 impls, 100 clqs
0.10/0.17	c presolving (2 rounds):
0.10/0.17	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.10/0.17	c  12084 implications, 100 cliques
0.10/0.17	c presolved problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1650 constraints
0.10/0.17	c       1 constraints of type <knapsack>
0.10/0.17	c     150 constraints of type <setppc>
0.10/0.17	c    1498 constraints of type <and>
0.10/0.17	c       1 constraints of type <linear>
0.10/0.17	c transformed objective value is always integral (scale: 1)
0.10/0.17	c Presolving Time: 0.13
0.10/0.17	c - non default parameters ----------------------------------------------------------------------
0.10/0.17	c # SCIP version 1.2.1.3
0.10/0.17	c 
0.10/0.17	c # frequency for displaying node information lines
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 100]
0.10/0.17	c display/freq = 10000
0.10/0.17	c 
0.10/0.17	c # maximal time in seconds to run
0.10/0.17	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.17	c limits/time = 1789.98
0.10/0.17	c 
0.10/0.17	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.10/0.17	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.17	c limits/memory = 1620
0.10/0.17	c 
0.10/0.17	c # solving stops, if the given number of solutions were found (-1: no limit)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.17	c limits/solutions = 1
0.10/0.17	c 
0.10/0.17	c # maximal number of separation rounds per node (-1: unlimited)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 5]
0.10/0.17	c separating/maxrounds = 1
0.10/0.17	c 
0.10/0.17	c # maximal number of separation rounds in the root node (-1: unlimited)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.17	c separating/maxroundsroot = 5
0.10/0.17	c 
0.10/0.17	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.10/0.17	c # [type: int, range: [1,2], default: 1]
0.10/0.17	c timing/clocktype = 2
0.10/0.17	c 
0.10/0.17	c # should presolving try to simplify inequalities
0.10/0.17	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.17	c constraints/linear/simplifyinequalities = TRUE
0.10/0.17	c 
0.10/0.17	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.10/0.17	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.17	c constraints/indicator/addCouplingCons = TRUE
0.10/0.17	c 
0.10/0.17	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.10/0.17	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.10/0.17	c constraints/knapsack/disaggregation = FALSE
0.10/0.17	c 
0.10/0.17	c # should presolving try to simplify knapsacks
0.10/0.17	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.17	c constraints/knapsack/simplifyinequalities = TRUE
0.10/0.17	c 
0.10/0.17	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.17	c presolving/probing/maxrounds = 0
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.17	c heuristics/coefdiving/freq = -1
0.10/0.17	c 
0.10/0.17	c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.17	c heuristics/coefdiving/maxlpiterquot = 0.075
0.10/0.17	c 
0.10/0.17	c # additional number of allowed LP iterations
0.10/0.17	c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.17	c heuristics/coefdiving/maxlpiterofs = 1500
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 30]
0.10/0.17	c heuristics/crossover/freq = -1
0.10/0.17	c 
0.10/0.17	c # number of nodes added to the contingent of the total nodes
0.10/0.17	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.17	c heuristics/crossover/nodesofs = 750
0.10/0.17	c 
0.10/0.17	c # number of nodes without incumbent change that heuristic should wait
0.10/0.17	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.10/0.17	c heuristics/crossover/nwaitingnodes = 100
0.10/0.17	c 
0.10/0.17	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.10/0.17	c # [type: real, range: [0,1], default: 0.1]
0.10/0.17	c heuristics/crossover/nodesquot = 0.15
0.10/0.17	c 
0.10/0.17	c # minimum percentage of integer variables that have to be fixed 
0.10/0.17	c # [type: real, range: [0,1], default: 0.666]
0.10/0.17	c heuristics/crossover/minfixingrate = 0.5
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.17	c heuristics/feaspump/freq = -1
0.10/0.17	c 
0.10/0.17	c # additional number of allowed LP iterations
0.10/0.17	c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.17	c heuristics/feaspump/maxlpiterofs = 2000
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.17	c heuristics/fracdiving/freq = -1
0.10/0.17	c 
0.10/0.17	c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.17	c heuristics/fracdiving/maxlpiterquot = 0.075
0.10/0.17	c 
0.10/0.17	c # additional number of allowed LP iterations
0.10/0.17	c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.17	c heuristics/fracdiving/maxlpiterofs = 1500
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.17	c heuristics/guideddiving/freq = -1
0.10/0.17	c 
0.10/0.17	c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.17	c heuristics/guideddiving/maxlpiterquot = 0.075
0.10/0.17	c 
0.10/0.17	c # additional number of allowed LP iterations
0.10/0.17	c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.17	c heuristics/guideddiving/maxlpiterofs = 1500
0.10/0.17	c 
0.10/0.17	c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.17	c heuristics/intdiving/maxlpiterquot = 0.075
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.17	c heuristics/intshifting/freq = -1
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.17	c heuristics/linesearchdiving/freq = -1
0.10/0.17	c 
0.10/0.17	c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.17	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.10/0.17	c 
0.10/0.17	c # additional number of allowed LP iterations
0.10/0.17	c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.17	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.17	c heuristics/nlp/freq = -1
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.17	c heuristics/objpscostdiving/freq = -1
0.10/0.17	c 
0.10/0.17	c # maximal fraction of diving LP iterations compared to total iteration number
0.10/0.17	c # [type: real, range: [0,1], default: 0.01]
0.10/0.17	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.10/0.17	c 
0.10/0.17	c # additional number of allowed LP iterations
0.10/0.17	c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.17	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.17	c heuristics/oneopt/freq = -1
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.17	c heuristics/pscostdiving/freq = -1
0.10/0.17	c 
0.10/0.17	c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.17	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.10/0.17	c 
0.10/0.17	c # additional number of allowed LP iterations
0.10/0.17	c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.17	c heuristics/pscostdiving/maxlpiterofs = 1500
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.17	c heuristics/rens/freq = -1
0.10/0.17	c 
0.10/0.17	c # minimum percentage of integer variables that have to be fixable 
0.10/0.17	c # [type: real, range: [0,1], default: 0.5]
0.10/0.17	c heuristics/rens/minfixingrate = 0.3
0.10/0.17	c 
0.10/0.17	c # number of nodes added to the contingent of the total nodes
0.10/0.17	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.17	c heuristics/rens/nodesofs = 2000
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.17	c heuristics/rootsoldiving/freq = -1
0.10/0.17	c 
0.10/0.17	c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.10/0.17	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.10/0.17	c 
0.10/0.17	c # additional number of allowed LP iterations
0.10/0.17	c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.17	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.17	c heuristics/rounding/freq = -1
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.17	c heuristics/shifting/freq = -1
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.17	c heuristics/simplerounding/freq = -1
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.17	c heuristics/trivial/freq = -1
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.17	c heuristics/trysol/freq = -1
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.17	c heuristics/veclendiving/freq = -1
0.10/0.17	c 
0.10/0.17	c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.17	c heuristics/veclendiving/maxlpiterquot = 0.075
0.10/0.17	c 
0.10/0.17	c # additional number of allowed LP iterations
0.10/0.17	c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.17	c heuristics/veclendiving/maxlpiterofs = 1500
0.10/0.17	c 
0.10/0.17	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.17	c heuristics/zirounding/freq = -1
0.10/0.17	c 
0.10/0.17	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.17	c separating/cmir/freq = -1
0.10/0.17	c 
0.10/0.17	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.17	c separating/flowcover/freq = -1
0.10/0.17	c 
0.10/0.17	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.10/0.17	c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.17	c separating/rapidlearning/freq = 0
0.10/0.17	c 
0.10/0.17	c -----------------------------------------------------------------------------------------------
0.10/0.17	c start solving
0.10/0.17	c 
0.19/0.20	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.20	c   0.2s|     1 |     0 |    49 |     - |7275k|   0 |  42 |1598 |1650 |1598 |3148 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.89/0.94	c   0.9s|     1 |     0 |    96 |     - |7543k|   0 |  61 |1598 |1704 |1598 |3157 |   9 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.29/1.32	c   1.3s|     1 |     0 |   163 |     - |7575k|   0 |  66 |1598 |1704 |1598 |3161 |  13 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.79/1.81	c   1.8s|     1 |     0 |   210 |     - |7659k|   0 |  78 |1598 |1704 |1598 |3166 |  18 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
2.29/2.36	c   2.3s|     1 |     0 |   224 |     - |7710k|   0 |  80 |1598 |1704 |1598 |3170 |  22 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
2.89/2.92	c   2.9s|     1 |     0 |   232 |     - |7714k|   0 |  80 |1598 |1704 |1598 |3172 |  24 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
4.89/4.90	c   4.9s|     1 |     2 |   232 |     - |7714k|   0 |  80 |1598 |1704 |1598 |3172 |  24 |   0 |   9 | 0.000000e+00 |      --      |    Inf 
5.50/5.58	c * 5.6s|    12 |     0 |   933 |  63.7 |8247k|  10 |   - |1598 |1705 |1598 | 303 | 224 |   1 | 131 | 0.000000e+00 | 0.000000e+00 |   0.00%
5.50/5.58	c 
5.50/5.58	c SCIP Status        : problem is solved [optimal solution found]
5.50/5.58	c Solving Time (sec) : 5.56
5.50/5.58	c Solving Nodes      : 12
5.50/5.58	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
5.50/5.58	c Dual Bound         : +0.00000000000000e+00
5.50/5.58	c Gap                : 0.00 %
5.50/5.58	s SATISFIABLE
5.50/5.58	v x95 x89 x79 -x96 -x52 -x98 -x58 -x55 -x54 -x71 -x75 -x99 -x88 -x85 -x57 -x51 -x97 -x92 -x90 -x82 -x76 -x67 -x65 -x61 -x56 -x70 
5.50/5.58	v -x59 -x53 -x74 -x81 -x83 -x80 -x68 -x69 -x62 -x73 -x77 -x64 -x60 -x91 -x63 -x72 x100 x93 -x86 -x94 -x66 -x78 -x87 -x84 -x50 -x49 
5.50/5.58	v -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 x32 -x31 x30 -x29 x28 -x27 x26 -x25 -x24 
5.50/5.58	v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 -x1 
5.50/5.58	c SCIP Status        : problem is solved [optimal solution found]
5.50/5.58	c Solving Time       :       5.56
5.50/5.58	c Original Problem   :
5.50/5.58	c   Problem name     : HOME/instance-2702890-1278576185.opb
5.50/5.58	c   Variables        : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
5.50/5.58	c   Constraints      : 1650 initial, 1650 maximal
5.50/5.58	c Presolved Problem  :
5.50/5.58	c   Problem name     : t_HOME/instance-2702890-1278576185.opb
5.50/5.58	c   Variables        : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
5.50/5.58	c   Constraints      : 1650 initial, 1705 maximal
5.50/5.58	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
5.50/5.58	c   trivial          :       0.00          0          0          0          0          0          0          0          0
5.50/5.58	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
5.50/5.58	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
5.50/5.58	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
5.50/5.58	c   implics          :       0.00          0          0          0          0          0          0          0          0
5.50/5.58	c   probing          :       0.00          0          0          0          0          0          0          0          0
5.50/5.58	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
5.50/5.58	c   setppc           :       0.00          0          0          0          0          0          0          0          0
5.50/5.58	c   and              :       0.11          0          0          0          0          0          0          0          0
5.50/5.58	c   linear           :       0.01          0          0          0          0          0          0          0          0
5.50/5.58	c   logicor          :       0.00          0          0          0          0          0          0          0          0
5.50/5.58	c   root node        :          -          0          -          -          0          -          -          -          -
5.50/5.58	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
5.50/5.58	c   integral         :          0          0          0         19          0          0          6          0          0         20
5.50/5.58	c   knapsack         :          1          5         41          4          0          0          0          0          0          0
5.50/5.58	c   setppc           :        150          5         41          4          0          0        122          0          0          0
5.50/5.58	c   and              :       1498         15         41          4          0          1       1611        201          0          0
5.50/5.58	c   linear           :          1+         6         40          1          0          0          0          0          0          0
5.50/5.58	c   logicor          :          0+         0          1          0          0          0          1          0          0          0
5.50/5.58	c   countsols        :          0          0          0          1          0          0          0          0          0          0
5.50/5.58	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
5.50/5.58	c   integral         :       2.53       0.00       0.00       2.53       0.00
5.50/5.58	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
5.50/5.58	c   setppc           :       0.00       0.00       0.00       0.00       0.00
5.50/5.58	c   and              :       0.02       0.01       0.01       0.00       0.00
5.50/5.58	c   linear           :       0.00       0.00       0.00       0.00       0.00
5.50/5.58	c   logicor          :       0.00       0.00       0.00       0.00       0.00
5.50/5.58	c   countsols        :       0.00       0.00       0.00       0.00       0.00
5.50/5.58	c Propagators        :       Time      Calls    Cutoffs    DomReds
5.50/5.58	c   vbounds          :       0.00          1          0          0
5.50/5.58	c   rootredcost      :       0.00          0          0          0
5.50/5.58	c   pseudoobj        :       0.00          0          0          0
5.50/5.58	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
5.50/5.58	c   propagation      :       0.00          1          1          1        2.0          0        0.0          -
5.50/5.58	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
5.50/5.58	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
5.50/5.58	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
5.50/5.58	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
5.50/5.58	c   applied globally :          -          -          -          1        2.0          -          -          -
5.50/5.58	c   applied locally  :          -          -          -          0        0.0          -          -          -
5.50/5.58	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
5.50/5.58	c   cut pool         :       0.00          4          -          -         11          -    (maximal pool size: 91)
5.50/5.58	c   redcost          :       0.00         15          0          0          0          0
5.50/5.58	c   impliedbounds    :       0.00          5          0          0          2          0
5.50/5.58	c   intobj           :       0.00          0          0          0          0          0
5.50/5.58	c   cgmip            :       0.00          0          0          0          0          0
5.50/5.58	c   gomory           :       1.17          5          0          0        261          0
5.50/5.58	c   strongcg         :       0.94          5          0          0        851          0
5.50/5.58	c   cmir             :       0.00          0          0          0          0          0
5.50/5.58	c   flowcover        :       0.00          0          0          0          0          0
5.50/5.58	c   clique           :       0.01          5          0          0         14          0
5.50/5.58	c   zerohalf         :       0.00          0          0          0          0          0
5.50/5.58	c   mcf              :       0.03          2          0          0          0          0
5.50/5.58	c   rapidlearning    :       0.48          1          0          0          0         54
5.50/5.58	c Pricers            :       Time      Calls       Vars
5.50/5.58	c   problem variables:       0.00          0          0
5.50/5.58	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
5.50/5.58	c   relpscost        :       2.53         15          0          6          0          0         20
5.50/5.58	c   pscost           :       0.00          0          0          0          0          0          0
5.50/5.58	c   inference        :       0.00          0          0          0          0          0          0
5.50/5.58	c   mostinf          :       0.00          0          0          0          0          0          0
5.50/5.58	c   leastinf         :       0.00          0          0          0          0          0          0
5.50/5.58	c   fullstrong       :       0.00          0          0          0          0          0          0
5.50/5.58	c   allfullstrong    :       0.00          0          0          0          0          0          0
5.50/5.58	c   random           :       0.00          0          0          0          0          0          0
5.50/5.58	c Primal Heuristics  :       Time      Calls      Found
5.50/5.58	c   LP solutions     :       0.00          -          1
5.50/5.58	c   pseudo solutions :       0.00          -          0
5.50/5.58	c   trivial          :       0.00          1          0
5.50/5.58	c   simplerounding   :       0.00          0          0
5.50/5.58	c   zirounding       :       0.00          0          0
5.50/5.58	c   rounding         :       0.00          0          0
5.50/5.58	c   shifting         :       0.00          0          0
5.50/5.58	c   intshifting      :       0.00          0          0
5.50/5.58	c   oneopt           :       0.00          0          0
5.50/5.58	c   twoopt           :       0.00          0          0
5.50/5.58	c   fixandinfer      :       0.00          0          0
5.50/5.58	c   feaspump         :       0.00          0          0
5.50/5.58	c   coefdiving       :       0.00          0          0
5.50/5.58	c   pscostdiving     :       0.00          0          0
5.50/5.58	c   fracdiving       :       0.00          0          0
5.50/5.58	c   veclendiving     :       0.00          0          0
5.50/5.58	c   intdiving        :       0.00          0          0
5.50/5.58	c   actconsdiving    :       0.00          0          0
5.50/5.58	c   objpscostdiving  :       0.00          0          0
5.50/5.58	c   rootsoldiving    :       0.00          0          0
5.50/5.58	c   linesearchdiving :       0.00          0          0
5.50/5.58	c   guideddiving     :       0.00          0          0
5.50/5.58	c   octane           :       0.00          0          0
5.50/5.58	c   rens             :       0.00          0          0
5.50/5.58	c   rins             :       0.00          0          0
5.50/5.58	c   localbranching   :       0.00          0          0
5.50/5.58	c   mutation         :       0.00          0          0
5.50/5.58	c   crossover        :       0.00          0          0
5.50/5.58	c   dins             :       0.00          0          0
5.50/5.58	c   undercover       :       0.00          0          0
5.50/5.58	c   nlp              :       0.00          0          0
5.50/5.58	c   trysol           :       0.00          0          0
5.50/5.58	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
5.50/5.58	c   primal LP        :       0.00          0          0       0.00          -
5.50/5.58	c   dual LP          :       0.15         34        933      27.44    6026.24
5.50/5.58	c   lex dual LP      :       0.00          0          0       0.00          -
5.50/5.58	c   barrier LP       :       0.00          0          0       0.00          -
5.50/5.58	c   diving/probing LP:       0.00          0          0       0.00          -
5.50/5.58	c   strong branching :       2.53        131       9289      70.91    3672.19
5.50/5.58	c     (at root node) :          -          9       4547     505.22          -
5.50/5.58	c   conflict analysis:       0.00          0          0       0.00          -
5.50/5.58	c B&B Tree           :
5.50/5.58	c   number of runs   :          1
5.50/5.58	c   nodes            :         12
5.50/5.58	c   nodes (total)    :         12
5.50/5.58	c   nodes left       :          0
5.50/5.58	c   max depth        :         10
5.50/5.58	c   max depth (total):         10
5.50/5.58	c   backtracks       :          0 (0.0%)
5.50/5.58	c   delayed cutoffs  :          0
5.50/5.58	c   repropagations   :          4 (27 domain reductions, 0 cutoffs)
5.50/5.58	c   avg switch length:       2.50
5.50/5.58	c   switching time   :       0.01
5.50/5.58	c Solution           :
5.50/5.58	c   Solutions found  :          1 (1 improvements)
5.50/5.58	c   First Solution   : +0.00000000000000e+00   (in run 1, after 12 nodes, 5.55 seconds, depth 10, found by <relaxation>)
5.50/5.58	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 12 nodes, 5.55 seconds, depth 10, found by <relaxation>)
5.50/5.58	c   Dual Bound       : +0.00000000000000e+00
5.50/5.58	c   Gap              :       0.00 %
5.50/5.58	c   Root Dual Bound  : +0.00000000000000e+00
5.50/5.58	c   Root Iterations  :        232
5.59/5.61	c Time complete: 5.6.

Verifier Data 

OK	0

Watcher Data 

runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2702890-1278576185/watcher-2702890-1278576185 -o /tmp/evaluation-result-2702890-1278576185/solver-2702890-1278576185 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2702890-1278576185.opb -t 1800 -m 1800 

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): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 1.09 1.02 0.92 3/105 31036
/proc/meminfo: memFree=1841728/2059040 swapFree=4139444/4192956
[pid=31036] ppid=31034 vsize=7904 CPUtime=0
/proc/31036/stat : 31036 (pbscip.linux.x8) R 31034 31036 30700 0 -1 4202496 1090 0 0 0 0 0 0 0 18 0 1 0 25826986 8093696 1001 1992294400 4194304 8395647 140737484395328 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/31036/statm: 1976 1009 365 1026 0 946 0

[startup+0.0432351 s]
/proc/loadavg: 1.09 1.02 0.92 3/105 31036
/proc/meminfo: memFree=1841728/2059040 swapFree=4139444/4192956
[pid=31036] ppid=31034 vsize=17088 CPUtime=0.03
/proc/31036/stat : 31036 (pbscip.linux.x8) R 31034 31036 30700 0 -1 4202496 3639 0 0 0 3 0 0 0 18 0 1 0 25826986 17498112 3196 1992294400 4194304 8395647 140737484395328 18446744073709551615 4450850 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31036/statm: 4272 3196 442 1026 0 3242 0
Current children cumulated CPU time (s) 0.03
Current children cumulated vsize (KiB) 17088

[startup+0.10124 s]
/proc/loadavg: 1.09 1.02 0.92 3/105 31036
/proc/meminfo: memFree=1841728/2059040 swapFree=4139444/4192956
[pid=31036] ppid=31034 vsize=18708 CPUtime=0.1
/proc/31036/stat : 31036 (pbscip.linux.x8) R 31034 31036 30700 0 -1 4202496 4044 0 0 0 9 1 0 0 18 0 1 0 25826986 19156992 3601 1992294400 4194304 8395647 140737484395328 18446744073709551615 18446744073699065955 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31036/statm: 4677 3601 453 1026 0 3647 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 18708

[startup+0.30126 s]
/proc/loadavg: 1.09 1.02 0.92 3/105 31036
/proc/meminfo: memFree=1841728/2059040 swapFree=4139444/4192956
[pid=31036] ppid=31034 vsize=26384 CPUtime=0.29
/proc/31036/stat : 31036 (pbscip.linux.x8) R 31034 31036 30700 0 -1 4202496 6228 0 0 0 28 1 0 0 18 0 1 0 25826986 27017216 5713 1992294400 4194304 8395647 140737484395328 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31036/statm: 6596 5713 588 1026 0 5566 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 26384

[startup+0.701304 s]
/proc/loadavg: 1.09 1.02 0.92 3/105 31036
/proc/meminfo: memFree=1841728/2059040 swapFree=4139444/4192956
[pid=31036] ppid=31034 vsize=43780 CPUtime=0.69
/proc/31036/stat : 31036 (pbscip.linux.x8) R 31034 31036 30700 0 -1 4202496 10245 0 0 0 56 13 0 0 18 0 1 0 25826986 44830720 9730 1992294400 4194304 8395647 140737484395328 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31036/statm: 10945 9730 607 1026 0 9915 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 43780

[startup+1.50138 s]
/proc/loadavg: 1.16 1.04 0.93 2/106 31037
/proc/meminfo: memFree=1804148/2059040 swapFree=4139444/4192956
[pid=31036] ppid=31034 vsize=44156 CPUtime=1.49
/proc/31036/stat : 31036 (pbscip.linux.x8) R 31034 31036 30700 0 -1 4202496 10389 0 0 0 128 21 0 0 20 0 1 0 25826986 45215744 9869 1992294400 4194304 8395647 140737484395328 18446744073709551615 6198232 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31036/statm: 11039 9869 625 1026 0 10009 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 44156

[startup+3.10054 s]
/proc/loadavg: 1.16 1.04 0.93 2/106 31037
/proc/meminfo: memFree=1803652/2059040 swapFree=4139444/4192956
[pid=31036] ppid=31034 vsize=44156 CPUtime=3.09
/proc/31036/stat : 31036 (pbscip.linux.x8) R 31034 31036 30700 0 -1 4202496 10705 0 0 0 287 22 0 0 25 0 1 0 25826986 45215744 10168 1992294400 4194304 8395647 140737484395328 18446744073709551615 6670381 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31036/statm: 11039 10168 668 1026 0 10009 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 44156

Solver just ended. Dumping a history of the last processes samples

[startup+4.7007 s]
/proc/loadavg: 1.16 1.04 0.93 2/106 31037
/proc/meminfo: memFree=1802908/2059040 swapFree=4139444/4192956
[pid=31036] ppid=31034 vsize=44156 CPUtime=4.69
/proc/31036/stat : 31036 (pbscip.linux.x8) R 31034 31036 30700 0 -1 4202496 10748 0 0 0 445 24 0 0 25 0 1 0 25826986 45215744 10169 1992294400 4194304 8395647 140737484395328 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31036/statm: 11039 10169 627 1026 0 10009 0
Current children cumulated CPU time (s) 4.69
Current children cumulated vsize (KiB) 44156

[startup+5.10074 s]
/proc/loadavg: 1.16 1.04 0.93 2/106 31037
/proc/meminfo: memFree=1802908/2059040 swapFree=4139444/4192956
[pid=31036] ppid=31034 vsize=44156 CPUtime=5.09
/proc/31036/stat : 31036 (pbscip.linux.x8) R 31034 31036 30700 0 -1 4202496 10749 0 0 0 484 25 0 0 25 0 1 0 25826986 45215744 10170 1992294400 4194304 8395647 140737484395328 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31036/statm: 11039 10170 628 1026 0 10009 0
Current children cumulated CPU time (s) 5.09
Current children cumulated vsize (KiB) 44156

[startup+5.50778 s]
/proc/loadavg: 1.16 1.04 0.93 2/106 31037
/proc/meminfo: memFree=1802908/2059040 swapFree=4139444/4192956
[pid=31036] ppid=31034 vsize=44156 CPUtime=5.5
/proc/31036/stat : 31036 (pbscip.linux.x8) R 31034 31036 30700 0 -1 4202496 10749 0 0 0 524 26 0 0 25 0 1 0 25826986 45215744 10170 1992294400 4194304 8395647 140737484395328 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31036/statm: 11039 10170 628 1026 0 10009 0
Current children cumulated CPU time (s) 5.5
Current children cumulated vsize (KiB) 44156

[startup+5.60079 s]
/proc/loadavg: 1.16 1.04 0.93 2/106 31037
/proc/meminfo: memFree=1802908/2059040 swapFree=4139444/4192956
[pid=31036] ppid=31034 vsize=44156 CPUtime=5.59
/proc/31036/stat : 31036 (pbscip.linux.x8) R 31034 31036 30700 0 -1 4202496 10752 0 0 0 533 26 0 0 25 0 1 0 25826986 45215744 10173 1992294400 4194304 8395647 140737484395328 18446744073709551615 6345229 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/31036/statm: 11039 10173 631 1026 0 10009 0
Current children cumulated CPU time (s) 5.59
Current children cumulated vsize (KiB) 44156

Child status: 0
Real time (s): 5.61335
CPU time (s): 5.61215
CPU user time (s): 5.33919
CPU system time (s): 0.272958
CPU usage (%): 99.9785
Max. virtual memory (cumulated for all children) (KiB): 44156

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 5.33919
system time used= 0.272958
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10755
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= 2
involuntary context switches= 19

runsolver used 0.013997 second user time and 0.037994 second system time

The end

Launcher Data 

Begin job on node084 at 2010-07-08 10:03:05
IDJOB=2702890
IDBENCH=48339
IDSOLVER=1213
FILE ID=node084/2702890-1278576185
PBS_JOBID= 11240064
Free space on /tmp= 62500 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB07/normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/manquinho/dbsg/normalized-dbsg_50_25_1_5.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2702890-1278576185/watcher-2702890-1278576185 -o /tmp/evaluation-result-2702890-1278576185/solver-2702890-1278576185 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2702890-1278576185.opb -t 1800 -m 1800

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 1800 MiB
MAX NB THREAD= 0

MD5SUM BENCH= d6d85d35b0f961666d5965433f22c8bb
RANDOM SEED=2088375184

node084.alineos.net Linux 2.6.18-164.el5 #1 SMP Thu Sep 3 03:28:30 EDT 2009

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.215
cache size	: 2048 KB
physical id	: 0
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 6000.43
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.215
cache size	: 2048 KB
physical id	: 3
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5999.48
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1842256 kB
Buffers:         12124 kB
Cached:         117376 kB
SwapCached:       6248 kB
Active:          49620 kB
Inactive:        93648 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1842256 kB
SwapTotal:     4192956 kB
SwapFree:      4139444 kB
Dirty:           10624 kB
Writeback:           0 kB
AnonPages:       12148 kB
Mapped:          12012 kB
Slab:            51856 kB
PageTables:       4132 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   182004 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264948 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62488 MiB
End job on node084 at 2010-07-08 10:03:11