Trace number 3739829

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.48877 1.49139

General information on the benchmark

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

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-3739829-1338737909/watcher-3739829-1338737909 -o /tmp/evaluation-result-3739829-1338737909/solver-3739829-1338737909 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739829-1338737909.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.18 2.06 2.01 3/174 879
/proc/meminfo: memFree=27906428/32873852 swapFree=7624/7624
[pid=879] ppid=877 vsize=9040 CPUtime=0 cores=1,3,5,7
/proc/879/stat : 879 (scip-2.0.1.4b_2) R 877 879 29314 0 -1 4202496 1085 0 0 0 0 0 0 0 20 0 1 0 339916364 9256960 1039 33554432000 4194304 9016284 140735906873392 140736685693832 4447263 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/879/statm: 2260 1049 190 1178 0 1078 0

[startup+0.034486 s]
/proc/loadavg: 2.18 2.06 2.01 3/174 879
/proc/meminfo: memFree=27906428/32873852 swapFree=7624/7624
[pid=879] ppid=877 vsize=19292 CPUtime=0.02 cores=1,3,5,7
/proc/879/stat : 879 (scip-2.0.1.4b_2) R 877 879 29314 0 -1 4202496 3798 0 0 0 2 0 0 0 20 0 1 0 339916364 19755008 3752 33554432000 4194304 9016284 140735906873392 140736685693832 7928096 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/879/statm: 4823 3752 357 1178 0 3641 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 19292

[startup+0.100342 s]
/proc/loadavg: 2.18 2.06 2.01 3/174 879
/proc/meminfo: memFree=27906428/32873852 swapFree=7624/7624
[pid=879] ppid=877 vsize=26948 CPUtime=0.09 cores=1,3,5,7
/proc/879/stat : 879 (scip-2.0.1.4b_2) R 877 879 29314 0 -1 4202496 5732 0 0 0 9 0 0 0 20 0 1 0 339916364 27594752 5686 33554432000 4194304 9016284 140735906873392 140735906737288 7870493 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/879/statm: 6737 5686 357 1178 0 5555 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 26948

[startup+0.300277 s]
/proc/loadavg: 2.18 2.06 2.01 3/174 879
/proc/meminfo: memFree=27906428/32873852 swapFree=7624/7624
[pid=879] ppid=877 vsize=47256 CPUtime=0.29 cores=1,3,5,7
/proc/879/stat : 879 (scip-2.0.1.4b_2) R 877 879 29314 0 -1 4202496 10606 0 0 0 28 1 0 0 20 0 1 0 339916364 48390144 10561 33554432000 4194304 9016284 140735906873392 140735906737288 7870589 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/879/statm: 11814 10581 396 1178 0 10632 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 47256

[startup+0.700316 s]
/proc/loadavg: 2.18 2.06 2.01 3/174 879
/proc/meminfo: memFree=27906428/32873852 swapFree=7624/7624
[pid=879] ppid=877 vsize=129480 CPUtime=0.69 cores=1,3,5,7
/proc/879/stat : 879 (scip-2.0.1.4b_2) R 877 879 29314 0 -1 4202496 30940 0 0 0 65 4 0 0 20 0 1 0 339916364 132587520 30891 33554432000 4194304 9016284 140735906873392 140735906737288 6817580 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/879/statm: 32370 30891 484 1178 0 31188 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 129480

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

[startup+1.10671 s]
/proc/loadavg: 2.18 2.06 2.01 3/175 880
/proc/meminfo: memFree=27755512/32873852 swapFree=7624/7624
[pid=879] ppid=877 vsize=161352 CPUtime=1.1 cores=1,3,5,7
/proc/879/stat : 879 (scip-2.0.1.4b_2) R 877 879 29314 0 -1 4202496 38880 0 0 0 104 6 0 0 20 0 1 0 339916364 165224448 38831 33554432000 4194304 9016284 140735906873392 140735906868744 4875334 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/879/statm: 40338 38831 484 1178 0 39156 0
Current children cumulated CPU time (s) 1.1
Current children cumulated vsize (KiB) 161352

[startup+1.30035 s]
/proc/loadavg: 2.18 2.06 2.01 3/175 880
/proc/meminfo: memFree=27755512/32873852 swapFree=7624/7624
[pid=879] ppid=877 vsize=170012 CPUtime=1.29 cores=1,3,5,7
/proc/879/stat : 879 (scip-2.0.1.4b_2) R 877 879 29314 0 -1 4202496 40822 0 0 0 123 6 0 0 20 0 1 0 339916364 174092288 40773 33554432000 4194304 9016284 140735906873392 140735906868744 6480389 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/879/statm: 42503 40773 484 1178 0 41321 0
Current children cumulated CPU time (s) 1.29
Current children cumulated vsize (KiB) 170012

[startup+1.40033 s]
/proc/loadavg: 2.18 2.06 2.01 3/175 880
/proc/meminfo: memFree=27755512/32873852 swapFree=7624/7624
[pid=879] ppid=877 vsize=171300 CPUtime=1.38 cores=1,3,5,7
/proc/879/stat : 879 (scip-2.0.1.4b_2) R 877 879 29314 0 -1 4202496 42084 0 0 0 132 6 0 0 20 0 1 0 339916364 175411200 41095 33554432000 4194304 9016284 140735906873392 140735906868744 4881037 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/879/statm: 42825 41095 520 1178 0 41643 0
Current children cumulated CPU time (s) 1.38
Current children cumulated vsize (KiB) 171300

Child status: 0
Real time (s): 1.49139
CPU time (s): 1.48877
CPU user time (s): 1.40579
CPU system time (s): 0.082987
CPU usage (%): 99.8243
Max. virtual memory (cumulated for all children) (KiB): 171300

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.40579
system time used= 0.082987
maximum resident set size= 167108
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 42096
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= 3

runsolver used 0.005999 second user time and 0.012998 second system time

The end

Launcher Data 

Begin job on node131 at 2012-06-03 17:38:29
IDJOB=3739829
IDBENCH=75100
IDSOLVER=2329
FILE ID=node131/3739829-1338737909
RUNJOBID= node131-1338713677-29331
PBS_JOBID= 14636738
Free space on /tmp= 71384 MiB

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

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

MD5SUM BENCH= 55b8067ae8df952812934475200b69c4
RANDOM SEED=1908334956

node131.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.805
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.61
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.805
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.805
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.91
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.805
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.91
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.805
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.91
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.805
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.805
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.805
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.92
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32873852 kB
MemFree:        27906700 kB
Buffers:          561516 kB
Cached:          3102012 kB
SwapCached:         2348 kB
Active:          1890640 kB
Inactive:        2205732 kB
Active(anon):     428536 kB
Inactive(anon):     3916 kB
Active(file):    1462104 kB
Inactive(file):  2201816 kB
Unevictable:        7624 kB
Mlocked:            7624 kB
SwapTotal:      67108856 kB
SwapFree:       67099088 kB
Dirty:             18248 kB
Writeback:             0 kB
AnonPages:        434556 kB
Mapped:            16948 kB
Shmem:                 0 kB
Slab:             728668 kB
SReclaimable:     171020 kB
SUnreclaim:       557648 kB
KernelStack:        1456 kB
PageTables:         4572 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545780 kB
Committed_AS:     558496 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346360 kB
VmallocChunk:   34341988004 kB
HardwareCorrupted:     0 kB
AnonHugePages:    335872 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= 71368 MiB
End job on node131 at 2012-06-03 17:38:31