Trace number 3453385

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 1.38479 1.386

General information on the benchmark

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

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-3453385-1307117601/watcher-3453385-1307117601 -o /tmp/evaluation-result-3453385-1307117601/solver-3453385-1307117601 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453385-1307117601.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/483 13961
/proc/meminfo: memFree=24402704/32950928 swapFree=61542356/67111528
[pid=13961] ppid=13959 vsize=10752 CPUtime=0 cores=0,2,4,6
/proc/13961/stat : 13961 (scip-2.0.1.4.li) R 13959 13961 12040 0 -1 4202496 1693 0 0 0 0 0 0 0 25 0 1 0 901990753 11010048 1646 33554432000 4194304 9128323 140734118142304 18446744073709551615 6189627 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/13961/statm: 2728 1648 397 1205 0 1519 0

[startup+0.103281 s]
/proc/loadavg: 2.00 2.02 2.00 2/483 13961
/proc/meminfo: memFree=24402704/32950928 swapFree=61542356/67111528
[pid=13961] ppid=13959 vsize=21960 CPUtime=0.09 cores=0,2,4,6
/proc/13961/stat : 13961 (scip-2.0.1.4.li) R 13959 13961 12040 0 -1 4202496 4484 0 0 0 9 0 0 0 25 0 1 0 901990753 22487040 4435 33554432000 4194304 9128323 140734118142304 18446744073709551615 8008880 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/13961/statm: 5490 4435 397 1205 0 4281 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 21960

[startup+0.201256 s]
/proc/loadavg: 2.00 2.02 2.00 2/483 13961
/proc/meminfo: memFree=24402704/32950928 swapFree=61542356/67111528
[pid=13961] ppid=13959 vsize=27664 CPUtime=0.19 cores=0,2,4,6
/proc/13961/stat : 13961 (scip-2.0.1.4.li) R 13959 13961 12040 0 -1 4202496 5942 0 0 0 19 0 0 0 25 0 1 0 901990753 28327936 5872 33554432000 4194304 9128323 140734118142304 18446744073709551615 8008920 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/13961/statm: 6916 5872 397 1205 0 5707 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 27664

[startup+0.301242 s]
/proc/loadavg: 2.00 2.02 2.00 2/483 13961
/proc/meminfo: memFree=24402704/32950928 swapFree=61542356/67111528
[pid=13961] ppid=13959 vsize=36632 CPUtime=0.29 cores=0,2,4,6
/proc/13961/stat : 13961 (scip-2.0.1.4.li) R 13959 13961 12040 0 -1 4202496 8179 0 0 0 28 1 0 0 25 0 1 0 901990753 37511168 8107 33554432000 4194304 9128323 140734118142304 18446744073709551615 6886064 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/13961/statm: 9158 8107 397 1205 0 7949 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 36632

[startup+0.701179 s]
/proc/loadavg: 2.00 2.02 2.00 2/483 13961
/proc/meminfo: memFree=24402704/32950928 swapFree=61542356/67111528
[pid=13961] ppid=13959 vsize=127756 CPUtime=0.69 cores=0,2,4,6
/proc/13961/stat : 13961 (scip-2.0.1.4.li) R 13959 13961 12040 0 -1 4202496 32729 0 0 0 67 2 0 0 25 0 1 0 901990753 130822144 30495 33554432000 4194304 9128323 140734118142304 18446744073709551615 6889342 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/13961/statm: 31939 30495 509 1205 0 30730 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 127756

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

[startup+0.801152 s]
/proc/loadavg: 2.00 2.02 2.00 2/483 13961
/proc/meminfo: memFree=24402704/32950928 swapFree=61542356/67111528
[pid=13961] ppid=13959 vsize=140360 CPUtime=0.79 cores=0,2,4,6
/proc/13961/stat : 13961 (scip-2.0.1.4.li) R 13959 13961 12040 0 -1 4202496 35842 0 0 0 76 3 0 0 25 0 1 0 901990753 143728640 33608 33554432000 4194304 9128323 140734118142304 18446744073709551615 4679310 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/13961/statm: 35090 33608 509 1205 0 33881 0
Current children cumulated CPU time (s) 0.79
Current children cumulated vsize (KiB) 140360

[startup+1.21809 s]
/proc/loadavg: 2.00 2.02 2.00 3/484 13962
/proc/meminfo: memFree=24240136/32950928 swapFree=61542356/67111528
[pid=13961] ppid=13959 vsize=177756 CPUtime=1.21 cores=0,2,4,6
/proc/13961/stat : 13961 (scip-2.0.1.4.li) R 13959 13961 12040 0 -1 4202496 45099 0 0 0 117 4 0 0 25 0 1 0 901990753 182022144 42865 33554432000 4194304 9128323 140734118142304 18446744073709551615 4352239 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/13961/statm: 44439 42865 509 1205 0 43230 0
Current children cumulated CPU time (s) 1.21
Current children cumulated vsize (KiB) 177756

[startup+1.30106 s]
/proc/loadavg: 2.00 2.02 2.00 3/484 13962
/proc/meminfo: memFree=24240136/32950928 swapFree=61542356/67111528
[pid=13961] ppid=13959 vsize=178468 CPUtime=1.29 cores=0,2,4,6
/proc/13961/stat : 13961 (scip-2.0.1.4.li) R 13959 13961 12040 0 -1 4202496 46480 0 0 0 125 4 0 0 25 0 1 0 901990753 182751232 43051 33554432000 4194304 9128323 140734118142304 18446744073709551615 5196333 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/13961/statm: 44617 43051 550 1205 0 43408 0
Current children cumulated CPU time (s) 1.29
Current children cumulated vsize (KiB) 178468

Child status: 0
Real time (s): 1.386
CPU time (s): 1.38479
CPU user time (s): 1.3318
CPU system time (s): 0.052991
CPU usage (%): 99.9128
Max. virtual memory (cumulated for all children) (KiB): 178468

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

runsolver used 0.011998 second user time and 0.023996 second system time

The end

Launcher Data 

Begin job on node116 at 2011-06-03 18:13:21
IDJOB=3453385
IDBENCH=75341
IDSOLVER=1949
FILE ID=node116/3453385-1307117601
RUNJOBID= node116-1307109962-13219
PBS_JOBID= 13498000
Free space on /tmp= 73824 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/j90/normalized-j9010_6-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-3453385-1307117601/watcher-3453385-1307117601 -o /tmp/evaluation-result-3453385-1307117601/solver-3453385-1307117601 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453385-1307117601.opb -t 1800 -m 15500

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

MD5SUM BENCH= 62425b8c99d21d88f86cd1929c3b9760
RANDOM SEED=84079045

node116.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.826
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.65
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.826
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.826
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.826
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.75
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.826
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.77
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.826
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.75
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.826
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.75
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.826
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.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32950928 kB
MemFree:      24402860 kB
Buffers:        238840 kB
Cached:         454164 kB
SwapCached:      12572 kB
Active:        7930196 kB
Inactive:       348068 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32950928 kB
LowFree:      24402860 kB
SwapTotal:    67111528 kB
SwapFree:     61542356 kB
Dirty:           13700 kB
Writeback:           0 kB
AnonPages:     7583128 kB
Mapped:          25416 kB
Slab:           139368 kB
PageTables:      63548 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83586992 kB
Committed_AS: 140090952 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= 73812 MiB
End job on node116 at 2011-06-03 18:13:22