Trace number 3729040

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)SAT 0.085986 0.086936

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/
prestwich/armies/normalized-army8.9ls.opb
MD5SUMf22ee27ae396dfbceb6d2e4359af424f
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0.045992
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables220
Total number of constraints332
Number of constraints which are clauses202
Number of constraints which are cardinality constraints (but not clauses)2
Number of constraints which are nor clauses,nor cardinality constraints128
Minimum length of a constraint2
Maximum length of a constraint64
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 9
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 73
Number of bits of the biggest sum of numbers7
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-3729040-1338680101.opb>
0.00/0.01	c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 332 constraints
0.00/0.01	c problem read
0.00/0.01	c No objective function, only one solution is needed.
0.00/0.01	c presolving settings loaded
0.00/0.01	c presolving:
0.00/0.01	c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 252 impls, 0 clqs
0.00/0.02	c (round 2) 8 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.00/0.02	c (round 3) 8 del vars, 8 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.00/0.02	c (round 4) 8 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.00/0.02	c presolving (5 rounds):
0.00/0.02	c  8 deleted vars, 12 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02	c  5244 implications, 0 cliques
0.00/0.02	c presolved problem has 212 variables (212 bin, 0 int, 0 impl, 0 cont) and 320 constraints
0.00/0.02	c     130 constraints of type <knapsack>
0.00/0.02	c     106 constraints of type <setppc>
0.00/0.02	c      84 constraints of type <logicor>
0.00/0.02	c transformed objective value is always integral (scale: 1)
0.00/0.02	c Presolving Time: 0.01
0.00/0.02	c - non default parameters ----------------------------------------------------------------------
0.00/0.02	c # SCIP version 2.0.1.5
0.00/0.02	c 
0.00/0.02	c # frequency for displaying node information lines
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02	c display/freq = 10000
0.00/0.02	c 
0.00/0.02	c # maximal time in seconds to run
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02	c limits/time = 1797
0.00/0.02	c 
0.00/0.02	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02	c limits/memory = 13950
0.00/0.02	c 
0.00/0.02	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c limits/solutions = 1
0.00/0.02	c 
0.00/0.02	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02	c separating/maxrounds = 1
0.00/0.02	c 
0.00/0.02	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c separating/maxroundsroot = 5
0.00/0.02	c 
0.00/0.02	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02	c # [type: int, range: [1,2], default: 1]
0.00/0.02	c timing/clocktype = 2
0.00/0.02	c 
0.00/0.02	c # belongs reading time to solving time?
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02	c timing/reading = TRUE
0.00/0.02	c 
0.00/0.02	c # should presolving try to simplify inequalities
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02	c constraints/linear/simplifyinequalities = TRUE
0.00/0.02	c 
0.00/0.02	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02	c constraints/indicator/addCouplingCons = TRUE
0.00/0.02	c 
0.00/0.02	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02	c constraints/knapsack/disaggregation = FALSE
0.00/0.02	c 
0.00/0.02	c # should presolving try to simplify knapsacks
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02	c 
0.00/0.02	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c presolving/probing/maxrounds = 0
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/coefdiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02	c heuristics/crossover/freq = -1
0.00/0.02	c 
0.00/0.02	c # number of nodes added to the contingent of the total nodes
0.00/0.02	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02	c heuristics/crossover/nodesofs = 750
0.00/0.02	c 
0.00/0.02	c # number of nodes without incumbent change that heuristic should wait
0.00/0.02	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02	c heuristics/crossover/nwaitingnodes = 100
0.00/0.02	c 
0.00/0.02	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02	c # [type: real, range: [0,1], default: 0.1]
0.00/0.02	c heuristics/crossover/nodesquot = 0.15
0.00/0.02	c 
0.00/0.02	c # minimum percentage of integer variables that have to be fixed 
0.00/0.02	c # [type: real, range: [0,1], default: 0.666]
0.00/0.02	c heuristics/crossover/minfixingrate = 0.5
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/feaspump/freq = -1
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/fracdiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/guideddiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/intshifting/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/linesearchdiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/objpscostdiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02	c # [type: real, range: [0,1], default: 0.01]
0.00/0.02	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/oneopt/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/pscostdiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c heuristics/rens/freq = -1
0.00/0.02	c 
0.00/0.02	c # minimum percentage of integer variables that have to be fixable 
0.00/0.02	c # [type: real, range: [0,1], default: 0.5]
0.00/0.02	c heuristics/rens/minfixingrate = 0.3
0.00/0.02	c 
0.00/0.02	c # number of nodes added to the contingent of the total nodes
0.00/0.02	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02	c heuristics/rens/nodesofs = 2000
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/rootsoldiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/rounding/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c heuristics/shiftandpropagate/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/shifting/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/simplerounding/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/subnlp/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c heuristics/trivial/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/trysol/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c heuristics/undercover/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/veclendiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/zirounding/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c separating/cmir/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c separating/flowcover/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c separating/rapidlearning/freq = 0
0.00/0.02	c 
0.00/0.02	c -----------------------------------------------------------------------------------------------
0.00/0.02	c start solving
0.00/0.02	c 
0.00/0.03	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.03	c   0.0s|     1 |     0 |    99 |     - |1369k|   0 |  57 | 212 | 320 | 212 | 320 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.00/0.07	c y 0.1s|     1 |     0 |    99 |     - |2091k|   0 |   - | 212 | 320 | 212 | 320 |   0 |   0 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.00/0.07	c   0.1s|     1 |     0 |    99 |     - |1896k|   0 |   - | 212 | 320 | 212 | 320 |   0 |   0 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.00/0.07	c 
0.00/0.07	c SCIP Status        : problem is solved [optimal solution found]
0.00/0.07	c Solving Time (sec) : 0.07
0.00/0.07	c Solving Nodes      : 1
0.00/0.07	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
0.00/0.07	c Dual Bound         : +0.00000000000000e+00
0.00/0.07	c Gap                : 0.00 %
0.00/0.07	s SATISFIABLE
0.00/0.07	v x219 -x220 x217 -x218 -x215 x216 -x213 x214 -x211 x212 -x209 -x210 -x207 -x208 -x205 -x206 x203 -x204 x201 -x202 x199 -x200 x197 
0.00/0.07	v -x198 x195 -x196 x193 -x194 -x191 x192 -x189 x190 -x187 x188 -x185 x186 -x183 -x184 -x181 x182 -x179 -x180 -x177 x178 -x175 
0.00/0.07	v -x176 -x173 -x174 x171 -x172 x169 -x170 x167 -x168 -x165 x166 x163 -x164 -x161 x162 x159 -x160 x157 -x158 -x155 x156 -x153 x154 
0.00/0.07	v x151 -x152 x149 -x150 -x147 x148 -x145 x146 x143 -x144 x141 -x142 x139 -x140 x137 -x138 -x135 x136 -x133 x134 -x131 x132 
0.00/0.07	v -x129 x130 -x128 x126 -x124 -x122 x120 x118 -x116 -x114 x112 -x110 -x108 -x106 x104 x102 -x100 -x98 x96 x94 -x92 -x90 -x88 -x86 
0.00/0.07	v -x84 -x82 -x80 x78 -x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 -x48 -x46 -x44 -x42 -x40 -x38 -x36 
0.00/0.07	v -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x127 -x125 -x123 -x121 -x119 -x117 -x115 
0.00/0.07	v -x113 -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 
0.00/0.08	v -x65 -x63 -x61 -x59 -x57 -x55 -x53 x51 -x49 -x47 -x45 x43 -x41 -x39 -x37 -x35 x33 -x31 -x29 x27 x25 -x23 -x21 x19 -x17 -x15 
0.00/0.08	v -x13 x11 x9 -x7 -x5 -x3 x1 
0.00/0.08	c SCIP Status        : problem is solved [optimal solution found]
0.00/0.08	c Total Time         :       0.07
0.00/0.08	c   solving          :       0.07
0.00/0.08	c   presolving       :       0.01 (included in solving)
0.00/0.08	c   reading          :       0.00 (included in solving)
0.00/0.08	c Original Problem   :
0.00/0.08	c   Problem name     : HOME/instance-3729040-1338680101.opb
0.00/0.08	c   Variables        : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.08	c   Constraints      : 332 initial, 332 maximal
0.00/0.08	c Presolved Problem  :
0.00/0.08	c   Problem name     : t_HOME/instance-3729040-1338680101.opb
0.00/0.08	c   Variables        : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.08	c   Constraints      : 320 initial, 320 maximal
0.00/0.08	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
0.00/0.08	c   trivial          :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.08	c   dualfix          :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.08	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.08	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.08	c   pseudoobj        :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.08	c   implics          :       0.00          0          8          0          0          0          0          0          0          0
0.00/0.08	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.08	c   knapsack         :       0.01          0          0          0          0          0          0          0          0          0
0.00/0.08	c   setppc           :       0.00          0          0          0          0          0         12          0          0          0
0.00/0.08	c   linear           :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.08	c   logicor          :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.08	c   root node        :          -          0          -          -          0          -          -          -          -          -
0.00/0.08	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
0.00/0.08	c   integral         :          0          0          0          0          0          4          0          0          0          0          0          0
0.00/0.08	c   knapsack         :        130          1          1          0          0          1          0          0          0        190          0          0
0.00/0.08	c   setppc           :        106          1          1          0          0          1          0          0          0          0          0          0
0.00/0.08	c   logicor          :         84          1          1          0          0          1          0          0          0          0          0          0
0.00/0.08	c   countsols        :          0          0          0          0          0          3          0          0          0          0          0          0
0.00/0.08	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
0.00/0.08	c   integral         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.00/0.08	c   knapsack         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.00/0.08	c   setppc           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.00/0.08	c   logicor          :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.00/0.08	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.00/0.08	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
0.00/0.08	c   vbounds          :          0          0          0          0
0.00/0.08	c   rootredcost      :          0          0          0          0
0.00/0.08	c   pseudoobj        :          0          0          0          0
0.00/0.08	c Propagator Timings :  TotalTime  Propagate    Resprop
0.00/0.08	c   vbounds          :       0.00       0.00       0.00
0.00/0.08	c   rootredcost      :       0.00       0.00       0.00
0.00/0.08	c   pseudoobj        :       0.00       0.00       0.00
0.00/0.08	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.00/0.08	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.00/0.08	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.08	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.08	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.08	c   pseudo solution  :       0.00          1          0          0        0.0          0        0.0          -
0.00/0.08	c   applied globally :          -          -          -          0        0.0          -          -          -
0.00/0.08	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.00/0.08	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.00/0.08	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 410)
0.00/0.08	c   redcost          :       0.00          1          0          0          0          0
0.00/0.08	c   impliedbounds    :       0.00          1          0          0        211          0
0.00/0.08	c   intobj           :       0.00          0          0          0          0          0
0.00/0.08	c   gomory           :       0.00          1          0          0        147          0
0.00/0.08	c   cgmip            :       0.00          0          0          0          0          0
0.00/0.08	c   closecuts        :       0.00          0          0          0          0          0
0.00/0.08	c   strongcg         :       0.00          1          0          0        147          0
0.00/0.08	c   cmir             :       0.00          0          0          0          0          0
0.00/0.08	c   flowcover        :       0.00          0          0          0          0          0
0.00/0.08	c   clique           :       0.01          1          0          0          0          0
0.00/0.08	c   zerohalf         :       0.00          0          0          0          0          0
0.00/0.08	c   mcf              :       0.00          1          0          0          0          0
0.00/0.08	c   oddcycle         :       0.00          0          0          0          0          0
0.00/0.08	c   rapidlearning    :       0.04          1          0          0          0          0
0.00/0.08	c Pricers            :       Time      Calls       Vars
0.00/0.08	c   problem variables:       0.00          0          0
0.00/0.08	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.00/0.08	c   pscost           :       0.00          0          0          0          0          0          0
0.00/0.08	c   inference        :       0.00          0          0          0          0          0          0
0.00/0.08	c   mostinf          :       0.00          0          0          0          0          0          0
0.00/0.08	c   leastinf         :       0.00          0          0          0          0          0          0
0.00/0.08	c   fullstrong       :       0.00          0          0          0          0          0          0
0.00/0.08	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.00/0.08	c   random           :       0.00          0          0          0          0          0          0
0.00/0.08	c   relpscost        :       0.00          0          0          0          0          0          0
0.00/0.08	c Primal Heuristics  :       Time      Calls      Found
0.00/0.08	c   LP solutions     :       0.00          -          0
0.00/0.08	c   pseudo solutions :       0.00          -          0
0.00/0.08	c   trivial          :       0.00          1          0
0.00/0.08	c   shiftandpropagate:       0.00          0          0
0.00/0.08	c   simplerounding   :       0.00          0          0
0.00/0.08	c   zirounding       :       0.00          0          0
0.00/0.08	c   rounding         :       0.00          0          0
0.00/0.08	c   shifting         :       0.00          0          0
0.00/0.08	c   intshifting      :       0.00          0          0
0.00/0.08	c   oneopt           :       0.00          0          0
0.00/0.08	c   twoopt           :       0.00          0          0
0.00/0.08	c   fixandinfer      :       0.00          0          0
0.00/0.08	c   feaspump         :       0.00          0          0
0.00/0.08	c   clique           :       0.00          0          0
0.00/0.08	c   coefdiving       :       0.00          0          0
0.00/0.08	c   pscostdiving     :       0.00          0          0
0.00/0.08	c   fracdiving       :       0.00          0          0
0.00/0.08	c   veclendiving     :       0.00          0          0
0.00/0.08	c   intdiving        :       0.00          0          0
0.00/0.08	c   actconsdiving    :       0.00          0          0
0.00/0.08	c   objpscostdiving  :       0.00          0          0
0.00/0.08	c   rootsoldiving    :       0.00          0          0
0.00/0.08	c   linesearchdiving :       0.00          0          0
0.00/0.08	c   guideddiving     :       0.00          0          0
0.00/0.08	c   octane           :       0.00          0          0
0.00/0.08	c   rens             :       0.00          0          0
0.00/0.08	c   rins             :       0.00          0          0
0.00/0.08	c   localbranching   :       0.00          0          0
0.00/0.08	c   mutation         :       0.00          0          0
0.00/0.08	c   crossover        :       0.00          0          0
0.00/0.08	c   dins             :       0.00          0          0
0.00/0.08	c   vbounds          :       0.00          0          0
0.00/0.08	c   undercover       :       0.00          0          0
0.00/0.08	c   subnlp           :       0.00          0          0
0.00/0.08	c   trysol           :       0.00          0          0
0.00/0.08	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.00/0.08	c   primal LP        :       0.00          0          0       0.00          -
0.00/0.08	c   dual LP          :       0.00          1         99      99.00          -
0.00/0.08	c   lex dual LP      :       0.00          0          0       0.00          -
0.00/0.08	c   barrier LP       :       0.00          0          0       0.00          -
0.00/0.08	c   diving/probing LP:       0.00          0          0       0.00          -
0.00/0.08	c   strong branching :       0.00          0          0       0.00          -
0.00/0.08	c     (at root node) :          -          0          0       0.00          -
0.00/0.08	c   conflict analysis:       0.00          0          0       0.00          -
0.00/0.08	c B&B Tree           :
0.00/0.08	c   number of runs   :          1
0.00/0.08	c   nodes            :          1
0.00/0.08	c   nodes (total)    :          1
0.00/0.08	c   nodes left       :          0
0.00/0.08	c   max depth        :          0
0.00/0.08	c   max depth (total):          0
0.00/0.08	c   backtracks       :          0 (0.0%)
0.00/0.08	c   delayed cutoffs  :          0
0.00/0.08	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.00/0.08	c   avg switch length:       2.00
0.00/0.08	c   switching time   :       0.00
0.00/0.08	c Solution           :
0.00/0.08	c   Solutions found  :          1 (1 improvements)
0.00/0.08	c   First Solution   : +0.00000000000000e+00   (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <trysol>)
0.00/0.08	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <trysol>)
0.00/0.08	c   Dual Bound       : +0.00000000000000e+00
0.00/0.08	c   Gap              :       0.00 %
0.00/0.08	c   Root Dual Bound  : +0.00000000000000e+00
0.00/0.08	c   Root Iterations  :         99
0.00/0.08	c Time complete: 0.08.

