Trace number 2704184

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 4.39933 4.40041

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/
FPGA_SAT05/normalized-fpga20_20_sat_pb.cnf.cr.opb
MD5SUM192f8feb97785f57d6eda41fc7a200be
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.010997
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables600
Total number of constraints460
Number of constraints which are clauses420
Number of constraints which are cardinality constraints (but not clauses)40
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-2704184-1278550044.opb>
0.00/0.02	c original problem has 600 variables (600 bin, 0 int, 0 impl, 0 cont) and 460 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.00/0.03	c presolving:
0.00/0.06	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 460 upgd conss, 0 impls, 40 clqs
0.00/0.06	c presolving (2 rounds):
0.00/0.06	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.06	c  0 implications, 40 cliques
0.00/0.06	c presolved problem has 600 variables (600 bin, 0 int, 0 impl, 0 cont) and 460 constraints
0.00/0.06	c      40 constraints of type <setppc>
0.00/0.06	c     420 constraints of type <logicor>
0.00/0.06	c transformed objective value is always integral (scale: 1)
0.00/0.06	c Presolving Time: 0.03
0.00/0.06	c - non default parameters ----------------------------------------------------------------------
0.00/0.06	c # SCIP version 1.2.1.3
0.00/0.06	c 
0.00/0.06	c # frequency for displaying node information lines
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06	c display/freq = 10000
0.00/0.06	c 
0.00/0.06	c # maximal time in seconds to run
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06	c limits/time = 1789.99
0.00/0.06	c 
0.00/0.06	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06	c limits/memory = 1620
0.00/0.06	c 
0.00/0.06	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06	c limits/solutions = 1
0.00/0.06	c 
0.00/0.06	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.06	c separating/maxrounds = 1
0.00/0.06	c 
0.00/0.06	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06	c separating/maxroundsroot = 5
0.00/0.06	c 
0.00/0.06	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.06	c # [type: int, range: [1,2], default: 1]
0.00/0.06	c timing/clocktype = 2
0.00/0.06	c 
0.00/0.06	c # should presolving try to simplify inequalities
0.00/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06	c constraints/linear/simplifyinequalities = TRUE
0.00/0.06	c 
0.00/0.06	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06	c constraints/indicator/addCouplingCons = TRUE
0.00/0.06	c 
0.00/0.06	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.06	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.06	c constraints/knapsack/disaggregation = FALSE
0.00/0.06	c 
0.00/0.06	c # should presolving try to simplify knapsacks
0.00/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06	c 
0.00/0.06	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06	c presolving/probing/maxrounds = 0
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/coefdiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.06	c heuristics/crossover/freq = -1
0.00/0.06	c 
0.00/0.06	c # number of nodes added to the contingent of the total nodes
0.00/0.06	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06	c heuristics/crossover/nodesofs = 750
0.00/0.06	c 
0.00/0.06	c # number of nodes without incumbent change that heuristic should wait
0.00/0.06	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.06	c heuristics/crossover/nwaitingnodes = 100
0.00/0.06	c 
0.00/0.06	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.06	c # [type: real, range: [0,1], default: 0.1]
0.00/0.06	c heuristics/crossover/nodesquot = 0.15
0.00/0.06	c 
0.00/0.06	c # minimum percentage of integer variables that have to be fixed 
0.00/0.06	c # [type: real, range: [0,1], default: 0.666]
0.00/0.06	c heuristics/crossover/minfixingrate = 0.5
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06	c heuristics/feaspump/freq = -1
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/fracdiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/guideddiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/intshifting/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/linesearchdiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/nlp/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06	c heuristics/objpscostdiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.06	c # [type: real, range: [0,1], default: 0.01]
0.00/0.06	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/oneopt/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/pscostdiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06	c heuristics/rens/freq = -1
0.00/0.06	c 
0.00/0.06	c # minimum percentage of integer variables that have to be fixable 
0.00/0.06	c # [type: real, range: [0,1], default: 0.5]
0.00/0.06	c heuristics/rens/minfixingrate = 0.3
0.00/0.06	c 
0.00/0.06	c # number of nodes added to the contingent of the total nodes
0.00/0.06	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06	c heuristics/rens/nodesofs = 2000
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06	c heuristics/rootsoldiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.06	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/rounding/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/shifting/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/simplerounding/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06	c heuristics/trivial/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/trysol/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/veclendiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/zirounding/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06	c separating/cmir/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06	c separating/flowcover/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06	c separating/rapidlearning/freq = 0
0.00/0.06	c 
0.00/0.06	c -----------------------------------------------------------------------------------------------
0.00/0.06	c start solving
0.00/0.06	c 
0.00/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.00/0.09	c   0.1s|     1 |     0 |   233 |     - |2401k|   0 | 128 | 600 | 460 | 600 | 460 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.36	c   0.3s|     1 |     0 |   354 |     - |3068k|   0 | 138 | 600 | 460 | 600 | 468 |   8 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.49/0.58	c   0.6s|     1 |     0 |   626 |     - |3693k|   0 | 171 | 600 | 460 | 600 | 480 |  20 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.79/0.81	c   0.8s|     1 |     0 |   932 |     - |4262k|   0 | 117 | 600 | 460 | 600 | 491 |  31 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.89/0.97	c   0.9s|     1 |     0 |  1061 |     - |4735k|   0 | 130 | 600 | 460 | 600 | 499 |  39 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.09/1.13	c   1.1s|     1 |     0 |  1226 |     - |5266k|   0 | 121 | 600 | 460 | 600 | 509 |  49 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.29/1.30	c   1.3s|     1 |     2 |  1226 |     - |5267k|   0 | 121 | 600 | 460 | 600 | 509 |  49 |   0 |  33 | 0.000000e+00 |      --      |    Inf 
4.29/4.38	c * 4.4s|    32 |     0 |  1546 |  10.3 |5453k|  31 |   - | 600 | 460 | 600 | 477 |  49 |   0 | 844 | 0.000000e+00 | 0.000000e+00 |   0.00%
4.29/4.38	c 
4.29/4.38	c SCIP Status        : problem is solved [optimal solution found]
4.29/4.38	c Solving Time (sec) : 4.36
4.29/4.38	c Solving Nodes      : 32
4.29/4.38	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
4.29/4.38	c Dual Bound         : +0.00000000000000e+00
4.29/4.38	c Gap                : 0.00 %
4.29/4.38	s SATISFIABLE
4.29/4.38	v -x269 -x279 -x271 -x275 -x277 -x376 -x368 -x365 -x220 -x215 -x211 -x204 -x370 -x359 -x358 -x356 -x343 -x261 -x270 -x347 -x297 -x296 
4.29/4.38	v -x294 x292 -x290 -x282 -x276 -x206 -x373 -x342 -x351 -x295 -x291 -x213 -x274 -x120 -x117 -x114 -x113 -x111 -x109 -x103 -x159 
4.29/4.38	v -x156 -x155 -x151 -x145 -x144 -x142 -x110 -x205 -x299 -x118 -x201 -x273 -x112 -x345 -x104 -x265 -x280 -x141 -x78 -x74 -x73 
4.29/4.38	v -x72 -x71 -x70 -x68 -x67 x65 -x64 -x62 -x61 -x179 -x178 -x177 -x176 -x172 -x171 -x170 -x168 -x166 x163 -x161 -x372 -x263 -x147 
4.29/4.38	v -x284 -x289 -x380 -x341 -x175 -x169 -x210 -x153 -x157 -x66 -x240 -x239 -x238 -x236 -x235 -x233 -x231 -x229 -x226 -x225 x224 
4.29/4.38	v -x222 -x378 -x180 -x260 -x257 -x256 -x252 -x248 -x247 -x245 -x241 x369 -x249 -x56 -x55 -x54 -x52 -x49 -x48 -x46 -x44 -x43 
4.29/4.38	v -x42 -x221 -x227 -x234 -x59 -x101 -x350 -x262 -x167 -x361 x106 -x38 -x37 -x36 -x35 x31 -x30 -x27 -x26 -x24 -x21 -x107 -x158 
4.29/4.38	v -x51 -x20 -x17 -x15 -x14 -x10 -x9 -x8 -x7 -x5 -x3 -x146 -x346 -x150 -x79 -x366 -x371 -x143 -x53 -x285 -x154 -x140 -x138 -x136 
4.29/4.38	v x134 -x132 -x129 -x128 -x123 -x122 -x121 -x1 -x28 -x77 -x281 -x115 -x344 -x377 -x250 x360 -x363 -x228 -x149 -x367 -x34 -x133 
4.29/4.38	v -x340 -x339 -x338 -x337 -x332 -x330 -x328 -x326 -x325 -x324 -x322 -x321 -x60 -x63 -x300 -x2 -x126 -x259 x267 -x116 -x272 -x400 
4.29/4.38	v -x397 x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x23 -x354 -x209 x333 -x381 -x334 -x230 
4.29/4.38	v -x208 -x69 -x22 -x329 -x45 -x364 -x399 -x6 -x13 -x200 x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 
4.29/4.38	v -x187 -x186 -x185 -x184 -x183 -x100 -x99 -x98 -x97 -x96 -x93 -x92 -x91 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x223 -x75 
4.29/4.38	v -x336 -x286 -x278 -x165 -x374 -x102 -x246 x90 -x254 -x323 -x50 -x298 -x335 -x253 x216 -x219 -x244 -x58 -x127 -x357 x242 x18 
4.29/4.38	v -x353 -x396 -x202 -x125 -x355 -x173 -x349 -x203 -x131 -x214 -x57 -x40 -x19 -x264 -x108 -x258 -x124 -x181 -x32 -x207 -x398 -x33 
4.29/4.38	v -x460 x459 -x458 -x457 -x456 -x455 -x454 -x453 -x452 -x451 -x266 -x232 -x80 -x382 -x237 -x39 -x95 -x379 -x212 -x600 -x599 
4.29/4.38	v -x598 x597 -x596 -x595 -x594 -x593 -x592 -x591 -x160 -x320 -x319 -x316 -x315 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 
4.29/4.38	v -x305 -x304 -x303 -x302 -x301 -x174 -x217 -x139 -x287 x317 -x375 -x251 -x4 -x490 -x489 -x488 -x487 -x486 -x485 x484 -x483 -x482 
4.29/4.38	v -x481 -x29 -x500 -x499 -x498 -x497 -x496 -x495 -x494 x493 -x492 -x491 -x130 -x331 -x243 -x430 -x429 -x428 -x427 x426 -x425 
4.29/4.38	v -x424 -x423 -x422 -x421 -x283 -x530 -x529 -x528 -x527 -x526 -x525 -x524 -x523 -x522 x521 -x293 -x162 -x25 -x590 -x589 -x588 
4.29/4.38	v -x587 -x586 -x585 -x584 -x583 x582 -x581 -x119 -x94 -x135 -x540 -x539 -x538 -x537 -x536 -x535 -x534 x533 -x532 -x531 -x314 -x410 
4.29/4.38	v -x409 x408 -x407 -x406 -x405 -x404 -x403 -x402 -x401 x41 -x76 -x12 -x348 -x268 -x510 -x509 x508 -x507 -x506 -x505 -x504 
4.29/4.38	v -x503 -x502 -x501 -x11 -x440 -x439 -x438 -x437 -x436 x435 -x434 -x433 -x432 -x431 -x164 x148 -x570 -x569 -x568 -x567 x566 -x565 
4.29/4.38	v -x564 -x563 -x562 -x561 -x137 -x480 -x479 -x478 -x477 -x476 -x475 -x474 -x473 x472 -x471 -x288 -x152 x520 -x519 -x518 -x517 
4.29/4.38	v -x516 -x515 -x514 -x513 -x512 -x511 -x352 -x327 -x470 -x469 -x468 -x467 -x466 -x465 -x464 -x463 -x462 x461 -x47 x450 -x449 
4.29/4.38	v -x448 -x447 -x446 -x445 -x444 -x443 -x442 -x441 -x105 -x550 x549 -x548 -x547 -x546 -x545 -x544 -x543 -x542 -x541 -x255 -x318 
4.29/4.38	v -x580 -x579 -x578 -x577 -x576 x575 -x574 -x573 -x572 -x571 -x218 -x362 -x560 -x559 -x558 -x557 -x556 -x555 x554 -x553 -x552 -x551 
4.29/4.38	v -x16 -x420 -x419 -x418 x417 -x416 -x415 -x414 -x413 -x412 -x411 -x182 
4.29/4.38	c SCIP Status        : problem is solved [optimal solution found]
4.29/4.38	c Solving Time       :       4.36
4.29/4.38	c Original Problem   :
4.29/4.38	c   Problem name     : HOME/instance-2704184-1278550044.opb
4.29/4.38	c   Variables        : 600 (600 binary, 0 integer, 0 implicit integer, 0 continuous)
4.29/4.38	c   Constraints      : 460 initial, 460 maximal
4.29/4.38	c Presolved Problem  :
4.29/4.38	c   Problem name     : t_HOME/instance-2704184-1278550044.opb
4.29/4.38	c   Variables        : 600 (600 binary, 0 integer, 0 implicit integer, 0 continuous)
4.29/4.38	c   Constraints      : 460 initial, 460 maximal
4.29/4.38	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
4.29/4.38	c   trivial          :       0.00          0          0          0          0          0          0          0          0
4.29/4.38	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
4.29/4.38	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
4.29/4.38	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
4.29/4.38	c   implics          :       0.00          0          0          0          0          0          0          0          0
4.29/4.38	c   probing          :       0.00          0          0          0          0          0          0          0          0
4.29/4.38	c   setppc           :       0.00          0          0          0          0          0          0          0          0
4.29/4.38	c   logicor          :       0.01          0          0          0          0          0          0          0          0
4.29/4.38	c   root node        :          -          0          -          -          0          -          -          -          -
4.29/4.38	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
4.29/4.38	c   integral         :          0          0          0         33          0          0          1          0          0         62
4.29/4.38	c   setppc           :         40          5         64          1          0          0        459          0          0          0
4.29/4.38	c   logicor          :        420          5         22          1          0          0          0          0          0          0
4.29/4.38	c   countsols        :          0          0          0          1          0          0          0          0          0          0
4.29/4.38	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
4.29/4.38	c   integral         :       3.18       0.00       0.00       3.18       0.00
4.29/4.38	c   setppc           :       0.00       0.00       0.00       0.00       0.00
4.29/4.38	c   logicor          :       0.00       0.00       0.00       0.00       0.00
4.29/4.38	c   countsols        :       0.00       0.00       0.00       0.00       0.00
4.29/4.38	c Propagators        :       Time      Calls    Cutoffs    DomReds
4.29/4.38	c   vbounds          :       0.00          1          0          0
4.29/4.38	c   rootredcost      :       0.00          0          0          0
4.29/4.38	c   pseudoobj        :       0.00          0          0          0
4.29/4.38	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
4.29/4.38	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
4.29/4.38	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
4.29/4.38	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
4.29/4.38	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
4.29/4.38	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
4.29/4.38	c   applied globally :          -          -          -          0        0.0          -          -          -
4.29/4.38	c   applied locally  :          -          -          -          0        0.0          -          -          -
4.29/4.38	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
4.29/4.38	c   cut pool         :       0.00          4          -          -          0          -    (maximal pool size: 391)
4.29/4.38	c   redcost          :       0.00         36          0          0          0          0
4.29/4.38	c   impliedbounds    :       0.00          5          0          0          0          0
4.29/4.38	c   intobj           :       0.00          0          0          0          0          0
4.29/4.38	c   cgmip            :       0.00          0          0          0          0          0
4.29/4.38	c   gomory           :       0.35          5          0          0        963          0
4.29/4.38	c   strongcg         :       0.43          5          0          0       2051          0
4.29/4.38	c   cmir             :       0.00          0          0          0          0          0
4.29/4.38	c   flowcover        :       0.00          0          0          0          0          0
4.29/4.38	c   clique           :       0.00          5          0          0          0          0
4.29/4.38	c   zerohalf         :       0.00          0          0          0          0          0
4.29/4.38	c   mcf              :       0.00          1          0          0          0          0
4.29/4.38	c   rapidlearning    :       0.05          1          0          0          0          0
4.29/4.38	c Pricers            :       Time      Calls       Vars
4.29/4.38	c   problem variables:       0.00          0          0
4.29/4.38	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
4.29/4.38	c   relpscost        :       3.18         32          0          1          0          0         62
4.29/4.38	c   pscost           :       0.00          0          0          0          0          0          0
4.29/4.38	c   inference        :       0.00          0          0          0          0          0          0
4.29/4.38	c   mostinf          :       0.00          0          0          0          0          0          0
4.29/4.38	c   leastinf         :       0.00          0          0          0          0          0          0
4.29/4.38	c   fullstrong       :       0.00          0          0          0          0          0          0
4.29/4.38	c   allfullstrong    :       0.00          0          0          0          0          0          0
4.29/4.38	c   random           :       0.00          0          0          0          0          0          0
4.29/4.38	c Primal Heuristics  :       Time      Calls      Found
4.29/4.38	c   LP solutions     :       0.00          -          1
4.29/4.38	c   pseudo solutions :       0.00          -          0
4.29/4.38	c   trivial          :       0.00          1          0
4.29/4.38	c   simplerounding   :       0.00          0          0
4.29/4.38	c   zirounding       :       0.00          0          0
4.29/4.38	c   rounding         :       0.00          0          0
4.29/4.38	c   shifting         :       0.00          0          0
4.29/4.38	c   intshifting      :       0.00          0          0
4.29/4.38	c   oneopt           :       0.00          0          0
4.29/4.38	c   twoopt           :       0.00          0          0
4.29/4.38	c   fixandinfer      :       0.00          0          0
4.29/4.38	c   feaspump         :       0.00          0          0
4.29/4.38	c   coefdiving       :       0.00          0          0
4.29/4.38	c   pscostdiving     :       0.00          0          0
4.29/4.38	c   fracdiving       :       0.00          0          0
4.29/4.38	c   veclendiving     :       0.00          0          0
4.29/4.38	c   intdiving        :       0.00          0          0
4.29/4.38	c   actconsdiving    :       0.00          0          0
4.29/4.38	c   objpscostdiving  :       0.00          0          0
4.29/4.38	c   rootsoldiving    :       0.00          0          0
4.29/4.38	c   linesearchdiving :       0.00          0          0
4.29/4.38	c   guideddiving     :       0.00          0          0
4.29/4.38	c   octane           :       0.00          0          0
4.29/4.38	c   rens             :       0.00          0          0
4.29/4.38	c   rins             :       0.00          0          0
4.29/4.38	c   localbranching   :       0.00          0          0
4.29/4.38	c   mutation         :       0.00          0          0
4.29/4.38	c   crossover        :       0.00          0          0
4.29/4.38	c   dins             :       0.00          0          0
4.29/4.38	c   undercover       :       0.00          0          0
4.29/4.38	c   nlp              :       0.00          0          0
4.29/4.38	c   trysol           :       0.00          0          0
4.29/4.38	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
4.29/4.38	c   primal LP        :       0.00          0          0       0.00          -
4.29/4.38	c   dual LP          :       0.25         38       1546      40.68    6159.39
4.29/4.38	c   lex dual LP      :       0.00          0          0       0.00          -
4.29/4.38	c   barrier LP       :       0.00          0          0       0.00          -
4.29/4.38	c   diving/probing LP:       0.00          0          0       0.00          -
4.29/4.38	c   strong branching :       3.18        844      20826      24.68    6557.35
4.29/4.38	c     (at root node) :          -         33        997      30.21          -
4.29/4.38	c   conflict analysis:       0.00          0          0       0.00          -
4.29/4.38	c B&B Tree           :
4.29/4.38	c   number of runs   :          1
4.29/4.38	c   nodes            :         32
4.29/4.38	c   nodes (total)    :         32
4.29/4.38	c   nodes left       :          0
4.29/4.38	c   max depth        :         31
4.29/4.38	c   max depth (total):         31
4.29/4.38	c   backtracks       :          0 (0.0%)
4.29/4.38	c   delayed cutoffs  :          0
4.29/4.38	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
4.29/4.38	c   avg switch length:       2.00
4.29/4.38	c   switching time   :       0.00
4.29/4.38	c Solution           :
4.29/4.38	c   Solutions found  :          1 (1 improvements)
4.29/4.38	c   First Solution   : +0.00000000000000e+00   (in run 1, after 32 nodes, 4.36 seconds, depth 31, found by <relaxation>)
4.29/4.38	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 32 nodes, 4.36 seconds, depth 31, found by <relaxation>)
4.29/4.38	c   Dual Bound       : +0.00000000000000e+00
4.29/4.38	c   Gap              :       0.00 %
4.29/4.38	c   Root Dual Bound  : +0.00000000000000e+00
4.29/4.38	c   Root Iterations  :       1226
4.29/4.40	c Time complete: 4.39.

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-2704184-1278550044/watcher-2704184-1278550044 -o /tmp/evaluation-result-2704184-1278550044/solver-2704184-1278550044 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704184-1278550044.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: 1.04 1.03 0.93 3/106 26113
/proc/meminfo: memFree=1952888/2059040 swapFree=4134668/4192956
[pid=26113] ppid=26111 vsize=7904 CPUtime=0
/proc/26113/stat : 26113 (pbscip.linux.x8) R 26111 26113 25530 0 -1 4202496 1055 0 0 0 0 0 0 0 20 0 1 0 23212098 8093696 967 1992294400 4194304 8395647 140733848388256 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/26113/statm: 1976 976 365 1026 0 946 0

