Trace number 2666315

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.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverSAT 2.41763 2.41838

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_200_10_3_15.opb
MD5SUMbbe3a085a15e9497809c2511fab038f0
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.040992
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables400
Total number of constraints602
Number of constraints which are clauses200
Number of constraints which are cardinality constraints (but not clauses)1
Number of constraints which are nor clauses,nor cardinality constraints401
Minimum length of a constraint2
Maximum length of a constraint400
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 15
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 400
Number of bits of the biggest sum of numbers9
Number of products (including duplicates)4976
Sum of products size (including duplicates)9952
Number of different products2488
Sum of products size4976

Solver Data 

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

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-2666315-1276679467/watcher-2666315-1276679467 -o /tmp/evaluation-result-2666315-1276679467/solver-2666315-1276679467 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2666315-1276679467.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.08 1.02 1.01 3/106 16792
/proc/meminfo: memFree=1752516/2059040 swapFree=4175448/4192956
[pid=16792] ppid=16790 vsize=7724 CPUtime=0
/proc/16792/stat : 16792 (pbscip.linux.x8) R 16790 16792 16046 0 -1 4202496 1127 0 0 0 0 0 0 0 25 0 1 0 9240463 7909376 1046 1992294400 4194304 8223781 140736455553456 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/16792/statm: 1931 1057 348 984 0 944 0

[startup+0.0424209 s]
/proc/loadavg: 1.08 1.02 1.01 3/106 16792
/proc/meminfo: memFree=1752516/2059040 swapFree=4175448/4192956
[pid=16792] ppid=16790 vsize=12960 CPUtime=0.03
/proc/16792/stat : 16792 (pbscip.linux.x8) R 16790 16792 16046 0 -1 4202496 2529 0 0 0 3 0 0 0 25 0 1 0 9240463 13271040 2448 1992294400 4194304 8223781 140736455553456 18446744073709551615 5648518 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/16792/statm: 3240 2448 364 984 0 2253 0
Current children cumulated CPU time (s) 0.03
Current children cumulated vsize (KiB) 12960

[startup+0.101427 s]
/proc/loadavg: 1.08 1.02 1.01 3/106 16792
/proc/meminfo: memFree=1752516/2059040 swapFree=4175448/4192956
[pid=16792] ppid=16790 vsize=21340 CPUtime=0.1
/proc/16792/stat : 16792 (pbscip.linux.x8) R 16790 16792 16046 0 -1 4202496 4973 0 0 0 8 2 0 0 25 0 1 0 9240463 21852160 4271 1992294400 4194304 8223781 140736455553456 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16792/statm: 5335 4271 426 984 0 4348 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 21340

[startup+0.301447 s]
/proc/loadavg: 1.08 1.02 1.01 3/106 16792
/proc/meminfo: memFree=1752516/2059040 swapFree=4175448/4192956
[pid=16792] ppid=16790 vsize=23136 CPUtime=0.29
/proc/16792/stat : 16792 (pbscip.linux.x8) R 16790 16792 16046 0 -1 4202496 6224 0 0 0 20 9 0 0 25 0 1 0 9240463 23691264 4751 1992294400 4194304 8223781 140736455553456 18446744073709551615 5956863 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16792/statm: 5784 4751 451 984 0 4797 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 23136

[startup+0.700489 s]
/proc/loadavg: 1.08 1.02 1.01 3/106 16792
/proc/meminfo: memFree=1752516/2059040 swapFree=4175448/4192956
[pid=16792] ppid=16790 vsize=38100 CPUtime=0.69
/proc/16792/stat : 16792 (pbscip.linux.x8) R 16790 16792 16046 0 -1 4202496 11266 0 0 0 50 19 0 0 25 0 1 0 9240463 39014400 8540 1992294400 4194304 8223781 140736455553456 18446744073709551615 6047522 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16792/statm: 9525 8540 557 984 0 8538 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 38100

