Trace number 2667127

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
SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverSAT 15.0917 15.0957

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/
prestwich/armies/normalized-army8.9bt.opb
MD5SUM41a419a7ef36b132b62f2564e794a725
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.205968
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 constraints470
Number of constraints which are clauses333
Number of constraints which are cardinality constraints (but not clauses)2
Number of constraints which are nor clauses,nor cardinality constraints135
Minimum length of a constraint1
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 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00	c Copyright (c) 2002-2010 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-2667127-1276268894.opb>
0.00/0.02	c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 470 constraints
0.00/0.02	c problem read
0.00/0.02	c No objective function, only one solution is needed.
0.00/0.02	c presolving settings loaded
0.01/0.02	c presolving:
0.01/0.03	c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.01/0.03	c (round 2) 13 del vars, 17 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.01/0.03	c (round 3) 13 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.01/0.05	c (round 4) 13 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 256 impls, 0 clqs
0.01/0.05	c (round 5) 19 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.01/0.06	c presolving (6 rounds):
0.01/0.06	c  19 deleted vars, 27 deleted constraints, 11 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.06	c  4704 implications, 6 cliques
0.01/0.06	c presolved problem has 201 variables (201 bin, 0 int, 0 impl, 0 cont) and 443 constraints
0.01/0.06	c     129 constraints of type <knapsack>
0.01/0.06	c     314 constraints of type <logicor>
0.01/0.06	c transformed objective value is always integral (scale: 1)
0.01/0.06	c Presolving Time: 0.02
0.01/0.06	c - non default parameters ----------------------------------------------------------------------
0.01/0.06	c # SCIP version 1.2.1.2
0.01/0.06	c 
0.01/0.06	c # frequency for displaying node information lines
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.06	c display/freq = 10000
0.01/0.06	c 
0.01/0.06	c # maximal time in seconds to run
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06	c limits/time = 1799.99
0.01/0.06	c 
0.01/0.06	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06	c limits/memory = 1620
0.01/0.06	c 
0.01/0.06	c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06	c limits/solutions = 1
0.01/0.06	c 
0.01/0.06	c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.06	c separating/maxrounds = 1
0.01/0.06	c 
0.01/0.06	c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06	c separating/maxroundsroot = 5
0.01/0.06	c 
0.01/0.06	c # should presolving try to simplify inequalities
0.01/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06	c constraints/linear/simplifyinequalities = TRUE
0.01/0.06	c 
0.01/0.06	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.06	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.06	c constraints/knapsack/disaggregation = FALSE
0.01/0.06	c 
0.01/0.06	c # should presolving try to simplify knapsacks
0.01/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06	c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.06	c 
0.01/0.06	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06	c presolving/probing/maxrounds = 0
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/coefdiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.06	c heuristics/crossover/freq = -1
0.01/0.06	c 
0.01/0.06	c # number of nodes added to the contingent of the total nodes
0.01/0.06	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06	c heuristics/crossover/nodesofs = 750
0.01/0.06	c 
0.01/0.06	c # number of nodes without incumbent change that heuristic should wait
0.01/0.06	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.06	c heuristics/crossover/nwaitingnodes = 100
0.01/0.06	c 
0.01/0.06	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.06	c # [type: real, range: [0,1], default: 0.1]
0.01/0.06	c heuristics/crossover/nodesquot = 0.15
0.01/0.06	c 
0.01/0.06	c # minimum percentage of integer variables that have to be fixed 
0.01/0.06	c # [type: real, range: [0,1], default: 0.666]
0.01/0.06	c heuristics/crossover/minfixingrate = 0.5
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06	c heuristics/feaspump/freq = -1
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/fracdiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/guideddiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/intshifting/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/linesearchdiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/nlp/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06	c heuristics/objpscostdiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.06	c # [type: real, range: [0,1], default: 0.01]
0.01/0.06	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/oneopt/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/pscostdiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06	c heuristics/rens/freq = -1
0.01/0.06	c 
0.01/0.06	c # minimum percentage of integer variables that have to be fixable 
0.01/0.06	c # [type: real, range: [0,1], default: 0.5]
0.01/0.06	c heuristics/rens/minfixingrate = 0.3
0.01/0.06	c 
0.01/0.06	c # number of nodes added to the contingent of the total nodes
0.01/0.06	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06	c heuristics/rens/nodesofs = 2000
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06	c heuristics/rootsoldiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.06	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/rounding/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/shifting/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/simplerounding/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06	c heuristics/trivial/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/trysol/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/veclendiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/zirounding/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06	c separating/cmir/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06	c separating/flowcover/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06	c separating/rapidlearning/freq = 0
0.01/0.06	c 
0.01/0.06	c -----------------------------------------------------------------------------------------------
0.01/0.06	c start solving
0.01/0.06	c 
0.01/0.09	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.01/0.09	c   0.1s|     1 |     0 |   269 |     - |1443k|   0 | 116 | 201 | 443 | 201 | 437 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.39/0.49	c   0.4s|     1 |     0 |   625 |     - |2660k|   0 | 152 | 201 | 526 | 201 | 675 | 238 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.69/0.75	c   0.7s|     1 |     0 |   940 |     - |4456k|   0 | 176 | 201 | 526 | 201 | 752 | 315 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.00/1.02	c   0.9s|     1 |     0 |  1203 |     - |6151k|   0 | 184 | 201 | 526 | 201 | 789 | 352 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.29/1.33	c   1.2s|     1 |     0 |  1522 |     - |8100k|   0 | 182 | 201 | 526 | 201 | 819 | 382 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.59/1.64	c   1.6s|     1 |     0 |  1811 |     - |  10M|   0 | 174 | 201 | 526 | 201 | 850 | 413 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
3.49/3.53	c   3.4s|     1 |     2 |  1811 |     - |  10M|   0 | 174 | 201 | 526 | 201 | 850 | 413 |   0 |   9 | 0.000000e+00 |      --      |    Inf 
14.99/15.08	c *14.7s|   427 |     0 | 13326 |  27.0 |  10M|  19 |   - | 201 | 747 | 201 | 585 | 413 | 225 |1169 | 0.000000e+00 | 0.000000e+00 |   0.00%
14.99/15.08	c 
14.99/15.08	c SCIP Status        : problem is solved [optimal solution found]
14.99/15.08	c Solving Time (sec) : 14.69
14.99/15.08	c Solving Nodes      : 427
14.99/15.08	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
14.99/15.08	c Dual Bound         : +0.00000000000000e+00
14.99/15.08	c Gap                : 0.00 %
14.99/15.08	s SATISFIABLE
14.99/15.08	v x219 -x220 x217 -x218 x215 -x216 x213 -x214 x211 -x212 x209 -x210 x207 -x208 -x205 -x206 -x203 -x204 x201 -x202 x199 -x200 -x197 
14.99/15.08	v x198 -x195 x196 x193 -x194 x191 -x192 x189 -x190 x187 -x188 -x185 x186 -x183 x184 -x181 x182 -x179 -x180 -x177 -x178 -x175 
14.99/15.08	v -x176 -x173 -x174 -x171 x172 -x169 x170 -x167 x168 -x165 x166 -x163 x164 -x161 x162 x159 -x160 x157 -x158 x155 -x156 -x153 x154 
14.99/15.08	v -x151 x152 -x149 x150 -x147 x148 -x145 x146 -x143 x144 -x141 x142 x139 -x140 x137 -x138 -x135 x136 -x133 x134 x131 -x132 x129 
14.99/15.08	v -x130 -x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98 x96 x94 -x92 -x90 -x88 
14.99/15.08	v -x86 -x84 -x82 x80 -x78 -x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 -x48 -x46 -x44 -x42 -x40 -x38 
14.99/15.08	v -x36 -x34 x32 x30 x28 -x26 -x24 -x22 -x20 -x18 x16 x14 x12 -x10 -x8 -x6 -x4 -x2 -x127 -x125 -x123 -x121 x119 x117 -x115 -x113 
14.99/15.08	v -x111 -x109 -x107 x105 x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65 
14.99/15.08	v -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 -x13 
14.99/15.08	v -x11 -x9 -x7 -x5 -x3 -x1 
14.99/15.08	c SCIP Status        : problem is solved [optimal solution found]
14.99/15.08	c Solving Time       :      14.69
14.99/15.08	c Original Problem   :
14.99/15.08	c   Problem name     : HOME/instance-2667127-1276268894.opb
14.99/15.08	c   Variables        : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
14.99/15.08	c   Constraints      : 470 initial, 470 maximal
14.99/15.08	c Presolved Problem  :
14.99/15.08	c   Problem name     : t_HOME/instance-2667127-1276268894.opb
14.99/15.08	c   Variables        : 201 (201 binary, 0 integer, 0 implicit integer, 0 continuous)
14.99/15.08	c   Constraints      : 443 initial, 747 maximal
14.99/15.08	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
14.99/15.08	c   trivial          :       0.00          0          0          0          0          0          0          0          0
14.99/15.08	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
14.99/15.08	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
14.99/15.08	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
14.99/15.08	c   implics          :       0.00          0          8          0          0          0          0          0          0
14.99/15.08	c   probing          :       0.00          0          0          0          0          0          0          0          0
14.99/15.08	c   knapsack         :       0.01          0          0          0          0          0          0          0          0
14.99/15.08	c   linear           :       0.01         11          0          0         11          0         27          0          0
14.99/15.08	c   logicor          :       0.00          0          0          0          0          0          0          0          0
14.99/15.08	c   root node        :          -          0          -          -          0          -          -          -          -
14.99/15.08	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
14.99/15.08	c   integral         :          0          0          0        315          0          7        144          0          0        496
14.99/15.08	c   knapsack         :        129          5       1913          1          0        151       4653        506          0          0
14.99/15.08	c   linear           :          0+         5       1225          0          0          0          6          1          0          0
14.99/15.08	c   logicor          :        314+         5       1429          1          0         34       2879          0          0          0
14.99/15.08	c   countsols        :          0          0          0          1          0          0          0          0          0          0
14.99/15.08	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
14.99/15.08	c   integral         :      11.08       0.00       0.00      11.08       0.00
14.99/15.08	c   knapsack         :       0.04       0.00       0.04       0.00       0.00
14.99/15.08	c   linear           :       0.00       0.00       0.00       0.00       0.00
14.99/15.08	c   logicor          :       0.02       0.00       0.02       0.00       0.00
14.99/15.08	c   countsols        :       0.00       0.00       0.00       0.00       0.00
14.99/15.08	c Propagators        :       Time      Calls    Cutoffs    DomReds
14.99/15.08	c   vbounds          :       0.00          1          0          0
14.99/15.08	c   rootredcost      :       0.00          0          0          0
14.99/15.08	c   pseudoobj        :       0.00          0          0          0
14.99/15.08	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
14.99/15.08	c   propagation      :       0.02        185        151       1018       47.6          4       19.8          -
14.99/15.08	c   infeasible LP    :       0.02         28          0          0        0.0          0        0.0          0
14.99/15.08	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
14.99/15.08	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
14.99/15.08	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
14.99/15.08	c   applied globally :          -          -          -        221       13.9          -          -          -
14.99/15.08	c   applied locally  :          -          -          -          4       73.5          -          -          -
14.99/15.08	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
14.99/15.08	c   cut pool         :       0.02          4          -          -         37          -    (maximal pool size: 2410)
14.99/15.08	c   redcost          :       0.00        275          0          0          0          0
14.99/15.08	c   impliedbounds    :       0.00          5          0          0        662          0
14.99/15.08	c   intobj           :       0.00          0          0          0          0          0
14.99/15.08	c   cgmip            :       0.00          0          0          0          0          0
14.99/15.08	c   gomory           :       0.37          5          0          0        120          0
14.99/15.08	c   strongcg         :       0.41          5          0          0       2351          0
14.99/15.08	c   cmir             :       0.00          0          0          0          0          0
14.99/15.08	c   flowcover        :       0.00          0          0          0          0          0
14.99/15.08	c   clique           :       0.00          5          0          0         17          0
14.99/15.08	c   zerohalf         :       0.00          0          0          0          0          0
14.99/15.08	c   mcf              :       0.00          1          0          0          0          0
14.99/15.08	c   rapidlearning    :       0.17          1          0          0          0         83
14.99/15.08	c Pricers            :       Time      Calls       Vars
14.99/15.08	c   problem variables:       0.00          0          0
14.99/15.08	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
14.99/15.08	c   relpscost        :      11.07        314          7        144          0          0        496
14.99/15.08	c   pscost           :       0.00          0          0          0          0          0          0
14.99/15.08	c   inference        :       0.00          0          0          0          0          0          0
14.99/15.08	c   mostinf          :       0.00          0          0          0          0          0          0
14.99/15.08	c   leastinf         :       0.00          0          0          0          0          0          0
14.99/15.08	c   fullstrong       :       0.00          0          0          0          0          0          0
14.99/15.08	c   allfullstrong    :       0.00          0          0          0          0          0          0
14.99/15.08	c   random           :       0.00          0          0          0          0          0          0
14.99/15.08	c Primal Heuristics  :       Time      Calls      Found
14.99/15.08	c   LP solutions     :       0.00          -          1
14.99/15.08	c   pseudo solutions :       0.00          -          0
14.99/15.08	c   trivial          :       0.00          1          0
14.99/15.08	c   simplerounding   :       0.00          0          0
14.99/15.08	c   zirounding       :       0.00          0          0
14.99/15.08	c   rounding         :       0.00          0          0
14.99/15.08	c   shifting         :       0.00          0          0
14.99/15.08	c   intshifting      :       0.00          0          0
14.99/15.08	c   oneopt           :       0.00          0          0
14.99/15.08	c   twoopt           :       0.00          0          0
14.99/15.08	c   fixandinfer      :       0.00          0          0
14.99/15.08	c   feaspump         :       0.00          0          0
14.99/15.08	c   coefdiving       :       0.00          0          0
14.99/15.08	c   pscostdiving     :       0.00          0          0
14.99/15.08	c   fracdiving       :       0.00          0          0
14.99/15.08	c   veclendiving     :       0.00          0          0
14.99/15.08	c   intdiving        :       0.00          0          0
14.99/15.08	c   actconsdiving    :       0.00          0          0
14.99/15.08	c   objpscostdiving  :       0.00          0          0
14.99/15.08	c   rootsoldiving    :       0.00          0          0
14.99/15.08	c   linesearchdiving :       0.00          0          0
14.99/15.08	c   guideddiving     :       0.00          0          0
14.99/15.08	c   octane           :       0.00          0          0
14.99/15.08	c   rens             :       0.00          0          0
14.99/15.08	c   rins             :       0.00          0          0
14.99/15.08	c   localbranching   :       0.00          0          0
14.99/15.08	c   mutation         :       0.00          0          0
14.99/15.08	c   crossover        :       0.00          0          0
14.99/15.08	c   dins             :       0.00          0          0
14.99/15.08	c   undercover       :       0.00          0          0
14.99/15.08	c   nlp              :       0.00          0          0
14.99/15.08	c   trysol           :       0.00          0          0
14.99/15.08	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
14.99/15.08	c   primal LP        :       0.00          0          0       0.00          -
14.99/15.08	c   dual LP          :       2.35        348      13326      38.29    5670.64
14.99/15.08	c   lex dual LP      :       0.00          0          0       0.00          -
14.99/15.08	c   barrier LP       :       0.00          0          0       0.00          -
14.99/15.08	c   diving/probing LP:       0.00          0          0       0.00          -
14.99/15.08	c   strong branching :      11.06       1169      61334      52.47    5545.57
14.99/15.08	c     (at root node) :          -          9       5466     607.33          -
14.99/15.08	c   conflict analysis:       0.00          0          0       0.00          -
14.99/15.08	c B&B Tree           :
14.99/15.08	c   number of runs   :          1
14.99/15.08	c   nodes            :        427
14.99/15.08	c   nodes (total)    :        427
14.99/15.08	c   nodes left       :          0
14.99/15.08	c   max depth        :         19
14.99/15.08	c   max depth (total):         19
14.99/15.08	c   backtracks       :         89 (20.8%)
14.99/15.08	c   delayed cutoffs  :         47
14.99/15.08	c   repropagations   :        184 (1440 domain reductions, 42 cutoffs)
14.99/15.08	c   avg switch length:       3.49
14.99/15.08	c   switching time   :       0.03
14.99/15.08	c Solution           :
14.99/15.08	c   Solutions found  :          1 (1 improvements)
14.99/15.08	c   First Solution   : +0.00000000000000e+00   (in run 1, after 427 nodes, 14.69 seconds, depth 17, found by <relaxation>)
14.99/15.08	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 427 nodes, 14.69 seconds, depth 17, found by <relaxation>)
14.99/15.08	c   Dual Bound       : +0.00000000000000e+00
14.99/15.08	c   Gap              :       0.00 %
14.99/15.08	c   Root Dual Bound  : +0.00000000000000e+00
14.99/15.08	c   Root Iterations  :       1811
14.99/15.09	c Time complete: 15.08.

