Trace number 3451663

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 2.33464 2.33497

General information on the benchmark

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

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-3451663-1307116502/watcher-3451663-1307116502 -o /tmp/evaluation-result-3451663-1307116502/solver-3451663-1307116502 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f HOME/instance-3451663-1307116502.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: 2.00 2.02 2.00 2/488 12436
/proc/meminfo: memFree=21013808/32951124 swapFree=46575304/67111528
[pid=12436] ppid=12434 vsize=13008 CPUtime=0 cores=1,3,5,7
/proc/12436/stat : 12436 (scip-2.0.1.4b.l) R 12434 12436 5006 0 -1 4202496 2230 0 0 0 0 0 0 0 25 0 1 0 555841448 13320192 2185 33554432000 4194304 9163163 140735576458656 18446744073709551615 8013931 0 0 4096 0 0 0 0 17 3 0 0 0
/proc/12436/statm: 3252 2185 392 1214 0 2034 0

[startup+0.0798239 s]
/proc/loadavg: 2.00 2.02 2.00 2/488 12436
/proc/meminfo: memFree=21013808/32951124 swapFree=46575304/67111528
[pid=12436] ppid=12434 vsize=27656 CPUtime=0.07 cores=1,3,5,7
/proc/12436/stat : 12436 (scip-2.0.1.4b.l) R 12434 12436 5006 0 -1 4202496 5902 0 0 0 7 0 0 0 25 0 1 0 555841448 28319744 5856 33554432000 4194304 9163163 140735576458656 18446744073709551615 6922749 0 0 4096 0 0 0 0 17 3 0 0 0
/proc/12436/statm: 6914 5856 392 1214 0 5696 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 27656

[startup+0.100815 s]
/proc/loadavg: 2.00 2.02 2.00 2/488 12436
/proc/meminfo: memFree=21013808/32951124 swapFree=46575304/67111528
[pid=12436] ppid=12434 vsize=30056 CPUtime=0.09 cores=1,3,5,7
/proc/12436/stat : 12436 (scip-2.0.1.4b.l) R 12434 12436 5006 0 -1 4202496 6509 0 0 0 9 0 0 0 25 0 1 0 555841448 30777344 6463 33554432000 4194304 9163163 140735576458656 18446744073709551615 8041854 0 0 4096 0 0 0 0 17 3 0 0 0
/proc/12436/statm: 7514 6463 392 1214 0 6296 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 30056

[startup+0.300781 s]
/proc/loadavg: 2.00 2.02 2.00 2/488 12436
/proc/meminfo: memFree=21013808/32951124 swapFree=46575304/67111528
[pid=12436] ppid=12434 vsize=43136 CPUtime=0.29 cores=1,3,5,7
/proc/12436/stat : 12436 (scip-2.0.1.4b.l) R 12434 12436 5006 0 -1 4202496 9770 0 0 0 28 1 0 0 25 0 1 0 555841448 44171264 9724 33554432000 4194304 9163163 140735576458656 18446744073709551615 8034196 0 0 4096 0 0 0 0 17 3 0 0 0
/proc/12436/statm: 10784 9724 392 1214 0 9566 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 43136

[startup+0.700715 s]
/proc/loadavg: 2.00 2.02 2.00 2/488 12436
/proc/meminfo: memFree=21013808/32951124 swapFree=46575304/67111528
[pid=12436] ppid=12434 vsize=128932 CPUtime=0.69 cores=1,3,5,7
/proc/12436/stat : 12436 (scip-2.0.1.4b.l) R 12434 12436 5006 0 -1 4202496 31076 0 0 0 66 3 0 0 25 0 1 0 555841448 132026368 30937 33554432000 4194304 9163163 140735576458656 18446744073709551615 4207745 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/12436/statm: 32233 30937 430 1214 0 31015 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 128932

[startup+1.50057 s]
/proc/loadavg: 2.00 2.02 2.00 3/489 12437
/proc/meminfo: memFree=20832768/32951124 swapFree=46575304/67111528
[pid=12436] ppid=12434 vsize=244624 CPUtime=1.49 cores=1,3,5,7
/proc/12436/stat : 12436 (scip-2.0.1.4b.l) R 12434 12436 5006 0 -1 4202496 59449 0 0 0 144 5 0 0 25 0 1 0 555841448 250494976 59310 33554432000 4194304 9163163 140735576458656 18446744073709551615 4352480 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/12436/statm: 61156 59310 505 1214 0 59938 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 244624

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

[startup+1.9005 s]
/proc/loadavg: 2.00 2.02 2.00 3/489 12437
/proc/meminfo: memFree=20832768/32951124 swapFree=46575304/67111528
[pid=12436] ppid=12434 vsize=274308 CPUtime=1.89 cores=1,3,5,7
/proc/12436/stat : 12436 (scip-2.0.1.4b.l) R 12434 12436 5006 0 -1 4202496 66705 0 0 0 183 6 0 0 25 0 1 0 555841448 280891392 66566 33554432000 4194304 9163163 140735576458656 18446744073709551615 6567801 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/12436/statm: 68577 66566 505 1214 0 67359 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 274308

[startup+2.30043 s]
/proc/loadavg: 2.00 2.02 2.00 3/489 12437
/proc/meminfo: memFree=20739396/32951124 swapFree=46575304/67111528
[pid=12436] ppid=12434 vsize=203832 CPUtime=2.29 cores=1,3,5,7
/proc/12436/stat : 12436 (scip-2.0.1.4b.l) R 12434 12436 5006 0 -1 4202496 70207 0 0 0 222 7 0 0 18 0 1 0 555841448 208723968 49255 33554432000 4194304 9163163 140735576458656 18446744073709551615 6918303 0 0 4096 0 0 0 0 17 3 0 0 0
/proc/12436/statm: 50958 49255 549 1214 0 49740 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 203832

Child status: 0
Real time (s): 2.33497
CPU time (s): 2.33464
CPU user time (s): 2.24666
CPU system time (s): 0.087986
CPU usage (%): 99.986
Max. virtual memory (cumulated for all children) (KiB): 282120

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.24666
system time used= 0.087986
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 70213
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.009998 second user time and 0.045993 second system time

The end

Launcher Data 

Begin job on node107 at 2011-06-03 17:55:02
IDJOB=3451663
IDBENCH=74540
IDSOLVER=1948
FILE ID=node107/3451663-1307116502
RUNJOBID= node107-1307109233-11868
PBS_JOBID= 13497967
Free space on /tmp= 73844 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/j120/normalized-j12013_1-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-3451663-1307116502/watcher-3451663-1307116502 -o /tmp/evaluation-result-3451663-1307116502/solver-3451663-1307116502 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f HOME/instance-3451663-1307116502.opb -t 1800 -m 15500

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

MD5SUM BENCH= 4ae026821d0930247b1eee2eafe8a46e
RANDOM SEED=694137359

node107.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.829
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.829
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.829
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.67
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.829
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.829
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.829
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	: 5359.47
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.829
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.829
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:     32951124 kB
MemFree:      21014096 kB
Buffers:        313996 kB
Cached:        2096648 kB
SwapCached:      22548 kB
Active:        9636292 kB
Inactive:      1949516 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32951124 kB
LowFree:      21014096 kB
SwapTotal:    67111528 kB
SwapFree:     46575304 kB
Dirty:           18676 kB
Writeback:           0 kB
AnonPages:     9170412 kB
Mapped:          35352 kB
Slab:           186184 kB
PageTables:      95708 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83587088 kB
Committed_AS: 145584428 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= 73832 MiB
End job on node107 at 2011-06-03 17:55:04