[startup+1.50057 s]
/proc/loadavg: 1.08 1.02 1.01 2/107 16793
/proc/meminfo: memFree=1699064/2059040 swapFree=4175448/4192956
[pid=16792] ppid=16790 vsize=44552 CPUtime=1.49
/proc/16792/stat : 16792 (pbscip.linux.x8) R 16790 16792 16046 0 -1 4202496 20017 0 0 0 107 42 0 0 25 0 1 0 9240463 45621248 10240 1992294400 4194304 8223781 140736455553456 18446744073709551615 6009478 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16792/statm: 11138 10240 590 984 0 10151 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 44552

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

[startup+1.90061 s]
/proc/loadavg: 1.08 1.02 1.01 2/107 16793
/proc/meminfo: memFree=1699064/2059040 swapFree=4175448/4192956
[pid=16792] ppid=16790 vsize=47872 CPUtime=1.89
/proc/16792/stat : 16792 (pbscip.linux.x8) R 16790 16792 16046 0 -1 4202496 20858 0 0 0 146 43 0 0 25 0 1 0 9240463 49020928 11063 1992294400 4194304 8223781 140736455553456 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16792/statm: 11968 11063 594 984 0 10981 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 47872

[startup+2.30065 s]
/proc/loadavg: 1.08 1.02 1.01 2/107 16793
/proc/meminfo: memFree=1709356/2059040 swapFree=4175448/4192956
[pid=16792] ppid=16790 vsize=48204 CPUtime=2.29
/proc/16792/stat : 16792 (pbscip.linux.x8) R 16790 16792 16046 0 -1 4202496 21968 0 0 0 185 44 0 0 25 0 1 0 9240463 49360896 11117 1992294400 4194304 8223781 140736455553456 18446744073709551615 6055460 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16792/statm: 12051 11117 588 984 0 11064 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 48204

[startup+2.40066 s]
/proc/loadavg: 1.08 1.02 1.01 2/107 16793
/proc/meminfo: memFree=1709356/2059040 swapFree=4175448/4192956
[pid=16792] ppid=16790 vsize=46684 CPUtime=2.39
/proc/16792/stat : 16792 (pbscip.linux.x8) R 16790 16792 16046 0 -1 4202496 22080 0 0 0 195 44 0 0 25 0 1 0 9240463 47804416 10741 1992294400 4194304 8223781 140736455553456 18446744073709551615 6206490 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/16792/statm: 11671 10741 587 984 0 10684 0
Current children cumulated CPU time (s) 2.39
Current children cumulated vsize (KiB) 46684

Child status: 0
Real time (s): 2.41838
CPU time (s): 2.41763
CPU user time (s): 1.9657
CPU system time (s): 0.451931
CPU usage (%): 99.969
Max. virtual memory (cumulated for all children) (KiB): 63332

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.9657
system time used= 0.451931
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 22084
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= 4

runsolver used 0.003999 second user time and 0.025996 second system time

The end

Launcher Data 

Begin job on node083 at 2010-06-16 11:11:07
IDJOB=2666315
IDBENCH=48333
IDSOLVER=1169
FILE ID=node083/2666315-1276679467
PBS_JOBID= 11172557
Free space on /tmp= 62552 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.2 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_200_10_3_15.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-2666315-1276679467/watcher-2666315-1276679467 -o /tmp/evaluation-result-2666315-1276679467/solver-2666315-1276679467 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2666315-1276679467.opb -t 1800 -m 1800

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

MD5SUM BENCH= bbe3a085a15e9497809c2511fab038f0
RANDOM SEED=1791259057

node083.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.262
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.52
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.262
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.40
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1752920 kB
Buffers:         56528 kB
Cached:         116568 kB
SwapCached:      13528 kB
Active:          93812 kB
Inactive:       135016 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1752920 kB
SwapTotal:     4192956 kB
SwapFree:      4175448 kB
Dirty:            4976 kB
Writeback:           8 kB
AnonPages:       42256 kB
Mapped:          14308 kB
Slab:            55536 kB
PageTables:       4064 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181012 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= 62548 MiB
End job on node083 at 2010-06-16 11:11:10