Verifier Data 

OK	0

Watcher Data 

runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2667127-1276268894/watcher-2667127-1276268894 -o /tmp/evaluation-result-2667127-1276268894/solver-2667127-1276268894 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2667127-1276268894.opb -t 1800 -m 1800 

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): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 0.91 0.94 0.91 3/106 4045
/proc/meminfo: memFree=1814852/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=7724 CPUtime=0
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 1048 0 0 0 0 0 0 0 22 0 1 0 2490983 7909376 967 1992294400 4194304 8223781 140737134884336 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/4045/statm: 1931 976 348 984 0 944 0

[startup+0.024939 s]
/proc/loadavg: 0.91 0.94 0.91 3/106 4045
/proc/meminfo: memFree=1814852/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=10556 CPUtime=0.01
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 2249 0 0 0 1 0 0 0 22 0 1 0 2490983 10809344 1804 1992294400 4194304 8223781 140737134884336 18446744073709551615 7235159 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 2639 1808 380 984 0 1652 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 10556

[startup+0.101947 s]
/proc/loadavg: 0.91 0.94 0.91 3/106 4045
/proc/meminfo: memFree=1814852/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=15344 CPUtime=0.09
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 5171 0 0 0 7 2 0 0 22 0 1 0 2490983 15712256 2902 1992294400 4194304 8223781 140737134884336 18446744073709551615 6043636 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 3836 2902 557 984 0 2849 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 15344

