Trace number 3453329

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
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4UNSAT 2.12268 2.12246

General information on the benchmark

Name/DEC-SMALLINT-LIN/oliveras/j120/
normalized-j12023_3-unsat.opb
MD5SUMcab64fb449176610fb00692a41666b1e
Bench CategoryDEC-SMALLINT-LIN (no optimisation, small integers, linear constraints)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.023995
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables23958
Total number of constraints79333
Number of constraints which are clauses78941
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints392
Minimum length of a constraint1
Maximum length of a constraint38
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 22
Number of bits of the biggest number in a constraint 5
Biggest sum of numbers in a constraint 225
Number of bits of the biggest sum of numbers8
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

0.00/0.00	c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
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-3453329-1307116755.opb>
0.39/0.49	c original problem has 23958 variables (23958 bin, 0 int, 0 impl, 0 cont) and 79333 constraints
0.39/0.49	c problem read
0.39/0.49	c No objective function, only one solution is needed.
0.39/0.49	c presolving settings loaded
0.69/0.74	c presolving:
1.89/1.97	c presolving (1 rounds):
1.89/1.97	c  2325 deleted vars, 9233 deleted constraints, 0 added constraints, 2325 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.89/1.97	c  3536602 implications, 0 cliques
1.89/1.98	c presolving detected infeasibility
1.89/1.98	c Presolving Time: 1.41
1.89/1.98	c - non default parameters ----------------------------------------------------------------------
1.89/1.98	c # SCIP version 2.0.1.4
1.89/1.98	c 
1.89/1.98	c # frequency for displaying node information lines
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 100]
1.89/1.98	c display/freq = 10000
1.89/1.98	c 
1.89/1.98	c # maximal time in seconds to run
1.89/1.98	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.89/1.98	c limits/time = 1800
1.89/1.98	c 
1.89/1.98	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.89/1.98	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.89/1.98	c limits/memory = 13950
1.89/1.98	c 
1.89/1.98	c # solving stops, if the given number of solutions were found (-1: no limit)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.98	c limits/solutions = 1
1.89/1.98	c 
1.89/1.98	c # maximal number of separation rounds per node (-1: unlimited)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 5]
1.89/1.98	c separating/maxrounds = 1
1.89/1.98	c 
1.89/1.98	c # maximal number of separation rounds in the root node (-1: unlimited)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.98	c separating/maxroundsroot = 5
1.89/1.98	c 
1.89/1.98	c # default clock type (1: CPU user seconds, 2: wall clock time)
1.89/1.98	c # [type: int, range: [1,2], default: 1]
1.89/1.98	c timing/clocktype = 2
1.89/1.98	c 
1.89/1.98	c # belongs reading time to solving time?
1.89/1.98	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.98	c timing/reading = TRUE
1.89/1.98	c 
1.89/1.98	c # should presolving try to simplify inequalities
1.89/1.98	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.98	c constraints/linear/simplifyinequalities = TRUE
1.89/1.98	c 
1.89/1.98	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
1.89/1.98	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.98	c constraints/indicator/addCouplingCons = TRUE
1.89/1.98	c 
1.89/1.98	c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.89/1.98	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.89/1.98	c constraints/knapsack/disaggregation = FALSE
1.89/1.98	c 
1.89/1.98	c # should presolving try to simplify knapsacks
1.89/1.98	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.98	c constraints/knapsack/simplifyinequalities = TRUE
1.89/1.98	c 
1.89/1.98	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.98	c presolving/probing/maxrounds = 0
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.98	c heuristics/coefdiving/freq = -1
1.89/1.98	c 
1.89/1.98	c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.98	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.98	c heuristics/coefdiving/maxlpiterquot = 0.075
1.89/1.98	c 
1.89/1.98	c # additional number of allowed LP iterations
1.89/1.98	c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.98	c heuristics/coefdiving/maxlpiterofs = 1500
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 30]
1.89/1.98	c heuristics/crossover/freq = -1
1.89/1.98	c 
1.89/1.98	c # number of nodes added to the contingent of the total nodes
1.89/1.98	c # [type: longint, range: [0,9223372036854775807], default: 500]
1.89/1.98	c heuristics/crossover/nodesofs = 750
1.89/1.98	c 
1.89/1.98	c # number of nodes without incumbent change that heuristic should wait
1.89/1.98	c # [type: longint, range: [0,9223372036854775807], default: 200]
1.89/1.98	c heuristics/crossover/nwaitingnodes = 100
1.89/1.98	c 
1.89/1.98	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.89/1.98	c # [type: real, range: [0,1], default: 0.1]
1.89/1.98	c heuristics/crossover/nodesquot = 0.15
1.89/1.98	c 
1.89/1.98	c # minimum percentage of integer variables that have to be fixed 
1.89/1.98	c # [type: real, range: [0,1], default: 0.666]
1.89/1.98	c heuristics/crossover/minfixingrate = 0.5
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.98	c heuristics/feaspump/freq = -1
1.89/1.98	c 
1.89/1.98	c # additional number of allowed LP iterations
1.89/1.98	c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.98	c heuristics/feaspump/maxlpiterofs = 2000
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.98	c heuristics/fracdiving/freq = -1
1.89/1.98	c 
1.89/1.98	c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.98	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.98	c heuristics/fracdiving/maxlpiterquot = 0.075
1.89/1.98	c 
1.89/1.98	c # additional number of allowed LP iterations
1.89/1.98	c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.98	c heuristics/fracdiving/maxlpiterofs = 1500
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.98	c heuristics/guideddiving/freq = -1
1.89/1.98	c 
1.89/1.98	c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.98	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.98	c heuristics/guideddiving/maxlpiterquot = 0.075
1.89/1.98	c 
1.89/1.98	c # additional number of allowed LP iterations
1.89/1.98	c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.98	c heuristics/guideddiving/maxlpiterofs = 1500
1.89/1.98	c 
1.89/1.98	c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.98	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.98	c heuristics/intdiving/maxlpiterquot = 0.075
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.98	c heuristics/intshifting/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.98	c heuristics/linesearchdiving/freq = -1
1.89/1.98	c 
1.89/1.98	c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.98	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.98	c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.89/1.98	c 
1.89/1.98	c # additional number of allowed LP iterations
1.89/1.98	c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.98	c heuristics/linesearchdiving/maxlpiterofs = 1500
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.98	c heuristics/objpscostdiving/freq = -1
1.89/1.98	c 
1.89/1.98	c # maximal fraction of diving LP iterations compared to total iteration number
1.89/1.98	c # [type: real, range: [0,1], default: 0.01]
1.89/1.98	c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.89/1.98	c 
1.89/1.98	c # additional number of allowed LP iterations
1.89/1.98	c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.98	c heuristics/objpscostdiving/maxlpiterofs = 1500
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.98	c heuristics/oneopt/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.98	c heuristics/pscostdiving/freq = -1
1.89/1.98	c 
1.89/1.98	c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.98	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.98	c heuristics/pscostdiving/maxlpiterquot = 0.075
1.89/1.98	c 
1.89/1.98	c # additional number of allowed LP iterations
1.89/1.98	c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.98	c heuristics/pscostdiving/maxlpiterofs = 1500
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.98	c heuristics/rens/freq = -1
1.89/1.98	c 
1.89/1.98	c # minimum percentage of integer variables that have to be fixable 
1.89/1.98	c # [type: real, range: [0,1], default: 0.5]
1.89/1.98	c heuristics/rens/minfixingrate = 0.3
1.89/1.98	c 
1.89/1.98	c # number of nodes added to the contingent of the total nodes
1.89/1.98	c # [type: longint, range: [0,9223372036854775807], default: 500]
1.89/1.98	c heuristics/rens/nodesofs = 2000
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.98	c heuristics/rootsoldiving/freq = -1
1.89/1.98	c 
1.89/1.98	c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.98	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.89/1.98	c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.89/1.98	c 
1.89/1.98	c # additional number of allowed LP iterations
1.89/1.98	c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.98	c heuristics/rootsoldiving/maxlpiterofs = 1500
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.98	c heuristics/rounding/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.98	c heuristics/shiftandpropagate/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.98	c heuristics/shifting/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.98	c heuristics/simplerounding/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.98	c heuristics/subnlp/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.98	c heuristics/trivial/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.98	c heuristics/trysol/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.98	c heuristics/undercover/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.98	c heuristics/veclendiving/freq = -1
1.89/1.98	c 
1.89/1.98	c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.98	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.98	c heuristics/veclendiving/maxlpiterquot = 0.075
1.89/1.98	c 
1.89/1.98	c # additional number of allowed LP iterations
1.89/1.98	c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.98	c heuristics/veclendiving/maxlpiterofs = 1500
1.89/1.98	c 
1.89/1.98	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.98	c heuristics/zirounding/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.98	c separating/cmir/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.98	c separating/flowcover/freq = -1
1.89/1.98	c 
1.89/1.98	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.89/1.98	c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.98	c separating/rapidlearning/freq = 0
1.89/1.98	c 
1.89/1.98	c -----------------------------------------------------------------------------------------------
1.89/1.98	c start solving
1.89/1.98	c 
1.89/1.98	c SCIP Status        : problem is solved [infeasible]
1.89/1.98	c Solving Time (sec) : 1.98
1.89/1.98	c Solving Nodes      : 0
1.89/1.98	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
1.89/1.98	c Dual Bound         : -1.00000000000000e+20
1.89/1.98	c Gap                : infinite
1.89/1.98	s UNSATISFIABLE
1.89/1.98	c SCIP Status        : problem is solved [infeasible]
1.89/1.98	c Total Time         :       1.98
1.89/1.98	c   solving          :       1.98
1.89/1.98	c   presolving       :       1.41 (included in solving)
1.89/1.98	c   reading          :       0.49 (included in solving)
1.89/1.98	c Original Problem   :
1.89/1.98	c   Problem name     : HOME/instance-3453329-1307116755.opb
1.89/1.98	c   Variables        : 23958 (23958 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.98	c   Constraints      : 79333 initial, 79333 maximal
1.89/1.98	c Presolved Problem  :
1.89/1.98	c   Problem name     : t_HOME/instance-3453329-1307116755.opb
1.89/1.98	c   Variables        : 21633 (21633 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.98	c   Constraints      : 70100 initial, 70100 maximal
1.89/1.98	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
1.89/1.98	c   trivial          :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.98	c   dualfix          :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.98	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.98	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.98	c   implics          :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.98	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.98	c   linear           :       1.21       2325          0          0       2325          0       9233          0          0          0
1.89/1.98	c   root node        :          -          0          -          -          0          -          -          -          -          -
1.89/1.98	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
1.89/1.98	c   integral         :          0          0          0          0          0          0          0          0          0          0          0          0
1.89/1.98	c   linear           :      70100          0          0          0          0          0          0          0          0          0          0          0
1.89/1.98	c   countsols        :          0          0          0          0          0          0          0          0          0          0          0          0
1.89/1.98	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
1.89/1.98	c   integral         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.89/1.98	c   linear           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.89/1.98	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.89/1.98	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
1.89/1.98	c   pseudoobj        :          0          0          0          0
1.89/1.98	c   rootredcost      :          0          0          0          0
1.89/1.98	c   vbounds          :          0          0          0          0
1.89/1.98	c Propagator Timings :  TotalTime  Propagate    Resprop
1.89/1.98	c   pseudoobj        :       0.00       0.00       0.00
1.89/1.98	c   rootredcost      :       0.00       0.00       0.00
1.89/1.98	c   vbounds          :       0.00       0.00       0.00
1.89/1.98	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.89/1.98	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
1.89/1.98	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.89/1.98	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.89/1.98	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.89/1.98	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.89/1.98	c   applied globally :          -          -          -          0        0.0          -          -          -
1.89/1.98	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.89/1.98	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.89/1.98	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
1.89/1.98	c   redcost          :       0.00          0          0          0          0          0
1.89/1.98	c   impliedbounds    :       0.00          0          0          0          0          0
1.89/1.98	c   intobj           :       0.00          0          0          0          0          0
1.89/1.98	c   gomory           :       0.00          0          0          0          0          0
1.89/1.98	c   cgmip            :       0.00          0          0          0          0          0
1.89/1.98	c   closecuts        :       0.00          0          0          0          0          0
1.89/1.98	c   strongcg         :       0.00          0          0          0          0          0
1.89/1.98	c   cmir             :       0.00          0          0          0          0          0
1.89/1.98	c   flowcover        :       0.00          0          0          0          0          0
1.89/1.98	c   clique           :       0.00          0          0          0          0          0
1.89/1.98	c   zerohalf         :       0.00          0          0          0          0          0
1.89/1.98	c   mcf              :       0.00          0          0          0          0          0
1.89/1.98	c   oddcycle         :       0.00          0          0          0          0          0
1.89/1.98	c   rapidlearning    :       0.00          0          0          0          0          0
1.89/1.98	c Pricers            :       Time      Calls       Vars
1.89/1.98	c   problem variables:       0.00          0          0
1.89/1.98	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.89/1.98	c   pscost           :       0.00          0          0          0          0          0          0
1.89/1.98	c   inference        :       0.00          0          0          0          0          0          0
1.89/1.98	c   mostinf          :       0.00          0          0          0          0          0          0
1.89/1.98	c   leastinf         :       0.00          0          0          0          0          0          0
1.89/1.98	c   fullstrong       :       0.00          0          0          0          0          0          0
1.89/1.98	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.89/1.98	c   random           :       0.00          0          0          0          0          0          0
1.89/1.98	c   relpscost        :       0.00          0          0          0          0          0          0
1.89/1.98	c Primal Heuristics  :       Time      Calls      Found
1.89/1.98	c   LP solutions     :       0.00          -          0
1.89/1.98	c   pseudo solutions :       0.00          -          0
1.89/1.98	c   trivial          :       0.02          1          0
1.89/1.98	c   shiftandpropagate:       0.00          0          0
1.89/1.98	c   simplerounding   :       0.00          0          0
1.89/1.98	c   zirounding       :       0.00          0          0
1.89/1.98	c   rounding         :       0.00          0          0
1.89/1.98	c   shifting         :       0.00          0          0
1.89/1.98	c   intshifting      :       0.00          0          0
1.89/1.98	c   oneopt           :       0.00          0          0
1.89/1.98	c   twoopt           :       0.00          0          0
1.89/1.98	c   fixandinfer      :       0.00          0          0
1.89/1.98	c   feaspump         :       0.00          0          0
1.89/1.98	c   clique           :       0.00          0          0
1.89/1.98	c   coefdiving       :       0.00          0          0
1.89/1.98	c   pscostdiving     :       0.00          0          0
1.89/1.98	c   fracdiving       :       0.00          0          0
1.89/1.98	c   veclendiving     :       0.00          0          0
1.89/1.98	c   intdiving        :       0.00          0          0
1.89/1.98	c   actconsdiving    :       0.00          0          0
1.89/1.98	c   objpscostdiving  :       0.00          0          0
1.89/1.98	c   rootsoldiving    :       0.00          0          0
1.89/1.98	c   linesearchdiving :       0.00          0          0
1.89/1.98	c   guideddiving     :       0.00          0          0
1.89/1.98	c   octane           :       0.00          0          0
1.89/1.98	c   rens             :       0.00          0          0
1.89/1.98	c   rins             :       0.00          0          0
1.89/1.98	c   localbranching   :       0.00          0          0
1.89/1.98	c   mutation         :       0.00          0          0
1.89/1.98	c   crossover        :       0.00          0          0
1.89/1.98	c   dins             :       0.00          0          0
1.89/1.98	c   vbounds          :       0.00          0          0
1.89/1.98	c   undercover       :       0.00          0          0
1.89/1.98	c   subnlp           :       0.00          0          0
1.89/1.98	c   trysol           :       0.00          0          0
1.89/1.98	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.89/1.98	c   primal LP        :       0.00          0          0       0.00          -
1.89/1.98	c   dual LP          :       0.00          0          0       0.00          -
1.89/1.98	c   lex dual LP      :       0.00          0          0       0.00          -
1.89/1.98	c   barrier LP       :       0.00          0          0       0.00          -
1.89/1.98	c   diving/probing LP:       0.00          0          0       0.00          -
1.89/1.98	c   strong branching :       0.00          0          0       0.00          -
1.89/1.98	c     (at root node) :          -          0          0       0.00          -
1.89/1.98	c   conflict analysis:       0.00          0          0       0.00          -
1.89/1.98	c B&B Tree           :
1.89/1.98	c   number of runs   :          1
1.89/1.98	c   nodes            :          0
1.89/1.98	c   nodes (total)    :          0
1.89/1.98	c   nodes left       :          1
1.89/1.98	c   max depth        :         -1
1.89/1.98	c   max depth (total):         -1
1.89/1.98	c   backtracks       :          0 (0.0%)
1.89/1.98	c   delayed cutoffs  :          0
1.89/1.98	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
1.89/1.98	c   avg switch length:       0.00
1.89/1.98	c   switching time   :       0.00
1.89/1.98	c Solution           :
1.89/1.98	c   Solutions found  :          0 (0 improvements)
1.89/1.98	c   Primal Bound     : infeasible
1.89/1.98	c   Dual Bound       :          -
1.89/1.98	c   Gap              :   infinite
1.89/1.98	c   Root Dual Bound  :          -
1.89/1.98	c   Root Iterations  :          0
2.10/2.12	c Time complete: 2.12.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.0 (svn: 977)

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-3453329-1307116755/watcher-3453329-1307116755 -o /tmp/evaluation-result-3453329-1307116755/solver-3453329-1307116755 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453329-1307116755.opb -t 1800 -m 15500 

running on 4 cores: 0,2,4,6

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 2.00 2.02 2.00 2/464 8217
/proc/meminfo: memFree=29810032/32950928 swapFree=45617076/67111528
[pid=8217] ppid=8215 vsize=10348 CPUtime=0 cores=0,2,4,6
/proc/8217/stat : 8217 (scip-2.0.1.4.li) R 8215 8217 5789 0 -1 4202496 1586 0 0 0 0 0 0 0 25 0 1 0 823275305 10596352 1539 33554432000 4194304 9128323 140736212414592 18446744073709551615 7980987 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/8217/statm: 2587 1539 397 1205 0 1378 0

[startup+0.026718 s]
/proc/loadavg: 2.00 2.02 2.00 2/464 8217
/proc/meminfo: memFree=29810032/32950928 swapFree=45617076/67111528
[pid=8217] ppid=8215 vsize=13964 CPUtime=0.02 cores=0,2,4,6
/proc/8217/stat : 8217 (scip-2.0.1.4.li) R 8215 8217 5789 0 -1 4202496 2494 0 0 0 2 0 0 0 25 0 1 0 823275305 14299136 2447 33554432000 4194304 9128323 140736212414592 18446744073709551615 7998205 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/8217/statm: 3491 2447 397 1205 0 2282 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 13964

[startup+0.100768 s]
/proc/loadavg: 2.00 2.02 2.00 2/464 8217
/proc/meminfo: memFree=29810032/32950928 swapFree=45617076/67111528
[pid=8217] ppid=8215 vsize=24428 CPUtime=0.09 cores=0,2,4,6
/proc/8217/stat : 8217 (scip-2.0.1.4.li) R 8215 8217 5789 0 -1 4202496 5090 0 0 0 9 0 0 0 25 0 1 0 823275305 25014272 5041 33554432000 4194304 9128323 140736212414592 18446744073709551615 8008925 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/8217/statm: 6107 5041 397 1205 0 4898 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 24428

[startup+0.300737 s]
/proc/loadavg: 2.00 2.02 2.00 2/464 8217
/proc/meminfo: memFree=29810032/32950928 swapFree=45617076/67111528
[pid=8217] ppid=8215 vsize=34624 CPUtime=0.29 cores=0,2,4,6
/proc/8217/stat : 8217 (scip-2.0.1.4.li) R 8215 8217 5789 0 -1 4202496 7695 0 0 0 28 1 0 0 25 0 1 0 823275305 35454976 7612 33554432000 4194304 9128323 140736212414592 18446744073709551615 8008905 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/8217/statm: 8656 7612 397 1205 0 7447 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 34624

[startup+0.70066 s]
/proc/loadavg: 2.00 2.02 2.00 2/464 8217
/proc/meminfo: memFree=29810032/32950928 swapFree=45617076/67111528
[pid=8217] ppid=8215 vsize=144992 CPUtime=0.69 cores=0,2,4,6
/proc/8217/stat : 8217 (scip-2.0.1.4.li) R 8215 8217 5789 0 -1 4202496 34794 0 0 0 66 3 0 0 25 0 1 0 823275305 148471808 34639 33554432000 4194304 9128323 140736212414592 18446744073709551615 4209010 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/8217/statm: 36248 34639 465 1205 0 35039 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 144992

[startup+1.50052 s]
/proc/loadavg: 2.00 2.02 2.00 3/465 8218
/proc/meminfo: memFree=29641008/32950928 swapFree=45617076/67111528
[pid=8217] ppid=8215 vsize=228152 CPUtime=1.49 cores=0,2,4,6
/proc/8217/stat : 8217 (scip-2.0.1.4.li) R 8215 8217 5789 0 -1 4202496 57913 0 0 0 144 5 0 0 25 0 1 0 823275305 233627648 54987 33554432000 4194304 9128323 140736212414592 18446744073709551615 4352218 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/8217/statm: 57038 54987 509 1205 0 55829 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 228152

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

[startup+1.90046 s]
/proc/loadavg: 2.00 2.02 2.00 3/465 8218
/proc/meminfo: memFree=29641008/32950928 swapFree=45617076/67111528
[pid=8217] ppid=8215 vsize=253004 CPUtime=1.89 cores=0,2,4,6
/proc/8217/stat : 8217 (scip-2.0.1.4.li) R 8215 8217 5789 0 -1 4202496 63784 0 0 0 183 6 0 0 25 0 1 0 823275305 259076096 60858 33554432000 4194304 9128323 140736212414592 18446744073709551615 4352160 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/8217/statm: 63251 60858 509 1205 0 62042 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 253004

[startup+2.10042 s]
/proc/loadavg: 2.00 2.02 2.00 3/465 8218
/proc/meminfo: memFree=29630592/32950928 swapFree=45617076/67111528
[pid=8217] ppid=8215 vsize=178220 CPUtime=2.1 cores=0,2,4,6
/proc/8217/stat : 8217 (scip-2.0.1.4.li) R 8215 8217 5789 0 -1 4202496 65503 0 0 0 203 7 0 0 25 0 1 0 823275305 182497280 42545 33554432000 4194304 9128323 140736212414592 18446744073709551615 8062775 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/8217/statm: 44555 42352 557 1205 0 43346 0
Current children cumulated CPU time (s) 2.1
Current children cumulated vsize (KiB) 178220

Child status: 0
Real time (s): 2.12246
CPU time (s): 2.12268
CPU user time (s): 2.04069
CPU system time (s): 0.081987
CPU usage (%): 100.01
Max. virtual memory (cumulated for all children) (KiB): 254380

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

runsolver used 0.015997 second user time and 0.036994 second system time

The end

Launcher Data 

Begin job on node123 at 2011-06-03 17:59:15
IDJOB=3453329
IDBENCH=73560
IDSOLVER=1949
FILE ID=node123/3453329-1307116755
RUNJOBID= node123-1307109000-7204
PBS_JOBID= 13497979
Free space on /tmp= 73816 MiB

SOLVER NAME= SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4
BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j120/normalized-j12023_3-unsat.opb
COMMAND LINE= HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3453329-1307116755/watcher-3453329-1307116755 -o /tmp/evaluation-result-3453329-1307116755/solver-3453329-1307116755 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453329-1307116755.opb -t 1800 -m 15500

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 15500 MiB
NBCORE= 4

MD5SUM BENCH= cab64fb449176610fb00692a41666b1e
RANDOM SEED=1398750808

node123.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	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.838
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5333.67
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.838
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5226.15
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 2
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.838
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 3
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.838
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.82
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 4
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.838
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.74
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 5
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.838
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.80
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 6
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.838
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.74
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 7
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.838
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.83
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32950928 kB
MemFree:      29810064 kB
Buffers:        276796 kB
Cached:         370944 kB
SwapCached:       9456 kB
Active:        2553972 kB
Inactive:       306668 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32950928 kB
LowFree:      29810064 kB
SwapTotal:    67111528 kB
SwapFree:     45617076 kB
Dirty:           14404 kB
Writeback:           0 kB
AnonPages:     2211300 kB
Mapped:          26168 kB
Slab:           133828 kB
PageTables:      79032 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83586992 kB
Committed_AS: 133648412 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    296008 kB
VmallocChunk: 34359440975 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 73804 MiB
End job on node123 at 2011-06-03 17:59:17