Trace number 2704197

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.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverSAT 3.70344 3.70449

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/
FPGA_SAT05/normalized-fpga20_19_sat_pb.cnf.cr.opb
MD5SUMb78a12a55fc2dc824a87cdde553acbe6
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.009997
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables570
Total number of constraints438
Number of constraints which are clauses399
Number of constraints which are cardinality constraints (but not clauses)39
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint10
Maximum length of a constraint20
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 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 21
Number of bits of the biggest sum of numbers5
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.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704197-1278550079.opb>
0.01/0.02	c original problem has 570 variables (570 bin, 0 int, 0 impl, 0 cont) and 438 constraints
0.01/0.02	c problem read
0.01/0.02	c No objective function, only one solution is needed.
0.01/0.02	c presolving settings loaded
0.01/0.03	c presolving:
0.01/0.05	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 438 upgd conss, 0 impls, 39 clqs
0.01/0.06	c presolving (2 rounds):
0.01/0.06	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.06	c  0 implications, 39 cliques
0.01/0.06	c presolved problem has 570 variables (570 bin, 0 int, 0 impl, 0 cont) and 438 constraints
0.01/0.06	c      39 constraints of type <setppc>
0.01/0.06	c     399 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.03
0.01/0.06	c - non default parameters ----------------------------------------------------------------------
0.01/0.06	c # SCIP version 1.2.1.3
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 = 1789.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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.06	c # [type: int, range: [1,2], default: 1]
0.01/0.06	c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06	c constraints/indicator/addCouplingCons = 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.08	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.08	c   0.1s|     1 |     0 |   184 |     - |2279k|   0 | 110 | 570 | 438 | 570 | 438 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.32	c   0.3s|     1 |     0 |   242 |     - |2867k|   0 | 107 | 570 | 438 | 570 | 446 |   8 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.49/0.50	c   0.5s|     1 |     0 |   516 |     - |3108k|   0 | 134 | 570 | 438 | 570 | 455 |  17 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.59/0.63	c   0.6s|     1 |     0 |   717 |     - |3473k|   0 | 124 | 570 | 438 | 570 | 466 |  28 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.79/0.81	c   0.8s|     1 |     0 |  1024 |     - |4073k|   0 | 116 | 570 | 438 | 570 | 478 |  40 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.89/0.91	c   0.9s|     1 |     0 |  1154 |     - |4397k|   0 | 103 | 570 | 438 | 570 | 489 |  51 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.00/1.05	c   1.0s|     1 |     2 |  1154 |     - |4397k|   0 | 103 | 570 | 438 | 570 | 489 |  51 |   0 |  33 | 0.000000e+00 |      --      |    Inf 
3.59/3.68	c * 3.7s|    33 |     0 |  1460 |   9.6 |4577k|  32 |   - | 570 | 438 | 570 | 459 |  51 |   0 | 761 | 0.000000e+00 | 0.000000e+00 |   0.00%
3.59/3.69	c 
3.59/3.69	c SCIP Status        : problem is solved [optimal solution found]
3.59/3.69	c Solving Time (sec) : 3.66
3.59/3.69	c Solving Nodes      : 33
3.59/3.69	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
3.59/3.69	c Dual Bound         : +0.00000000000000e+00
3.59/3.69	c Gap                : 0.00 %
3.59/3.69	s SATISFIABLE
3.59/3.69	v -x324 -x66 -x65 -x76 -x237 -x238 -x38 -x37 -x34 -x33 -x27 -x26 -x252 -x251 -x72 x22 -x239 x229 -x67 -x245 -x330 -x21 -x336 -x333 
3.59/3.69	v -x335 -x29 -x288 -x285 -x283 -x281 -x326 -x260 -x35 -x359 -x357 -x353 -x347 -x350 -x346 -x32 -x328 -x348 -x70 -x59 -x50 -x49 
3.59/3.69	v -x47 -x46 -x45 -x44 -x36 -x223 -x222 -x248 -x254 -x52 -x226 -x77 -x280 -x278 -x274 -x273 -x271 -x265 -x264 -x263 -x262 -x261 
3.59/3.69	v -x267 -x291 -x233 -x256 -x293 -x246 -x351 -x230 -x68 -x23 -x286 -x232 -x240 -x242 -x61 -x55 -x234 -x258 -x247 -x56 x43 -x272 
3.59/3.69	v -x343 -x244 -x259 x379 -x378 -x376 -x373 -x371 -x370 -x366 -x362 -x334 -x380 -x321 -x363 -x339 -x340 -x255 -x78 -x372 -x200 
3.59/3.69	v -x198 -x194 x193 -x191 -x190 -x187 -x186 -x185 -x300 -x361 -x374 -x331 -x220 -x217 -x215 -x213 -x212 -x211 -x210 -x208 x207 
3.59/3.69	v -x203 -x202 -x201 -x257 -x349 -x140 -x139 -x138 -x136 -x134 x131 -x130 -x128 -x127 -x125 -x124 -x123 -x122 x250 -x216 -x60 -x62 
3.59/3.69	v -x290 -x177 x176 -x173 -x172 -x171 -x169 -x167 -x165 -x164 -x162 -x31 -x166 -x377 x277 -x289 -x337 x294 -x236 -x71 -x168 -x133 
3.59/3.69	v -x30 -x199 x75 -x355 -x163 -x323 -x284 -x121 -x219 -x160 -x159 -x158 -x156 -x155 -x154 -x153 -x152 -x151 -x149 -x148 -x146 
3.59/3.69	v -x145 -x144 -x143 x141 -x126 -x57 -x204 -x367 -x58 -x358 -x197 -x80 -x241 -x48 -x178 -x287 -x329 -x282 -x142 -x275 -x51 -x342 
3.59/3.69	v -x184 -x279 -x53 -x161 -x20 -x19 -x18 -x17 -x15 -x14 -x13 -x8 x6 -x5 -x3 -x2 -x1 -x345 -x352 -x369 -x295 -x225 -x364 -x147 
3.59/3.69	v -x227 -x299 -x39 -x327 -x63 -x338 -x25 -x292 -x368 -x269 -x11 -x356 -x322 -x135 x325 -x224 -x276 -x180 -x174 -x132 -x16 -x205 
3.59/3.69	v -x170 -x218 -x296 -x253 -x182 -x206 -x69 -x443 -x442 -x441 -x440 -x439 -x438 -x437 x436 -x435 -x7 -x195 -x243 -x150 -x231 
3.59/3.69	v -x332 -x137 x344 -x270 -x40 -x54 -x228 -x157 -x298 -x175 -x189 -x550 -x549 -x548 -x547 -x546 x545 -x544 -x543 -x542 -x541 -x249 
3.59/3.69	v -x9 -x407 -x406 -x405 -x404 x403 -x402 -x401 -x400 -x399 -x183 -x196 x480 -x479 -x478 -x477 -x476 -x475 -x474 -x473 -x472 
3.59/3.69	v -x471 -x192 -x188 -x79 x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x42 -x365 -x209 -x24 -x64 -x120 -x119 x118 -x117 
3.59/3.69	v -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x104 -x103 -x102 -x101 -x425 x424 -x423 -x422 -x421 -x420 -x419 
3.59/3.69	v -x418 -x417 -x105 -x181 -x375 -x416 -x415 -x414 -x413 -x412 -x411 x410 -x409 -x408 -x4 -x214 -x434 -x433 x432 -x431 -x430 -x429 
3.59/3.69	v -x428 -x427 -x426 -x266 -x354 -x540 -x539 -x538 -x537 -x536 -x535 -x534 -x533 x532 -x531 -x297 -x268 x100 -x99 -x98 -x97 
3.59/3.69	v -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x41 -x510 -x509 -x508 -x507 -x506 -x505 -x504 
3.59/3.69	v -x503 -x502 x501 -x74 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 
3.59/3.69	v -x303 -x302 -x301 -x461 -x460 -x459 -x458 -x457 -x456 -x455 -x454 x453 -x129 -x490 -x489 -x488 -x487 -x486 -x485 -x484 x483 -x482 
3.59/3.69	v -x481 -x12 -x530 -x529 -x528 -x527 x526 -x525 -x524 -x523 -x522 -x521 -x116 -x520 -x519 -x518 -x517 -x516 -x515 x514 -x513 
3.59/3.69	v -x512 -x511 -x235 -x221 -x389 -x388 -x387 x386 -x385 -x384 -x383 -x382 -x381 -x341 -x500 x499 -x498 -x497 -x496 -x495 -x494 
3.59/3.69	v -x493 -x492 -x491 -x73 -x560 -x559 x558 -x557 -x556 -x555 -x554 -x553 -x552 -x551 -x179 -x470 -x469 -x468 -x467 -x466 x465 
3.59/3.69	v -x464 -x463 -x462 -x10 -x570 -x569 -x568 x567 -x566 -x565 -x564 -x563 -x562 -x561 -x360 -x452 -x451 -x450 -x449 -x448 -x447 -x446 
3.59/3.69	v -x445 -x444 -x28 
3.59/3.69	c SCIP Status        : problem is solved [optimal solution found]
3.59/3.69	c Solving Time       :       3.66
3.59/3.69	c Original Problem   :
3.59/3.69	c   Problem name     : HOME/instance-2704197-1278550079.opb
3.59/3.69	c   Variables        : 570 (570 binary, 0 integer, 0 implicit integer, 0 continuous)
3.59/3.69	c   Constraints      : 438 initial, 438 maximal
3.59/3.69	c Presolved Problem  :
3.59/3.69	c   Problem name     : t_HOME/instance-2704197-1278550079.opb
3.59/3.69	c   Variables        : 570 (570 binary, 0 integer, 0 implicit integer, 0 continuous)
3.59/3.69	c   Constraints      : 438 initial, 438 maximal
3.59/3.69	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
3.59/3.69	c   trivial          :       0.00          0          0          0          0          0          0          0          0
3.59/3.69	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
3.59/3.69	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
3.59/3.69	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
3.59/3.69	c   implics          :       0.00          0          0          0          0          0          0          0          0
3.59/3.69	c   probing          :       0.00          0          0          0          0          0          0          0          0
3.59/3.69	c   setppc           :       0.00          0          0          0          0          0          0          0          0
3.59/3.69	c   logicor          :       0.01          0          0          0          0          0          0          0          0
3.59/3.69	c   root node        :          -          0          -          -          0          -          -          -          -
3.59/3.69	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
3.59/3.69	c   integral         :          0          0          0         36          0          0          3          0          0         64
3.59/3.69	c   setppc           :         39          5         69          1          0          0        449          0          0          0
3.59/3.69	c   logicor          :        399          5         24          1          0          0          1          0          0          0
3.59/3.69	c   countsols        :          0          0          0          1          0          0          0          0          0          0
3.59/3.69	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
3.59/3.69	c   integral         :       2.71       0.00       0.00       2.71       0.00
3.59/3.69	c   setppc           :       0.00       0.00       0.00       0.00       0.00
3.59/3.69	c   logicor          :       0.00       0.00       0.00       0.00       0.00
3.59/3.69	c   countsols        :       0.00       0.00       0.00       0.00       0.00
3.59/3.69	c Propagators        :       Time      Calls    Cutoffs    DomReds
3.59/3.69	c   vbounds          :       0.00          1          0          0
3.59/3.69	c   rootredcost      :       0.00          0          0          0
3.59/3.69	c   pseudoobj        :       0.00          0          0          0
3.59/3.69	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
3.59/3.69	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
3.59/3.69	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
3.59/3.69	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
3.59/3.69	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
3.59/3.69	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
3.59/3.69	c   applied globally :          -          -          -          0        0.0          -          -          -
3.59/3.69	c   applied locally  :          -          -          -          0        0.0          -          -          -
3.59/3.69	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
3.59/3.69	c   cut pool         :       0.00          4          -          -          0          -    (maximal pool size: 391)
3.59/3.69	c   redcost          :       0.00         37          0          0          0          0
3.59/3.69	c   impliedbounds    :       0.00          5          0          0          0          0
3.59/3.69	c   intobj           :       0.00          0          0          0          0          0
3.59/3.69	c   cgmip            :       0.00          0          0          0          0          0
3.59/3.69	c   gomory           :       0.29          5          0          0       1207          0
3.59/3.69	c   strongcg         :       0.29          5          0          0       1736          0
3.59/3.69	c   cmir             :       0.00          0          0          0          0          0
3.59/3.69	c   flowcover        :       0.00          0          0          0          0          0
3.59/3.69	c   clique           :       0.00          5          0          0          0          0
3.59/3.69	c   zerohalf         :       0.00          0          0          0          0          0
3.59/3.69	c   mcf              :       0.00          1          0          0          0          0
3.59/3.69	c   rapidlearning    :       0.05          1          0          0          0          0
3.59/3.69	c Pricers            :       Time      Calls       Vars
3.59/3.69	c   problem variables:       0.00          0          0
3.59/3.69	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
3.59/3.69	c   relpscost        :       2.71         35          0          3          0          0         64
3.59/3.69	c   pscost           :       0.00          0          0          0          0          0          0
3.59/3.69	c   inference        :       0.00          0          0          0          0          0          0
3.59/3.69	c   mostinf          :       0.00          0          0          0          0          0          0
3.59/3.69	c   leastinf         :       0.00          0          0          0          0          0          0
3.59/3.69	c   fullstrong       :       0.00          0          0          0          0          0          0
3.59/3.69	c   allfullstrong    :       0.00          0          0          0          0          0          0
3.59/3.69	c   random           :       0.00          0          0          0          0          0          0
3.59/3.69	c Primal Heuristics  :       Time      Calls      Found
3.59/3.69	c   LP solutions     :       0.00          -          1
3.59/3.69	c   pseudo solutions :       0.00          -          0
3.59/3.69	c   trivial          :       0.00          1          0
3.59/3.69	c   simplerounding   :       0.00          0          0
3.59/3.69	c   zirounding       :       0.00          0          0
3.59/3.69	c   rounding         :       0.00          0          0
3.59/3.69	c   shifting         :       0.00          0          0
3.59/3.69	c   intshifting      :       0.00          0          0
3.59/3.69	c   oneopt           :       0.00          0          0
3.59/3.69	c   twoopt           :       0.00          0          0
3.59/3.69	c   fixandinfer      :       0.00          0          0
3.59/3.69	c   feaspump         :       0.00          0          0
3.59/3.69	c   coefdiving       :       0.00          0          0
3.59/3.69	c   pscostdiving     :       0.00          0          0
3.59/3.69	c   fracdiving       :       0.00          0          0
3.59/3.69	c   veclendiving     :       0.00          0          0
3.59/3.69	c   intdiving        :       0.00          0          0
3.59/3.69	c   actconsdiving    :       0.00          0          0
3.59/3.69	c   objpscostdiving  :       0.00          0          0
3.59/3.69	c   rootsoldiving    :       0.00          0          0
3.59/3.69	c   linesearchdiving :       0.00          0          0
3.59/3.69	c   guideddiving     :       0.00          0          0
3.59/3.69	c   octane           :       0.00          0          0
3.59/3.69	c   rens             :       0.00          0          0
3.59/3.69	c   rins             :       0.00          0          0
3.59/3.69	c   localbranching   :       0.00          0          0
3.59/3.69	c   mutation         :       0.00          0          0
3.59/3.69	c   crossover        :       0.00          0          0
3.59/3.69	c   dins             :       0.00          0          0
3.59/3.69	c   undercover       :       0.00          0          0
3.59/3.69	c   nlp              :       0.00          0          0
3.59/3.69	c   trysol           :       0.00          0          0
3.59/3.69	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
3.59/3.69	c   primal LP        :       0.00          0          0       0.00          -
3.59/3.69	c   dual LP          :       0.23         41       1460      35.61    6266.26
3.59/3.69	c   lex dual LP      :       0.00          0          0       0.00          -
3.59/3.69	c   barrier LP       :       0.00          0          0       0.00          -
3.59/3.69	c   diving/probing LP:       0.00          0          0       0.00          -
3.59/3.69	c   strong branching :       2.71        761      17510      23.01    6463.68
3.59/3.69	c     (at root node) :          -         33        804      24.36          -
3.59/3.69	c   conflict analysis:       0.00          0          0       0.00          -
3.59/3.69	c B&B Tree           :
3.59/3.69	c   number of runs   :          1
3.59/3.69	c   nodes            :         33
3.59/3.69	c   nodes (total)    :         33
3.59/3.69	c   nodes left       :          0
3.59/3.69	c   max depth        :         32
3.59/3.69	c   max depth (total):         32
3.59/3.69	c   backtracks       :          0 (0.0%)
3.59/3.69	c   delayed cutoffs  :          0
3.59/3.69	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
3.59/3.69	c   avg switch length:       2.00
3.59/3.69	c   switching time   :       0.01
3.59/3.69	c Solution           :
3.59/3.69	c   Solutions found  :          1 (1 improvements)
3.59/3.69	c   First Solution   : +0.00000000000000e+00   (in run 1, after 33 nodes, 3.66 seconds, depth 32, found by <relaxation>)
3.59/3.69	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 33 nodes, 3.66 seconds, depth 32, found by <relaxation>)
3.59/3.69	c   Dual Bound       : +0.00000000000000e+00
3.59/3.69	c   Gap              :       0.00 %
3.59/3.69	c   Root Dual Bound  : +0.00000000000000e+00
3.59/3.69	c   Root Iterations  :       1154
3.69/3.70	c Time complete: 3.69.

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-2704197-1278550079/watcher-2704197-1278550079 -o /tmp/evaluation-result-2704197-1278550079/solver-2704197-1278550079 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704197-1278550079.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.89 1.00 0.92 3/106 26412
/proc/meminfo: memFree=1951780/2059040 swapFree=4134668/4192956
[pid=26412] ppid=26410 vsize=7904 CPUtime=0
/proc/26412/stat : 26412 (pbscip.linux.x8) R 26410 26412 25530 0 -1 4202496 1062 0 0 0 0 0 0 0 19 0 1 0 23215549 8093696 973 1992294400 4194304 8395647 140735169418512 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/26412/statm: 1976 981 365 1026 0 946 0