[startup+0.300968 s]
/proc/loadavg: 0.91 0.94 0.91 3/106 4045
/proc/meminfo: memFree=1814852/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=26636 CPUtime=0.29
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 9225 0 0 0 24 5 0 0 22 0 1 0 2490983 27275264 5404 1992294400 4194304 8223781 140737134884336 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 6659 5404 579 984 0 5672 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 26636

[startup+0.701008 s]
/proc/loadavg: 0.91 0.94 0.91 3/106 4045
/proc/meminfo: memFree=1814852/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=20244 CPUtime=0.69
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 9335 0 0 0 63 6 0 0 23 0 1 0 2490983 20729856 4219 1992294400 4194304 8223781 140737134884336 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 5061 4219 587 984 0 4074 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 20244

[startup+1.50109 s]
/proc/loadavg: 0.92 0.94 0.91 2/107 4046
/proc/meminfo: memFree=1797732/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=25896 CPUtime=1.49
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 10912 0 0 0 142 7 0 0 25 0 1 0 2490983 26517504 5614 1992294400 4194304 8223781 140737134884336 18446744073709551615 6036357 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 6474 5614 587 984 0 5487 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 25896

[startup+3.10126 s]
/proc/loadavg: 0.92 0.94 0.91 2/107 4046
/proc/meminfo: memFree=1794012/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=26132 CPUtime=3.09
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 12619 0 0 0 300 9 0 0 25 0 1 0 2490983 26759168 5704 1992294400 4194304 8223781 140737134884336 18446744073709551615 6562612 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 6533 5704 588 984 0 5546 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 26132

