Trace number 3489589

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_2 2011-06-10 (fixed)UNSAT 2.23666 2.23709

General information on the benchmark

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

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.1 (svn: 988)

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-3489589-1307790988/watcher-3489589-1307790988 -o /tmp/evaluation-result-3489589-1307790988/solver-3489589-1307790988 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3489589-1307790988.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 1.98 1.99 2/174 22115
/proc/meminfo: memFree=31875256/32950928 swapFree=67052112/67111528
[pid=22115] ppid=22113 vsize=12568 CPUtime=0 cores=1,3,5,7
/proc/22115/stat : 22115 (scip-2.0.1.4b_2) R 22113 22115 18976 0 -1 4202496 2139 0 0 0 0 0 0 0 24 0 1 0 890697561 12869632 2094 33554432000 4194304 9016284 140734414595824 18446744073709551615 6813403 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/22115/statm: 3142 2094 357 1178 0 1960 0

[startup+0.0234859 s]
/proc/loadavg: 1.92 1.98 1.99 2/174 22115
/proc/meminfo: memFree=31875256/32950928 swapFree=67052112/67111528
[pid=22115] ppid=22113 vsize=16968 CPUtime=0.01 cores=1,3,5,7
/proc/22115/stat : 22115 (scip-2.0.1.4b_2) R 22113 22115 18976 0 -1 4202496 3237 0 0 0 1 0 0 0 24 0 1 0 890697561 17375232 3191 33554432000 4194304 9016284 140734414595824 18446744073709551615 7870473 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/22115/statm: 4242 3191 357 1178 0 3060 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 16968

[startup+0.100475 s]
/proc/loadavg: 1.92 1.98 1.99 2/174 22115
/proc/meminfo: memFree=31875256/32950928 swapFree=67052112/67111528
[pid=22115] ppid=22113 vsize=29792 CPUtime=0.09 cores=1,3,5,7
/proc/22115/stat : 22115 (scip-2.0.1.4b_2) R 22113 22115 18976 0 -1 4202496 6445 0 0 0 9 0 0 0 24 0 1 0 890697561 30507008 6399 33554432000 4194304 9016284 140734414595824 18446744073709551615 4704602 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/22115/statm: 7448 6399 357 1178 0 6266 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 29792

[startup+0.300439 s]
/proc/loadavg: 1.92 1.98 1.99 2/174 22115
/proc/meminfo: memFree=31875256/32950928 swapFree=67052112/67111528
[pid=22115] ppid=22113 vsize=46660 CPUtime=0.29 cores=1,3,5,7
/proc/22115/stat : 22115 (scip-2.0.1.4b_2) R 22113 22115 18976 0 -1 4202496 10645 0 0 0 28 1 0 0 25 0 1 0 890697561 47779840 10599 33554432000 4194304 9016284 140734414595824 18446744073709551615 4595493 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/22115/statm: 11665 10599 357 1178 0 10483 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 46660

[startup+0.700369 s]
/proc/loadavg: 1.92 1.98 1.99 2/174 22115
/proc/meminfo: memFree=31875256/32950928 swapFree=67052112/67111528
[pid=22115] ppid=22113 vsize=153648 CPUtime=0.69 cores=1,3,5,7
/proc/22115/stat : 22115 (scip-2.0.1.4b_2) R 22113 22115 18976 0 -1 4202496 36701 0 0 0 65 4 0 0 25 0 1 0 890697561 157335552 36606 33554432000 4194304 9016284 140734414595824 18446744073709551615 6480372 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/22115/statm: 38412 36606 484 1178 0 37230 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 153648

[startup+1.50029 s]
/proc/loadavg: 1.92 1.98 1.99 3/178 22126
/proc/meminfo: memFree=31582600/32950928 swapFree=67052112/67111528
[pid=22115] ppid=22113 vsize=221736 CPUtime=1.49 cores=1,3,5,7
/proc/22115/stat : 22115 (scip-2.0.1.4b_2) R 22113 22115 18976 0 -1 4202496 53654 0 0 0 143 6 0 0 25 0 1 0 890697561 227057664 53559 33554432000 4194304 9016284 140734414595824 18446744073709551615 6480233 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/22115/statm: 55434 53559 484 1178 0 54252 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 221736

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