[startup+0.0128131 s]
/proc/loadavg: 1.04 1.03 0.93 3/106 26113
/proc/meminfo: memFree=1952888/2059040 swapFree=4134668/4192956
[pid=26113] ppid=26111 vsize=10208 CPUtime=0
/proc/26113/stat : 26113 (pbscip.linux.x8) R 26111 26113 25530 0 -1 4202496 1844 0 0 0 0 0 0 0 20 0 1 0 23212098 10452992 1756 1992294400 4194304 8395647 140733848388256 18446744073709551615 6347101 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/26113/statm: 2552 1763 390 1026 0 1522 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 10208

[startup+0.1008 s]
/proc/loadavg: 1.04 1.03 0.93 3/106 26113
/proc/meminfo: memFree=1952888/2059040 swapFree=4134668/4192956
[pid=26113] ppid=26111 vsize=17768 CPUtime=0.09
/proc/26113/stat : 26113 (pbscip.linux.x8) R 26111 26113 25530 0 -1 4202496 4027 0 0 0 8 1 0 0 20 0 1 0 23212098 18194432 3567 1992294400 4194304 8395647 140733848388256 18446744073709551615 6200797 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26113/statm: 4442 3567 570 1026 0 3412 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 17768

[startup+0.300822 s]
/proc/loadavg: 1.04 1.03 0.93 3/106 26113
/proc/meminfo: memFree=1952888/2059040 swapFree=4134668/4192956
[pid=26113] ppid=26111 vsize=31492 CPUtime=0.29
/proc/26113/stat : 26113 (pbscip.linux.x8) R 26111 26113 25530 0 -1 4202496 7409 0 0 0 27 2 0 0 20 0 1 0 23212098 32247808 6949 1992294400 4194304 8395647 140733848388256 18446744073709551615 6345893 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26113/statm: 7873 6950 586 1026 0 6843 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 31492