[startup+6.30158 s]
/proc/loadavg: 0.92 0.94 0.91 2/107 4046
/proc/meminfo: memFree=1793888/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=25836 CPUtime=6.29
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 13859 0 0 0 614 15 0 0 25 0 1 0 2490983 26456064 5645 1992294400 4194304 8223781 140737134884336 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 6459 5645 588 984 0 5472 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 25836

[startup+12.7012 s]
/proc/loadavg: 0.93 0.94 0.91 2/107 4046
/proc/meminfo: memFree=1793764/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=25836 CPUtime=12.68
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 14457 0 0 0 1238 30 0 0 25 0 1 0 2490983 26456064 5647 1992294400 4194304 8223781 140737134884336 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 6459 5647 590 984 0 5472 0
Current children cumulated CPU time (s) 12.68
Current children cumulated vsize (KiB) 25836

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

[startup+14.3083 s]
/proc/loadavg: 0.93 0.94 0.91 2/107 4046
/proc/meminfo: memFree=1793764/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=25836 CPUtime=14.29
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 14458 0 0 0 1395 34 0 0 25 0 1 0 2490983 26456064 5648 1992294400 4194304 8223781 140737134884336 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 6459 5648 591 984 0 5472 0
Current children cumulated CPU time (s) 14.29
Current children cumulated vsize (KiB) 25836