[startup+0.022904 s]
/proc/loadavg: 0.89 1.00 0.92 3/106 26412
/proc/meminfo: memFree=1951780/2059040 swapFree=4134668/4192956
[pid=26412] ppid=26410 vsize=11140 CPUtime=0.01
/proc/26412/stat : 26412 (pbscip.linux.x8) R 26410 26412 25530 0 -1 4202496 2069 0 0 0 1 0 0 0 19 0 1 0 23215549 11407360 1980 1992294400 4194304 8395647 140735169418512 18446744073709551615 4245996 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/26412/statm: 2785 1980 390 1026 0 1755 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 11140

[startup+0.100912 s]
/proc/loadavg: 0.89 1.00 0.92 3/106 26412
/proc/meminfo: memFree=1951780/2059040 swapFree=4134668/4192956
[pid=26412] ppid=26410 vsize=17956 CPUtime=0.09
/proc/26412/stat : 26412 (pbscip.linux.x8) R 26410 26412 25530 0 -1 4202496 4043 0 0 0 8 1 0 0 21 0 1 0 23215549 18386944 3581 1992294400 4194304 8395647 140735169418512 18446744073709551615 4270210 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26412/statm: 4489 3581 569 1026 0 3459 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 17956

[startup+0.300934 s]
/proc/loadavg: 0.89 1.00 0.92 3/106 26412
/proc/meminfo: memFree=1951780/2059040 swapFree=4134668/4192956
[pid=26412] ppid=26410 vsize=34024 CPUtime=0.29
/proc/26412/stat : 26412 (pbscip.linux.x8) R 26410 26412 25530 0 -1 4202496 7777 0 0 0 27 2 0 0 21 0 1 0 23215549 34840576 7315 1992294400 4194304 8395647 140735169418512 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26412/statm: 8506 7315 588 1026 0 7476 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 34024

