Trace number 3451714

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.02484 1.02545

General information on the benchmark

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

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

running on 4 cores: 1,3,5,7

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: 1.92 2.00 1.99 3/575 25751
/proc/meminfo: memFree=23433804/32951124 swapFree=58940260/67111528
[pid=25751] ppid=25749 vsize=14976 CPUtime=0.01 cores=1,3,5,7
/proc/25751/stat : 25751 (scip-2.0.1.4b.l) R 25749 25751 23203 0 -1 4202496 2715 0 0 0 1 0 0 0 25 0 1 0 823268345 15335424 2668 33554432000 4194304 9163163 140736131122528 18446744073709551615 8041839 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/25751/statm: 3744 2668 392 1214 0 2526 0

[startup+0.0566119 s]
/proc/loadavg: 1.92 2.00 1.99 3/575 25751
/proc/meminfo: memFree=23433804/32951124 swapFree=58940260/67111528
[pid=25751] ppid=25749 vsize=21128 CPUtime=0.05 cores=1,3,5,7
/proc/25751/stat : 25751 (scip-2.0.1.4b.l) R 25749 25751 23203 0 -1 4202496 4260 0 0 0 5 0 0 0 25 0 1 0 823268345 21635072 4213 33554432000 4194304 9163163 140736131122528 18446744073709551615 8041854 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/25751/statm: 5282 4213 392 1214 0 4064 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 21128

[startup+0.100614 s]
/proc/loadavg: 1.92 2.00 1.99 3/575 25751
/proc/meminfo: memFree=23433804/32951124 swapFree=58940260/67111528
[pid=25751] ppid=25749 vsize=23792 CPUtime=0.09 cores=1,3,5,7
/proc/25751/stat : 25751 (scip-2.0.1.4b.l) R 25749 25751 23203 0 -1 4202496 4941 0 0 0 9 0 0 0 25 0 1 0 823268345 24363008 4894 33554432000 4194304 9163163 140736131122528 18446744073709551615 8031128 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/25751/statm: 5948 4894 392 1214 0 4730 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 23792

[startup+0.30057 s]
/proc/loadavg: 1.92 2.00 1.99 3/575 25751
/proc/meminfo: memFree=23433804/32951124 swapFree=58940260/67111528
[pid=25751] ppid=25749 vsize=63748 CPUtime=0.29 cores=1,3,5,7
/proc/25751/stat : 25751 (scip-2.0.1.4b.l) R 25749 25751 23203 0 -1 4202496 14914 0 0 0 28 1 0 0 25 0 1 0 823268345 65277952 14838 33554432000 4194304 9163163 140736131122528 18446744073709551615 4208463 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/25751/statm: 15937 14838 430 1214 0 14719 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 63748

[startup+0.700497 s]
/proc/loadavg: 1.92 2.00 1.99 3/575 25751
/proc/meminfo: memFree=23433804/32951124 swapFree=58940260/67111528
[pid=25751] ppid=25749 vsize=129900 CPUtime=0.69 cores=1,3,5,7
/proc/25751/stat : 25751 (scip-2.0.1.4b.l) R 25749 25751 23203 0 -1 4202496 31079 0 0 0 66 3 0 0 25 0 1 0 823268345 133017600 30969 33554432000 4194304 9163163 140736131122528 18446744073709551615 8045195 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/25751/statm: 32475 30969 505 1214 0 31257 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 129900

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

[startup+0.900459 s]
/proc/loadavg: 1.92 2.00 1.99 3/575 25751
/proc/meminfo: memFree=23433804/32951124 swapFree=58940260/67111528
[pid=25751] ppid=25749 vsize=138208 CPUtime=0.89 cores=1,3,5,7
/proc/25751/stat : 25751 (scip-2.0.1.4b.l) R 25749 25751 23203 0 -1 4202496 33102 0 0 0 86 3 0 0 25 0 1 0 823268345 141524992 32992 33554432000 4194304 9163163 140736131122528 18446744073709551615 8045195 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/25751/statm: 34552 32992 505 1214 0 33334 0
Current children cumulated CPU time (s) 0.89
Current children cumulated vsize (KiB) 138208

[startup+1.00044 s]
/proc/loadavg: 1.92 2.00 1.99 4/576 25752
/proc/meminfo: memFree=23314008/32951124 swapFree=58940260/67111528
[pid=25751] ppid=25749 vsize=102296 CPUtime=1 cores=1,3,5,7
/proc/25751/stat : 25751 (scip-2.0.1.4b.l) R 25749 25751 23203 0 -1 4202496 34504 0 0 0 97 3 0 0 18 0 1 0 823268345 104751104 24406 33554432000 4194304 9163163 140736131122528 18446744073709551615 6918339 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/25751/statm: 25574 24406 549 1214 0 24356 0
Current children cumulated CPU time (s) 1
Current children cumulated vsize (KiB) 102296

Child status: 0
Real time (s): 1.02545
CPU time (s): 1.02484
CPU user time (s): 0.98085
CPU system time (s): 0.043993
CPU usage (%): 99.9411
Max. virtual memory (cumulated for all children) (KiB): 138208

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.98085
system time used= 0.043993
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 34510
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= 4
involuntary context switches= 13

runsolver used 0.015997 second user time and 0.029995 second system time

The end

Launcher Data 

Begin job on node139 at 2011-06-03 17:58:26
IDJOB=3451714
IDBENCH=76548
IDSOLVER=1948
FILE ID=node139/3451714-1307116706
RUNJOBID= node139-1307109450-25185
PBS_JOBID= 13497985
Free space on /tmp= 73452 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-j6030_9-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-3451714-1307116706/watcher-3451714-1307116706 -o /tmp/evaluation-result-3451714-1307116706/solver-3451714-1307116706 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f HOME/instance-3451714-1307116706.opb -t 1800 -m 15500

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

MD5SUM BENCH= f9d555c8d7cd5b0fec309976f30b1d93
RANDOM SEED=2016073435

node139.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.852
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.70
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.852
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.75
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.852
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.74
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.852
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.852
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	: 5321.49
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.852
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.852
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.82
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.852
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.74
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32951124 kB
MemFree:      23434084 kB
Buffers:        250836 kB
Cached:         601068 kB
SwapCached:       3628 kB
Active:        8724512 kB
Inactive:       490064 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32951124 kB
LowFree:      23434084 kB
SwapTotal:    67111528 kB
SwapFree:     58940260 kB
Dirty:           13268 kB
Writeback:           0 kB
AnonPages:     8360652 kB
Mapped:          35904 kB
Slab:           152392 kB
PageTables:      79020 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83587088 kB
Committed_AS: 171047752 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= 73440 MiB
End job on node139 at 2011-06-03 17:58:27