[startup+14.7014 s]
/proc/loadavg: 0.93 0.94 0.91 2/107 4046
/proc/meminfo: memFree=1793764/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=25836 CPUtime=14.68
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 14458 0 0 0 1433 35 0 0 25 0 1 0 2490983 26456064 5648 1992294400 4194304 8223781 140737134884336 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 6459 5648 591 984 0 5472 0
Current children cumulated CPU time (s) 14.68
Current children cumulated vsize (KiB) 25836

[startup+14.9014 s]
/proc/loadavg: 0.93 0.94 0.91 2/107 4046
/proc/meminfo: memFree=1793764/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=25836 CPUtime=14.88
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 14458 0 0 0 1452 36 0 0 25 0 1 0 2490983 26456064 5648 1992294400 4194304 8223781 140737134884336 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 6459 5648 591 984 0 5472 0
Current children cumulated CPU time (s) 14.88
Current children cumulated vsize (KiB) 25836

[startup+15.0014 s]
/proc/loadavg: 0.93 0.94 0.91 2/107 4046
/proc/meminfo: memFree=1793764/2059040 swapFree=4192076/4192956
[pid=4045] ppid=4043 vsize=25836 CPUtime=14.99
/proc/4045/stat : 4045 (pbscip.linux.x8) R 4043 4045 3357 0 -1 4202496 14458 0 0 0 1462 37 0 0 25 0 1 0 2490983 26456064 5648 1992294400 4194304 8223781 140737134884336 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4045/statm: 6459 5648 591 984 0 5472 0
Current children cumulated CPU time (s) 14.99
Current children cumulated vsize (KiB) 25836

