Trace number 3739673

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
PB11: SCIP spx E_2 2011-06-10 (fixed)UNSAT 1.38879 1.38886

General information on the benchmark

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

Solver Data 

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

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.1 (svn: 989)

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-3739673-1338736550/watcher-3739673-1338736550 -o /tmp/evaluation-result-3739673-1338736550/solver-3739673-1338736550 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739673-1338736550.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.00 2.00 3/176 16955
/proc/meminfo: memFree=28232188/32873844 swapFree=7632/7632
[pid=16955] ppid=16953 vsize=9588 CPUtime=0 cores=1,3,5,7
/proc/16955/stat : 16955 (scip-2.0.1.4b_2) R 16953 16955 12480 0 -1 4202496 1545 0 0 0 0 0 0 0 20 0 1 0 339779311 9818112 1499 33554432000 4194304 9016284 140735268832880 140733293915272 8082752 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/16955/statm: 2398 1502 326 1178 0 1216 0

[startup+0.0534601 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 16955
/proc/meminfo: memFree=28232188/32873844 swapFree=7632/7632
[pid=16955] ppid=16953 vsize=23044 CPUtime=0.05 cores=1,3,5,7
/proc/16955/stat : 16955 (scip-2.0.1.4b_2) R 16953 16955 12480 0 -1 4202496 4742 0 0 0 4 1 0 0 20 0 1 0 339779311 23597056 4696 33554432000 4194304 9016284 140735268832880 140733293915272 7928096 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/16955/statm: 5761 4697 357 1178 0 4579 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 23044

[startup+0.100319 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 16955
/proc/meminfo: memFree=28232188/32873844 swapFree=7632/7632
[pid=16955] ppid=16953 vsize=26952 CPUtime=0.09 cores=1,3,5,7
/proc/16955/stat : 16955 (scip-2.0.1.4b_2) R 16953 16955 12480 0 -1 4202496 5732 0 0 0 8 1 0 0 20 0 1 0 339779311 27598848 5686 33554432000 4194304 9016284 140735268832880 140733293915272 7987616 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/16955/statm: 6738 5686 357 1178 0 5556 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 26952

[startup+0.300325 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 16955
/proc/meminfo: memFree=28232188/32873844 swapFree=7632/7632
[pid=16955] ppid=16953 vsize=46436 CPUtime=0.29 cores=1,3,5,7
/proc/16955/stat : 16955 (scip-2.0.1.4b_2) R 16953 16955 12480 0 -1 4202496 10604 0 0 0 27 2 0 0 20 0 1 0 339779311 47550464 10558 33554432000 4194304 9016284 140735268832880 140733293915272 4445996 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/16955/statm: 11609 10558 357 1178 0 10427 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 46436

[startup+0.700326 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 16955
/proc/meminfo: memFree=28232188/32873844 swapFree=7632/7632
[pid=16955] ppid=16953 vsize=133580 CPUtime=0.69 cores=1,3,5,7
/proc/16955/stat : 16955 (scip-2.0.1.4b_2) R 16953 16955 12480 0 -1 4202496 31802 0 0 0 63 6 0 0 20 0 1 0 339779311 136785920 31729 33554432000 4194304 9016284 140735268832880 140735268828232 6480197 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/16955/statm: 33395 31729 484 1178 0 32213 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 133580

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

[startup+1.10692 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 16956
/proc/meminfo: memFree=28082380/32873844 swapFree=7632/7632
[pid=16955] ppid=16953 vsize=163164 CPUtime=1.09 cores=1,3,5,7
/proc/16955/stat : 16955 (scip-2.0.1.4b_2) R 16953 16955 12480 0 -1 4202496 39103 0 0 0 102 7 0 0 20 0 1 0 339779311 167079936 39030 33554432000 4194304 9016284 140735268832880 140735268828232 7875499 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/16955/statm: 40791 39030 484 1178 0 39609 0
Current children cumulated CPU time (s) 1.09
Current children cumulated vsize (KiB) 163164

[startup+1.30033 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 16956
/proc/meminfo: memFree=28082380/32873844 swapFree=7632/7632
[pid=16955] ppid=16953 vsize=167772 CPUtime=1.29 cores=1,3,5,7
/proc/16955/stat : 16955 (scip-2.0.1.4b_2) R 16953 16955 12480 0 -1 4202496 40800 0 0 0 121 8 0 0 20 0 1 0 339779311 171798528 40068 33554432000 4194304 9016284 140735268832880 140735268828232 5203696 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/16955/statm: 41943 40068 520 1178 0 40761 0
Current children cumulated CPU time (s) 1.29
Current children cumulated vsize (KiB) 167772

Child status: 0
Real time (s): 1.38886
CPU time (s): 1.38879
CPU user time (s): 1.2978
CPU system time (s): 0.090986
CPU usage (%): 99.995
Max. virtual memory (cumulated for all children) (KiB): 167772

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.2978
system time used= 0.090986
maximum resident set size= 161596
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 40812
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.001999 second user time and 0.010998 second system time

The end

Launcher Data 

Begin job on node141 at 2012-06-03 17:15:50
IDJOB=3739673
IDBENCH=74016
IDSOLVER=2329
FILE ID=node141/3739673-1338736550
RUNJOBID= node141-1338702880-12497
PBS_JOBID= 14636716
Free space on /tmp= 70704 MiB

SOLVER NAME= PB11: SCIP spx E_2 2011-06-10 (fixed)
BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j120/normalized-j1205_3-unsat.opb
COMMAND LINE= HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3739673-1338736550/watcher-3739673-1338736550 -o /tmp/evaluation-result-3739673-1338736550/solver-3739673-1338736550 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739673-1338736550.opb -t 1800 -m 15500

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

MD5SUM BENCH= d939386e9c2885a66e75196bb3e7e3bf
RANDOM SEED=2006876194

node141.alineos.net Linux 2.6.32-71.29.1.el6.x86_64 #1 SMP Mon Jun 27 19:49:27 BST 2011

/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.744
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
initial apicid	: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5333.48
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

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.744
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
initial apicid	: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

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.744
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
initial apicid	: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.93
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

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.744
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
initial apicid	: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.92
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

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.744
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
initial apicid	: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.92
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

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.744
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
initial apicid	: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

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.744
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
initial apicid	: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.92
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

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.744
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
initial apicid	: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32873844 kB
MemFree:        28232188 kB
Buffers:          418336 kB
Cached:          3214428 kB
SwapCached:          216 kB
Active:          1413936 kB
Inactive:        2342484 kB
Active(anon):     114396 kB
Inactive(anon):    11288 kB
Active(file):    1299540 kB
Inactive(file):  2331196 kB
Unevictable:        7632 kB
Mlocked:            7632 kB
SwapTotal:      67108856 kB
SwapFree:       67108640 kB
Dirty:             18360 kB
Writeback:             0 kB
AnonPages:        130392 kB
Mapped:            13424 kB
Shmem:               172 kB
Slab:             741240 kB
SReclaimable:     183420 kB
SUnreclaim:       557820 kB
KernelStack:        1472 kB
PageTables:         4096 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545776 kB
Committed_AS:     238260 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346368 kB
VmallocChunk:   34341987984 kB
HardwareCorrupted:     0 kB
AnonHugePages:    102400 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:        7872 kB
DirectMap2M:    33538048 kB

Free space on /tmp at the end= 70688 MiB
End job on node141 at 2012-06-03 17:15:51