Trace number 3451716

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 E SCIP 2.0.1.4b with SoPlex 1.5.0.4UNSAT 1.07783 1.07709

General information on the benchmark

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

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-3451716-1307116663/watcher-3451716-1307116663 -o /tmp/evaluation-result-3451716-1307116663/solver-3451716-1307116663 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f HOME/instance-3451716-1307116663.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.08 2.05 2.01 2/498 12245
/proc/meminfo: memFree=28978084/32951132 swapFree=57925096/67111528
[pid=12245] ppid=12243 vsize=14980 CPUtime=0.01 cores=0,2,4,6
/proc/12245/stat : 12245 (scip-2.0.1.4b.l) R 12243 12245 10513 0 -1 4202496 2715 0 0 0 1 0 0 0 25 0 1 0 823265968 15339520 2668 33554432000 4194304 9163163 140734379258784 18446744073709551615 6919008 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/12245/statm: 3745 2668 392 1214 0 2527 0

[startup+0.100039 s]
/proc/loadavg: 2.08 2.05 2.01 2/498 12245
/proc/meminfo: memFree=28978084/32951132 swapFree=57925096/67111528
[pid=12245] ppid=12243 vsize=23808 CPUtime=0.09 cores=0,2,4,6
/proc/12245/stat : 12245 (scip-2.0.1.4b.l) R 12243 12245 10513 0 -1 4202496 4943 0 0 0 9 0 0 0 25 0 1 0 823265968 24379392 4896 33554432000 4194304 9163163 140734379258784 18446744073709551615 8041824 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/12245/statm: 5952 4896 392 1214 0 4734 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 23808

[startup+0.201014 s]
/proc/loadavg: 2.08 2.05 2.01 2/498 12245
/proc/meminfo: memFree=28978084/32951132 swapFree=57925096/67111528
[pid=12245] ppid=12243 vsize=32000 CPUtime=0.19 cores=0,2,4,6
/proc/12245/stat : 12245 (scip-2.0.1.4b.l) R 12243 12245 10513 0 -1 4202496 6956 0 0 0 19 0 0 0 25 0 1 0 823265968 32768000 6909 33554432000 4194304 9163163 140734379258784 18446744073709551615 8013931 0 0 4096 0 0 0 0 17 4 0 0 0
/proc/12245/statm: 8000 6936 392 1214 0 6782 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 32000

[startup+0.30101 s]
/proc/loadavg: 2.08 2.05 2.01 2/498 12245
/proc/meminfo: memFree=28978084/32951132 swapFree=57925096/67111528
[pid=12245] ppid=12243 vsize=63788 CPUtime=0.29 cores=0,2,4,6
/proc/12245/stat : 12245 (scip-2.0.1.4b.l) R 12243 12245 10513 0 -1 4202496 14884 0 0 0 28 1 0 0 25 0 1 0 823265968 65318912 14836 33554432000 4194304 9163163 140734379258784 18446744073709551615 4209406 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/12245/statm: 15947 14836 430 1214 0 14729 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 63788

[startup+0.700958 s]
/proc/loadavg: 2.08 2.05 2.01 2/498 12245
/proc/meminfo: memFree=28978084/32951132 swapFree=57925096/67111528
[pid=12245] ppid=12243 vsize=125484 CPUtime=0.69 cores=0,2,4,6
/proc/12245/stat : 12245 (scip-2.0.1.4b.l) R 12243 12245 10513 0 -1 4202496 29934 0 0 0 66 3 0 0 25 0 1 0 823265968 128495616 29886 33554432000 4194304 9163163 140734379258784 18446744073709551615 4782809 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/12245/statm: 31371 29886 505 1214 0 30153 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 125484

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

[startup+0.800939 s]
/proc/loadavg: 2.08 2.05 2.01 2/498 12245
/proc/meminfo: memFree=28978084/32951132 swapFree=57925096/67111528
[pid=12245] ppid=12243 vsize=134404 CPUtime=0.79 cores=0,2,4,6
/proc/12245/stat : 12245 (scip-2.0.1.4b.l) R 12243 12245 10513 0 -1 4202496 32194 0 0 0 76 3 0 0 25 0 1 0 823265968 137629696 32146 33554432000 4194304 9163163 140734379258784 18446744073709551615 6922376 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/12245/statm: 33601 32146 505 1214 0 32383 0
Current children cumulated CPU time (s) 0.79
Current children cumulated vsize (KiB) 134404

[startup+1.00091 s]
/proc/loadavg: 2.08 2.05 2.01 2/498 12245
/proc/meminfo: memFree=28978084/32951132 swapFree=57925096/67111528
[pid=12245] ppid=12243 vsize=146288 CPUtime=1 cores=0,2,4,6
/proc/12245/stat : 12245 (scip-2.0.1.4b.l) R 12243 12245 10513 0 -1 4202496 35005 0 0 0 96 4 0 0 25 0 1 0 823265968 149798912 34957 33554432000 4194304 9163163 140734379258784 18446744073709551615 5150800 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/12245/statm: 36572 34957 508 1214 0 35354 0
Current children cumulated CPU time (s) 1
Current children cumulated vsize (KiB) 146288

Child status: 0
Real time (s): 1.07709
CPU time (s): 1.07783
CPU user time (s): 1.02884
CPU system time (s): 0.048992
CPU usage (%): 100.069
Max. virtual memory (cumulated for all children) (KiB): 146288

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.02884
system time used= 0.048992
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 35892
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.017997 second user time and 0.019996 second system time

The end

Launcher Data 

Begin job on node129 at 2011-06-03 17:57:43
IDJOB=3451716
IDBENCH=75654
IDSOLVER=1948
FILE ID=node129/3451716-1307116663
RUNJOBID= node129-1307109434-11677
PBS_JOBID= 13497990
Free space on /tmp= 73852 MiB

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

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

MD5SUM BENCH= 899af7013bffd830ee31db3c8b2bc82e
RANDOM SEED=1593654325

node129.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.831
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.66
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.831
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	: 5332.83
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.831
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.831
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.831
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.831
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.83
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.831
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.831
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:     32951132 kB
MemFree:      28978372 kB
Buffers:        308556 kB
Cached:        2120316 kB
SwapCached:      49348 kB
Active:         536104 kB
Inactive:      3155832 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32951132 kB
LowFree:      28978372 kB
SwapTotal:    67111528 kB
SwapFree:     57925096 kB
Dirty:           13292 kB
Writeback:           0 kB
AnonPages:     1224548 kB
Mapped:          17920 kB
Slab:           153644 kB
PageTables:      59228 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83587092 kB
Committed_AS: 147439156 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    296000 kB
VmallocChunk: 34359440975 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 73840 MiB
End job on node129 at 2011-06-03 17:57:45