[startup+0.700978 s]
/proc/loadavg: 0.89 1.00 0.92 3/106 26412
/proc/meminfo: memFree=1951780/2059040 swapFree=4134668/4192956
[pid=26412] ppid=26410 vsize=31304 CPUtime=0.69
/proc/26412/stat : 26412 (pbscip.linux.x8) R 26410 26412 25530 0 -1 4202496 7839 0 0 0 66 3 0 0 22 0 1 0 23215549 32055296 6916 1992294400 4194304 8395647 140735169418512 18446744073709551615 6107066 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26412/statm: 7826 6916 599 1026 0 6796 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 31304

[startup+1.50107 s]
/proc/loadavg: 0.89 1.00 0.92 2/107 26413
/proc/meminfo: memFree=1925980/2059040 swapFree=4134668/4192956
[pid=26412] ppid=26410 vsize=31304 CPUtime=1.49
/proc/26412/stat : 26412 (pbscip.linux.x8) R 26410 26412 25530 0 -1 4202496 7841 0 0 0 145 4 0 0 25 0 1 0 23215549 32055296 6918 1992294400 4194304 8395647 140735169418512 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26412/statm: 7826 6918 601 1026 0 6796 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 31304

[startup+3.10124 s]
/proc/loadavg: 0.89 1.00 0.92 2/107 26413
/proc/meminfo: memFree=1925732/2059040 swapFree=4134668/4192956
[pid=26412] ppid=26410 vsize=31304 CPUtime=3.09
/proc/26412/stat : 26412 (pbscip.linux.x8) R 26410 26412 25530 0 -1 4202496 7841 0 0 0 300 9 0 0 25 0 1 0 23215549 32055296 6918 1992294400 4194304 8395647 140735169418512 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26412/statm: 7826 6918 601 1026 0 6796 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 31304

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