[startup+0.700867 s]
/proc/loadavg: 1.04 1.03 0.93 3/106 26113
/proc/meminfo: memFree=1952888/2059040 swapFree=4134668/4192956
[pid=26113] ppid=26111 vsize=31884 CPUtime=0.69
/proc/26113/stat : 26113 (pbscip.linux.x8) R 26111 26113 25530 0 -1 4202496 8006 0 0 0 66 3 0 0 21 0 1 0 23212098 32649216 7062 1992294400 4194304 8395647 140733848388256 18446744073709551615 7185461 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26113/statm: 7971 7062 599 1026 0 6941 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 31884

[startup+1.50095 s]
/proc/loadavg: 1.04 1.03 0.93 2/107 26114
/proc/meminfo: memFree=1925972/2059040 swapFree=4134668/4192956
[pid=26113] ppid=26111 vsize=31884 CPUtime=1.49
/proc/26113/stat : 26113 (pbscip.linux.x8) R 26111 26113 25530 0 -1 4202496 8008 0 0 0 145 4 0 0 23 0 1 0 23212098 32649216 7064 1992294400 4194304 8395647 140733848388256 18446744073709551615 6667522 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26113/statm: 7971 7064 601 1026 0 6941 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 31884

[startup+3.10113 s]
/proc/loadavg: 1.04 1.03 0.93 2/107 26114
/proc/meminfo: memFree=1925972/2059040 swapFree=4134668/4192956
[pid=26113] ppid=26111 vsize=31884 CPUtime=3.09
/proc/26113/stat : 26113 (pbscip.linux.x8) R 26111 26113 25530 0 -1 4202496 8008 0 0 0 300 9 0 0 25 0 1 0 23212098 32649216 7064 1992294400 4194304 8395647 140733848388256 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26113/statm: 7971 7064 601 1026 0 6941 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 31884

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