Verifier Data 

OK	0

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-3729040-1338680101/watcher-3729040-1338680101 -o /tmp/evaluation-result-3729040-1338680101/solver-3729040-1338680101 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3729040-1338680101.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.11 1.94 1.30 3/176 1842
/proc/meminfo: memFree=27774844/32873844 swapFree=7128/7128
[pid=1842] ppid=1840 vsize=9588 CPUtime=0 cores=1,3,5,7
/proc/1842/stat : 1842 (scip-2.0.1.4b_2) R 1840 1842 25330 0 -1 4202496 1531 0 0 0 0 0 0 0 20 0 1 0 334077150 9818112 1485 33554432000 4194304 9016284 140734768987440 140734768986072 7824814 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/1842/statm: 2397 1494 318 1178 0 1215 0

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

Child status: 0
Real time (s): 0.086936
CPU time (s): 0.085986
CPU user time (s): 0.073988
CPU system time (s): 0.011998
CPU usage (%): 98.9073
Max. virtual memory (cumulated for all children) (KiB): 0

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.073988
system time used= 0.011998
maximum resident set size= 28424
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 7420
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.000999 second user time and 0.004999 second system time

The end

Launcher Data 

Begin job on node105 at 2012-06-03 01:35:01
IDJOB=3729040
IDBENCH=1162
IDSOLVER=2329
FILE ID=node105/3729040-1338680101
RUNJOBID= node105-1338679210-1718
PBS_JOBID= 14636708
Free space on /tmp= 71260 MiB