[startup+1.90022 s]
/proc/loadavg: 1.92 1.98 1.99 3/178 22126
/proc/meminfo: memFree=31582600/32950928 swapFree=67052112/67111528
[pid=22115] ppid=22113 vsize=241304 CPUtime=1.89 cores=1,3,5,7
/proc/22115/stat : 22115 (scip-2.0.1.4b_2) R 22113 22115 18976 0 -1 4202496 58432 0 0 0 182 7 0 0 25 0 1 0 890697561 247095296 58337 33554432000 4194304 9016284 140734414595824 18446744073709551615 6476244 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/22115/statm: 60326 58337 484 1178 0 59144 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 241304

[startup+2.10013 s]
/proc/loadavg: 1.92 1.98 1.99 3/178 22127
/proc/meminfo: memFree=31299848/32950928 swapFree=67052112/67111528
[pid=22115] ppid=22113 vsize=247796 CPUtime=2.1 cores=1,3,5,7
/proc/22115/stat : 22115 (scip-2.0.1.4b_2) R 22113 22115 18976 0 -1 4202496 60145 0 0 0 203 7 0 0 25 0 1 0 890697561 253743104 59699 33554432000 4194304 9016284 140734414595824 18446744073709551615 4351195 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/22115/statm: 61949 59699 494 1178 0 60767 0
Current children cumulated CPU time (s) 2.1
Current children cumulated vsize (KiB) 247796

[startup+2.2061 s]
/proc/loadavg: 1.92 1.98 1.99 3/178 22127
/proc/meminfo: memFree=31299848/32950928 swapFree=67052112/67111528
[pid=22115] ppid=22113 vsize=200192 CPUtime=2.19 cores=1,3,5,7
/proc/22115/stat : 22115 (scip-2.0.1.4b_2) R 22113 22115 18976 0 -1 4202496 61231 0 0 0 212 7 0 0 25 0 1 0 890697561 204996608 48102 33554432000 4194304 9016284 140734414595824 18446744073709551615 7933303 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/22115/statm: 49791 47849 522 1178 0 48609 0
Current children cumulated CPU time (s) 2.19
Current children cumulated vsize (KiB) 200192

Child status: 0
Real time (s): 2.23709
CPU time (s): 2.23666
CPU user time (s): 2.14967
CPU system time (s): 0.086986
CPU usage (%): 99.9809
Max. virtual memory (cumulated for all children) (KiB): 247796

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

runsolver used 0.003999 second user time and 0.014997 second system time

The end

Launcher Data 

Begin job on node120 at 2011-06-11 13:16:28
IDJOB=3489589
IDBENCH=73560
IDSOLVER=1979
FILE ID=node120/3489589-1307790988
RUNJOBID= node120-1307790988-22098
PBS_JOBID= 13550863
Free space on /tmp= 73928 MiB

SOLVER NAME= SCIP spx E_2 2011-06-10 (fixed)
BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j120/normalized-j12023_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-3489589-1307790988/watcher-3489589-1307790988 -o /tmp/evaluation-result-3489589-1307790988/solver-3489589-1307790988 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3489589-1307790988.opb -t 1800 -m 15500

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

MD5SUM BENCH= cab64fb449176610fb00692a41666b1e
RANDOM SEED=85603825

node120.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.809
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.61
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.809
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5226.07
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.809
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.82
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.809
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.809
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.78
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.809
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.809
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.809
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32950928 kB
MemFree:      31876064 kB
Buffers:        141844 kB
Cached:         753896 kB
SwapCached:      11492 kB
Active:         345180 kB
Inactive:       572028 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32950928 kB
LowFree:      31876064 kB
SwapTotal:    67111528 kB
SwapFree:     67052112 kB
Dirty:           23316 kB
Writeback:           0 kB
AnonPages:       18296 kB
Mapped:           8848 kB
Slab:            92228 kB
PageTables:       4268 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83586992 kB
Committed_AS:   192344 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= 73892 MiB
End job on node120 at 2011-06-11 13:16:30