[startup+3.50128 s]
/proc/loadavg: 0.90 1.00 0.92 2/107 26413
/proc/meminfo: memFree=1925732/2059040 swapFree=4134668/4192956
[pid=26412] ppid=26410 vsize=31304 CPUtime=3.49
/proc/26412/stat : 26412 (pbscip.linux.x8) R 26410 26412 25530 0 -1 4202496 7841 0 0 0 340 9 0 0 25 0 1 0 23215549 32055296 6918 1992294400 4194304 8395647 140735169418512 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26412/statm: 7826 6918 601 1026 0 6796 0
Current children cumulated CPU time (s) 3.49
Current children cumulated vsize (KiB) 31304

[startup+3.7013 s]
/proc/loadavg: 0.90 1.00 0.92 2/107 26413
/proc/meminfo: memFree=1925732/2059040 swapFree=4134668/4192956
[pid=26412] ppid=26410 vsize=16436 CPUtime=3.69
/proc/26412/stat : 26412 (pbscip.linux.x8) R 26410 26412 25530 0 -1 4202496 7844 0 0 0 359 10 0 0 25 0 1 0 23215549 16830464 3053 1992294400 4194304 8395647 140735169418512 18446744073709551615 7435351 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/26412/statm: 3852 3053 604 1026 0 2822 0
Current children cumulated CPU time (s) 3.69
Current children cumulated vsize (KiB) 16436