[startup+3.90122 s]
/proc/loadavg: 1.04 1.03 0.93 2/107 26114
/proc/meminfo: memFree=1925972/2059040 swapFree=4134668/4192956
[pid=26113] ppid=26111 vsize=31884 CPUtime=3.89
/proc/26113/stat : 26113 (pbscip.linux.x8) R 26111 26113 25530 0 -1 4202496 8008 0 0 0 378 11 0 0 25 0 1 0 23212098 32649216 7064 1992294400 4194304 8395647 140733848388256 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26113/statm: 7971 7064 601 1026 0 6941 0
Current children cumulated CPU time (s) 3.89
Current children cumulated vsize (KiB) 31884

[startup+4.30126 s]
/proc/loadavg: 1.04 1.03 0.93 2/107 26116
/proc/meminfo: memFree=1925852/2059040 swapFree=4134668/4192956
[pid=26113] ppid=26111 vsize=31884 CPUtime=4.29
/proc/26113/stat : 26113 (pbscip.linux.x8) R 26111 26113 25530 0 -1 4202496 8008 0 0 0 418 11 0 0 25 0 1 0 23212098 32649216 7064 1992294400 4194304 8395647 140733848388256 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/26113/statm: 7971 7064 601 1026 0 6941 0
Current children cumulated CPU time (s) 4.29
Current children cumulated vsize (KiB) 31884