Child status: 0
Real time (s): 15.0957
CPU time (s): 15.0917
CPU user time (s): 14.7168
CPU system time (s): 0.374943
CPU usage (%): 99.9736
Max. virtual memory (cumulated for all children) (KiB): 26636

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 14.7168
system time used= 0.374943
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 14464
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= 2
involuntary context switches= 201

runsolver used 0.032994 second user time and 0.075988 second system time

The end

Launcher Data 

Begin job on node011 at 2010-06-11 17:08:14
IDJOB=2667127
IDBENCH=1159
IDSOLVER=1169
FILE ID=node011/2667127-1276268894
PBS_JOBID= 11172200
Free space on /tmp= 62260 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/prestwich/armies/normalized-army8.9bt.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2667127-1276268894/watcher-2667127-1276268894 -o /tmp/evaluation-result-2667127-1276268894/solver-2667127-1276268894 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2667127-1276268894.opb -t 1800 -m 1800

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 1800 MiB
MAX NB THREAD= 0

MD5SUM BENCH= 41a419a7ef36b132b62f2564e794a725
RANDOM SEED=2042083110

node011.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	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.264
cache size	: 2048 KB
physical id	: 0
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
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 lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 6000.52
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.264
cache size	: 2048 KB
physical id	: 3
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
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 lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5599.45
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1815380 kB
Buffers:         11532 kB
Cached:         108360 kB
SwapCached:          0 kB
Active:          55576 kB
Inactive:       122536 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1815380 kB
SwapTotal:     4192956 kB
SwapFree:      4192076 kB
Dirty:            4728 kB
Writeback:           0 kB
AnonPages:       58268 kB
Mapped:          15384 kB
Slab:            43736 kB
PageTables:       4012 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180656 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264948 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62256 MiB
End job on node011 at 2010-06-11 17:08:29