Child status: 0
Real time (s): 3.70449
CPU time (s): 3.70344
CPU user time (s): 3.59745
CPU system time (s): 0.105983
CPU usage (%): 99.9714
Max. virtual memory (cumulated for all children) (KiB): 34024

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

runsolver used 0.005999 second user time and 0.032994 second system time

The end

Launcher Data 

Begin job on node038 at 2010-07-08 02:47:59
IDJOB=2704197
IDBENCH=1404
IDSOLVER=1213
FILE ID=node038/2704197-1278550079
PBS_JOBID= 11239501
Free space on /tmp= 62540 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/FPGA_SAT05/normalized-fpga20_19_sat_pb.cnf.cr.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-2704197-1278550079/watcher-2704197-1278550079 -o /tmp/evaluation-result-2704197-1278550079/solver-2704197-1278550079 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704197-1278550079.opb -t 1800 -m 1800

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

MD5SUM BENCH= b78a12a55fc2dc824a87cdde553acbe6
RANDOM SEED=1851574348

node038.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.215
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.43
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.215
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:       1952308 kB
Buffers:          1248 kB
Cached:          30672 kB
SwapCached:       5244 kB
Active:          36192 kB
Inactive:         2800 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1952308 kB
SwapTotal:     4192956 kB
SwapFree:      4134668 kB
Dirty:           10480 kB
Writeback:           0 kB
AnonPages:        6892 kB
Mapped:           6444 kB
Slab:            45664 kB
PageTables:       4208 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181720 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= 62528 MiB
End job on node038 at 2010-07-08 02:48:03