Child status: 0
Real time (s): 4.40041
CPU time (s): 4.39933
CPU user time (s): 4.27735
CPU system time (s): 0.121981
CPU usage (%): 99.9754
Max. virtual memory (cumulated for all children) (KiB): 31884

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 4.27735
system time used= 0.121981
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 8014
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= 55

runsolver used 0.011998 second user time and 0.031995 second system time

The end

Launcher Data 

Begin job on node038 at 2010-07-08 02:47:25
IDJOB=2704184
IDBENCH=1391
IDSOLVER=1213
FILE ID=node038/2704184-1278550044
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_20_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-2704184-1278550044/watcher-2704184-1278550044 -o /tmp/evaluation-result-2704184-1278550044/solver-2704184-1278550044 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704184-1278550044.opb -t 1800 -m 1800

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

MD5SUM BENCH= 192f8feb97785f57d6eda41fc7a200be
RANDOM SEED=1811053207

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:       1953292 kB
Buffers:           572 kB
Cached:          30232 kB
SwapCached:       4980 kB
Active:          35272 kB
Inactive:         2308 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1953292 kB
SwapTotal:     4192956 kB
SwapFree:      4134668 kB
Dirty:           10420 kB
Writeback:           0 kB
AnonPages:        6680 kB
Mapped:           6388 kB
Slab:            46120 kB
PageTables:       4196 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181188 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:47:29