SOLVER NAME= PB11: SCIP spx E_2 2011-06-10 (fixed)
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/prestwich/armies/normalized-army8.9ls.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-3729040-1338680101/watcher-3729040-1338680101 -o /tmp/evaluation-result-3729040-1338680101/solver-3729040-1338680101 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3729040-1338680101.opb -t 1800 -m 15500

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

MD5SUM BENCH= f22ee27ae396dfbceb6d2e4359af424f
RANDOM SEED=456315582

node105.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.882
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.76
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.882
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.882
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.882
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.882
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	: 5438.54
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.882
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.882
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.882
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	: 5447.81
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32873844 kB
MemFree:        27775208 kB
Buffers:          539056 kB
Cached:          3533016 kB
SwapCached:         1700 kB
Active:          1171752 kB
Inactive:        3046676 kB
Active(anon):     142588 kB
Inactive(anon):     4808 kB
Active(file):    1029164 kB
Inactive(file):  3041868 kB
Unevictable:        7128 kB
Mlocked:            7128 kB
SwapTotal:      67108856 kB
SwapFree:       67100456 kB
Dirty:             16684 kB
Writeback:            12 kB
AnonPages:        150720 kB
Mapped:            11652 kB
Shmem:                 0 kB
Slab:             740372 kB
SReclaimable:     181984 kB
SUnreclaim:       558388 kB
KernelStack:        1448 kB
PageTables:         4256 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545776 kB
Committed_AS:     267060 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346368 kB
VmallocChunk:   34341987984 kB
HardwareCorrupted:     0 kB
AnonHugePages:    114688 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= 71244 MiB
End job on node105 at 2012-06-03 01:35:02