Trace number 3453026

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
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4SAT 1.04084 1.04189

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/
FPGA_SAT05/normalized-fpga12_10_sat_pb.cnf.cr.opb
MD5SUM08f887bbbbfea31f6c38c070eebe6907
Bench CategoryDEC-SMALLINT-LIN (no optimisation, small integers, linear constraints)
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.000999
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables180
Total number of constraints152
Number of constraints which are clauses130
Number of constraints which are cardinality constraints (but not clauses)22
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint6
Maximum length of a constraint12
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 13
Number of bits of the biggest sum of numbers4
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

0.00/0.00	c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00	c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00	c 
0.00/0.00	c user parameter file <scip.set> not found - using default parameters
0.00/0.00	c reading problem <HOME/instance-3453026-1307071589.opb>
0.00/0.00	c original problem has 180 variables (180 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.00/0.00	c problem read
0.00/0.00	c No objective function, only one solution is needed.
0.00/0.00	c presolving settings loaded
0.00/0.00	c presolving:
0.00/0.01	c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 152 upgd conss, 0 impls, 22 clqs
0.00/0.01	c presolving (2 rounds):
0.00/0.01	c  0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01	c  0 implications, 22 cliques
0.00/0.01	c presolved problem has 180 variables (180 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.00/0.01	c      22 constraints of type <setppc>
0.00/0.01	c     130 constraints of type <logicor>
0.00/0.01	c transformed objective value is always integral (scale: 1)
0.00/0.01	c Presolving Time: 0.00
0.00/0.01	c - non default parameters ----------------------------------------------------------------------
0.00/0.01	c # SCIP version 2.0.1.4
0.00/0.01	c 
0.00/0.01	c # frequency for displaying node information lines
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01	c display/freq = 10000
0.00/0.01	c 
0.00/0.01	c # maximal time in seconds to run
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01	c limits/time = 1800
0.00/0.01	c 
0.00/0.01	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01	c limits/memory = 13950
0.00/0.01	c 
0.00/0.01	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c limits/solutions = 1
0.00/0.01	c 
0.00/0.01	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01	c separating/maxrounds = 1
0.00/0.01	c 
0.00/0.01	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c separating/maxroundsroot = 5
0.00/0.01	c 
0.00/0.01	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01	c # [type: int, range: [1,2], default: 1]
0.00/0.01	c timing/clocktype = 2
0.00/0.01	c 
0.00/0.01	c # belongs reading time to solving time?
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c timing/reading = TRUE
0.00/0.01	c 
0.00/0.01	c # should presolving try to simplify inequalities
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/linear/simplifyinequalities = TRUE
0.00/0.01	c 
0.00/0.01	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/indicator/addCouplingCons = TRUE
0.00/0.01	c 
0.00/0.01	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01	c constraints/knapsack/disaggregation = FALSE
0.00/0.01	c 
0.00/0.01	c # should presolving try to simplify knapsacks
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01	c 
0.00/0.01	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c presolving/probing/maxrounds = 0
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/coefdiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01	c heuristics/crossover/freq = -1
0.00/0.01	c 
0.00/0.01	c # number of nodes added to the contingent of the total nodes
0.00/0.01	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01	c heuristics/crossover/nodesofs = 750
0.00/0.01	c 
0.00/0.01	c # number of nodes without incumbent change that heuristic should wait
0.00/0.01	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01	c heuristics/crossover/nwaitingnodes = 100
0.00/0.01	c 
0.00/0.01	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01	c # [type: real, range: [0,1], default: 0.1]
0.00/0.01	c heuristics/crossover/nodesquot = 0.15
0.00/0.01	c 
0.00/0.01	c # minimum percentage of integer variables that have to be fixed 
0.00/0.01	c # [type: real, range: [0,1], default: 0.666]
0.00/0.01	c heuristics/crossover/minfixingrate = 0.5
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01	c heuristics/feaspump/freq = -1
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/fracdiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/guideddiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/intshifting/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/linesearchdiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01	c heuristics/objpscostdiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01	c # [type: real, range: [0,1], default: 0.01]
0.00/0.01	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/oneopt/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/pscostdiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c heuristics/rens/freq = -1
0.00/0.01	c 
0.00/0.01	c # minimum percentage of integer variables that have to be fixable 
0.00/0.01	c # [type: real, range: [0,1], default: 0.5]
0.00/0.01	c heuristics/rens/minfixingrate = 0.3
0.00/0.01	c 
0.00/0.01	c # number of nodes added to the contingent of the total nodes
0.00/0.01	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01	c heuristics/rens/nodesofs = 2000
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01	c heuristics/rootsoldiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/rounding/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c heuristics/shiftandpropagate/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/shifting/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/simplerounding/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/subnlp/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c heuristics/trivial/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/trysol/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c heuristics/undercover/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/veclendiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/zirounding/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c separating/cmir/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c separating/flowcover/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c separating/rapidlearning/freq = 0
0.00/0.01	c 
0.00/0.01	c -----------------------------------------------------------------------------------------------
0.00/0.01	c start solving
0.00/0.01	c 
0.00/0.01	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.01	c   0.0s|     1 |     0 |    59 |     - | 760k|   0 |  41 | 180 | 152 | 180 | 152 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.00/0.04	c   0.0s|     1 |     0 |    80 |     - |1014k|   0 |  47 | 180 | 196 | 180 | 155 |   3 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.00/0.05	c   0.0s|     1 |     0 |   158 |     - |1081k|   0 |  47 | 180 | 196 | 180 | 161 |   9 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.04/0.06	c   0.1s|     1 |     0 |   212 |     - |1247k|   0 |  51 | 180 | 196 | 180 | 169 |  17 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.04/0.07	c   0.1s|     1 |     0 |   269 |     - |1467k|   0 |  51 | 180 | 196 | 180 | 174 |  22 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.04/0.08	c   0.1s|     1 |     0 |   341 |     - |1661k|   0 |  49 | 180 | 196 | 180 | 183 |  31 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.04/0.09	c   0.1s|     1 |     2 |   341 |     - |1661k|   0 |  49 | 180 | 196 | 180 | 183 |  31 |   0 |  14 | 0.000000e+00 |      --      |    Inf 
1.00/1.03	c * 1.0s|  1735 |     0 |  9228 |   5.1 |2212k|  27 |   - | 180 |1227 | 180 | 165 |  31 |1061 |1478 | 0.000000e+00 | 0.000000e+00 |   0.00%
1.00/1.03	c 
1.00/1.03	c SCIP Status        : problem is solved [optimal solution found]
1.00/1.03	c Solving Time (sec) : 1.03
1.00/1.03	c Solving Nodes      : 1735
1.00/1.03	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
1.00/1.03	c Dual Bound         : +0.00000000000000e+00
1.00/1.03	c Gap                : 0.00 %
1.00/1.03	s SATISFIABLE
1.00/1.03	v -x108 -x105 -x42 -x17 -x23 -x21 -x44 -x38 -x41 -x40 -x96 -x90 -x88 -x87 -x85 -x98 -x92 -x102 -x106 -x100 -x79 -x24 -x101 -x12 -x10 
1.00/1.03	v -x9 -x6 -x2 -x8 -x3 -x5 -x78 -x77 -x37 x15 -x81 -x82 -x11 x43 -x1 -x7 x86 -x91 -x93 -x83 -x13 x73 -x22 -x39 -x48 x104 -x75 
1.00/1.03	v -x19 -x84 x60 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x145 -x144 -x143 -x142 -x141 -x89 -x46 -x16 -x72 -x71 -x69 
1.00/1.03	v -x68 -x66 -x65 -x64 -x63 -x62 -x76 -x140 -x139 -x138 -x137 x136 x4 -x35 -x34 -x32 -x31 -x29 -x28 -x27 -x25 -x107 -x94 -x103 
1.00/1.03	v -x155 -x154 -x153 -x152 x151 -x67 -x59 -x33 -x26 -x20 -x165 -x164 -x163 x162 -x161 -x45 -x18 -x120 -x119 -x118 x117 -x115 -x114 
1.00/1.03	v -x113 -x112 -x111 -x110 -x109 -x74 -x47 -x97 -x175 -x174 -x173 -x172 -x171 -x95 -x180 -x179 x178 -x177 -x176 -x36 -x116 -x135 
1.00/1.03	v -x134 -x133 x132 -x131 -x99 -x170 x169 -x168 -x167 -x166 x70 -x130 -x129 x128 -x127 -x126 -x14 x160 -x159 -x158 -x157 -x156 
1.00/1.03	v -x80 x125 -x124 -x123 -x122 -x121 -x61 -x150 x149 -x148 -x147 -x146 x30 
1.00/1.03	c SCIP Status        : problem is solved [optimal solution found]
1.00/1.03	c Total Time         :       1.03
1.00/1.03	c   solving          :       1.03
1.00/1.03	c   presolving       :       0.00 (included in solving)
1.00/1.03	c   reading          :       0.00 (included in solving)
1.00/1.03	c Original Problem   :
1.00/1.03	c   Problem name     : HOME/instance-3453026-1307071589.opb
1.00/1.03	c   Variables        : 180 (180 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.03	c   Constraints      : 152 initial, 152 maximal
1.00/1.03	c Presolved Problem  :
1.00/1.03	c   Problem name     : t_HOME/instance-3453026-1307071589.opb
1.00/1.03	c   Variables        : 180 (180 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.03	c   Constraints      : 152 initial, 1227 maximal
1.00/1.03	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
1.00/1.03	c   trivial          :       0.00          0          0          0          0          0          0          0          0          0
1.00/1.03	c   dualfix          :       0.00          0          0          0          0          0          0          0          0          0
1.00/1.03	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
1.00/1.03	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
1.00/1.03	c   implics          :       0.00          0          0          0          0          0          0          0          0          0
1.00/1.03	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
1.00/1.03	c   setppc           :       0.00          0          0          0          0          0          0          0          0          0
1.00/1.03	c   linear           :       0.00          0          0          0          0          0          0          0          0          0
1.00/1.03	c   logicor          :       0.00          0          0          0          0          0          0          0          0          0
1.00/1.03	c   root node        :          -          0          -          -          0          -          -          -          -          -
1.00/1.03	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
1.00/1.03	c   integral         :          0          0          0       1333          0          3          0        211        284          0          0       1816
1.00/1.03	c   setppc           :         22          5       5179          1          0          0      16334         63       6491          0          0          0
1.00/1.03	c   linear           :          0+         5       3336          0          0          0          0          0          0          0          0          0
1.00/1.03	c   logicor          :        130+         5       2612          1          0          0       1772         86       4013          0          0          0
1.00/1.03	c   countsols        :          0          0          0          1          0          2          0          0          0          0          0          0
1.00/1.03	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
1.00/1.03	c   integral         :       0.52       0.00       0.00       0.52       0.00       0.00       0.00
1.00/1.03	c   setppc           :       0.01       0.00       0.01       0.00       0.00       0.00       0.00
1.00/1.03	c   linear           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.00/1.03	c   logicor          :       0.02       0.00       0.02       0.00       0.00       0.00       0.00
1.00/1.03	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.00/1.03	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
1.00/1.03	c   vbounds          :          0          0          0          0
1.00/1.03	c   rootredcost      :          0          0          0          0
1.00/1.03	c   pseudoobj        :          0          0          0          0
1.00/1.03	c Propagator Timings :  TotalTime  Propagate    Resprop
1.00/1.03	c   vbounds          :       0.00       0.00       0.00
1.00/1.03	c   rootredcost      :       0.00       0.00       0.00
1.00/1.03	c   pseudoobj        :       0.00       0.00       0.00
1.00/1.03	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.00/1.03	c   propagation      :       0.00        149        149        638       20.2          2       20.5          -
1.00/1.03	c   infeasible LP    :       0.03        506        483       3959       29.3          3       17.3          0
1.00/1.03	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.00/1.03	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.00/1.03	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.00/1.03	c   applied globally :          -          -          -       1061       17.4          -          -          -
1.00/1.03	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.00/1.03	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.00/1.03	c   cut pool         :       0.00          4          -          -         11          -    (maximal pool size: 281)
1.00/1.03	c   redcost          :       0.00       1149          0          0          0          0
1.00/1.03	c   impliedbounds    :       0.00          5          0          0          0          0
1.00/1.03	c   intobj           :       0.00          0          0          0          0          0
1.00/1.03	c   gomory           :       0.02          5          0          0        576          0
1.00/1.03	c   cgmip            :       0.00          0          0          0          0          0
1.00/1.03	c   closecuts        :       0.00          0          0          0          0          0
1.00/1.03	c   strongcg         :       0.02          5          0          0        640          0
1.00/1.03	c   cmir             :       0.00          0          0          0          0          0
1.00/1.03	c   flowcover        :       0.00          0          0          0          0          0
1.00/1.03	c   clique           :       0.00          5          0          0          0          0
1.00/1.03	c   zerohalf         :       0.00          0          0          0          0          0
1.00/1.03	c   mcf              :       0.00          1          0          0          0          0
1.00/1.03	c   oddcycle         :       0.00          0          0          0          0          0
1.00/1.03	c   rapidlearning    :       0.02          1          0          0          0         44
1.00/1.03	c Pricers            :       Time      Calls       Vars
1.00/1.03	c   problem variables:       0.00          0          0
1.00/1.03	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.00/1.03	c   relpscost        :       0.51       1332        211        284          0          0       1816
1.00/1.03	c   pscost           :       0.00          0          0          0          0          0          0
1.00/1.03	c   inference        :       0.00          0          0          0          0          0          0
1.00/1.03	c   mostinf          :       0.00          0          0          0          0          0          0
1.00/1.03	c   leastinf         :       0.00          0          0          0          0          0          0
1.00/1.03	c   fullstrong       :       0.00          0          0          0          0          0          0
1.00/1.03	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.00/1.03	c   random           :       0.00          0          0          0          0          0          0
1.00/1.03	c Primal Heuristics  :       Time      Calls      Found
1.00/1.03	c   LP solutions     :       0.00          -          1
1.00/1.03	c   pseudo solutions :       0.00          -          0
1.00/1.03	c   trivial          :       0.00          1          0
1.00/1.03	c   shiftandpropagate:       0.00          0          0
1.00/1.03	c   simplerounding   :       0.00          0          0
1.00/1.03	c   zirounding       :       0.00          0          0
1.00/1.03	c   rounding         :       0.00          0          0
1.00/1.03	c   shifting         :       0.00          0          0
1.00/1.03	c   intshifting      :       0.00          0          0
1.00/1.03	c   oneopt           :       0.00          0          0
1.00/1.03	c   twoopt           :       0.00          0          0
1.00/1.03	c   fixandinfer      :       0.00          0          0
1.00/1.03	c   feaspump         :       0.00          0          0
1.00/1.03	c   clique           :       0.00          0          0
1.00/1.03	c   coefdiving       :       0.00          0          0
1.00/1.03	c   pscostdiving     :       0.00          0          0
1.00/1.03	c   fracdiving       :       0.00          0          0
1.00/1.03	c   veclendiving     :       0.00          0          0
1.00/1.03	c   intdiving        :       0.00          0          0
1.00/1.03	c   actconsdiving    :       0.00          0          0
1.00/1.03	c   objpscostdiving  :       0.00          0          0
1.00/1.03	c   rootsoldiving    :       0.00          0          0
1.00/1.03	c   linesearchdiving :       0.00          0          0
1.00/1.03	c   guideddiving     :       0.00          0          0
1.00/1.03	c   octane           :       0.00          0          0
1.00/1.03	c   rens             :       0.00          0          0
1.00/1.03	c   rins             :       0.00          0          0
1.00/1.03	c   localbranching   :       0.00          0          0
1.00/1.03	c   mutation         :       0.00          0          0
1.00/1.03	c   crossover        :       0.00          0          0
1.00/1.03	c   dins             :       0.00          0          0
1.00/1.03	c   vbounds          :       0.00          0          0
1.00/1.03	c   undercover       :       0.00          0          0
1.00/1.03	c   subnlp           :       0.00          0          0
1.00/1.03	c   trysol           :       0.00          0          0
1.00/1.03	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.00/1.03	c   primal LP        :       0.00          0          0       0.00          -
1.00/1.03	c   dual LP          :       0.27       1826       9228       5.05   33968.31
1.00/1.03	c   lex dual LP      :       0.00          0          0       0.00          -
1.00/1.03	c   barrier LP       :       0.00          0          0       0.00          -
1.00/1.03	c   diving/probing LP:       0.00          0          0       0.00          -
1.00/1.03	c   strong branching :       0.49       1478      16042      10.85   32467.31
1.00/1.03	c     (at root node) :          -         14        274      19.57          -
1.00/1.03	c   conflict analysis:       0.00          0          0       0.00          -
1.00/1.03	c B&B Tree           :
1.00/1.03	c   number of runs   :          1
1.00/1.03	c   nodes            :       1735
1.00/1.03	c   nodes (total)    :       1735
1.00/1.03	c   nodes left       :          0
1.00/1.03	c   max depth        :         27
1.00/1.03	c   max depth (total):         27
1.00/1.03	c   backtracks       :        328 (18.9%)
1.00/1.03	c   delayed cutoffs  :         41
1.00/1.03	c   repropagations   :       1185 (2155 domain reductions, 40 cutoffs)
1.00/1.03	c   avg switch length:       3.51
1.00/1.03	c   switching time   :       0.03
1.00/1.03	c Solution           :
1.00/1.03	c   Solutions found  :          1 (1 improvements)
1.00/1.03	c   First Solution   : +0.00000000000000e+00   (in run 1, after 1735 nodes, 1.03 seconds, depth 20, found by <relaxation>)
1.00/1.03	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 1735 nodes, 1.03 seconds, depth 20, found by <relaxation>)
1.00/1.03	c   Dual Bound       : +0.00000000000000e+00
1.00/1.03	c   Gap              :       0.00 %
1.00/1.03	c   Root Dual Bound  : +0.00000000000000e+00
1.00/1.03	c   Root Iterations  :        341
1.00/1.04	c Time complete: 1.03.

Verifier Data 

OK	0

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.0 (svn: 977)

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3453026-1307071589/watcher-3453026-1307071589 -o /tmp/evaluation-result-3453026-1307071589/solver-3453026-1307071589 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453026-1307071589.opb -t 1800 -m 15500 

running on 4 cores: 0,2,4,6

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 2.07 2.06 2.01 2/515 6557
/proc/meminfo: memFree=17521344/32950928 swapFree=58671692/67111528
[pid=6557] ppid=6555 vsize=15624 CPUtime=0 cores=0,2,4,6
/proc/6557/stat : 6557 (scip-2.0.1.4.li) R 6555 6557 1417 0 -1 4202496 2654 0 0 0 0 0 0 0 25 0 1 0 897389620 15998976 2607 33554432000 4194304 9128323 140736534262592 18446744073709551615 5248672 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/6557/statm: 3906 2607 492 1205 0 2697 0

[startup+0.0509609 s]
/proc/loadavg: 2.07 2.06 2.01 2/515 6557
/proc/meminfo: memFree=17521344/32950928 swapFree=58671692/67111528
[pid=6557] ppid=6555 vsize=27636 CPUtime=0.04 cores=0,2,4,6
/proc/6557/stat : 6557 (scip-2.0.1.4.li) R 6555 6557 1417 0 -1 4202496 6186 0 0 0 4 0 0 0 18 0 1 0 897389620 28299264 5527 33554432000 4194304 9128323 140736534262592 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/6557/statm: 6909 5527 691 1205 0 5700 0
Current children cumulated CPU time (s) 0.04
Current children cumulated vsize (KiB) 27636

[startup+0.100947 s]
/proc/loadavg: 2.07 2.06 2.01 2/515 6557
/proc/meminfo: memFree=17521344/32950928 swapFree=58671692/67111528
[pid=6557] ppid=6555 vsize=27636 CPUtime=0.09 cores=0,2,4,6
/proc/6557/stat : 6557 (scip-2.0.1.4.li) R 6555 6557 1417 0 -1 4202496 6210 0 0 0 9 0 0 0 18 0 1 0 897389620 28299264 5551 33554432000 4194304 9128323 140736534262592 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/6557/statm: 6909 5551 697 1205 0 5700 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 27636

[startup+0.300909 s]
/proc/loadavg: 2.07 2.06 2.01 2/515 6557
/proc/meminfo: memFree=17521344/32950928 swapFree=58671692/67111528
[pid=6557] ppid=6555 vsize=27636 CPUtime=0.29 cores=0,2,4,6
/proc/6557/stat : 6557 (scip-2.0.1.4.li) R 6555 6557 1417 0 -1 4202496 6210 0 0 0 27 2 0 0 18 0 1 0 897389620 28299264 5551 33554432000 4194304 9128323 140736534262592 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/6557/statm: 6909 5551 697 1205 0 5700 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 27636

[startup+0.700836 s]
/proc/loadavg: 2.07 2.06 2.01 2/515 6557
/proc/meminfo: memFree=17521344/32950928 swapFree=58671692/67111528
[pid=6557] ppid=6555 vsize=27636 CPUtime=0.69 cores=0,2,4,6
/proc/6557/stat : 6557 (scip-2.0.1.4.li) R 6555 6557 1417 0 -1 4202496 6211 0 0 0 66 3 0 0 18 0 1 0 897389620 28299264 5552 33554432000 4194304 9128323 140736534262592 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/6557/statm: 6909 5552 697 1205 0 5700 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 27636

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

[startup+0.900797 s]
/proc/loadavg: 2.07 2.06 2.01 2/515 6557
/proc/meminfo: memFree=17521344/32950928 swapFree=58671692/67111528
[pid=6557] ppid=6555 vsize=27636 CPUtime=0.89 cores=0,2,4,6
/proc/6557/stat : 6557 (scip-2.0.1.4.li) R 6555 6557 1417 0 -1 4202496 6211 0 0 0 86 3 0 0 18 0 1 0 897389620 28299264 5552 33554432000 4194304 9128323 140736534262592 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/6557/statm: 6909 5552 697 1205 0 5700 0
Current children cumulated CPU time (s) 0.89
Current children cumulated vsize (KiB) 27636

[startup+1.00078 s]
/proc/loadavg: 2.07 2.06 2.01 3/516 6558
/proc/meminfo: memFree=17491328/32950928 swapFree=58671692/67111528
[pid=6557] ppid=6555 vsize=27636 CPUtime=1 cores=0,2,4,6
/proc/6557/stat : 6557 (scip-2.0.1.4.li) R 6555 6557 1417 0 -1 4202496 6211 0 0 0 96 4 0 0 19 0 1 0 897389620 28299264 5552 33554432000 4194304 9128323 140736534262592 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/6557/statm: 6909 5552 697 1205 0 5700 0
Current children cumulated CPU time (s) 1
Current children cumulated vsize (KiB) 27636

Child status: 0
Real time (s): 1.04189
CPU time (s): 1.04084
CPU user time (s): 0.992849
CPU system time (s): 0.047992
CPU usage (%): 99.8993
Max. virtual memory (cumulated for all children) (KiB): 27636

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

runsolver used 0.007998 second user time and 0.032994 second system time

The end

Launcher Data 

Begin job on node115 at 2011-06-03 05:26:29
IDJOB=3453026
IDBENCH=1423
IDSOLVER=1949
FILE ID=node115/3453026-1307071589
RUNJOBID= node115-1307067367-2467
PBS_JOBID= 13497873
Free space on /tmp= 73732 MiB

SOLVER NAME= SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/FPGA_SAT05/normalized-fpga12_10_sat_pb.cnf.cr.opb
COMMAND LINE= HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3453026-1307071589/watcher-3453026-1307071589 -o /tmp/evaluation-result-3453026-1307071589/solver-3453026-1307071589 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453026-1307071589.opb -t 1800 -m 15500

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

MD5SUM BENCH= 08f887bbbbfea31f6c38c070eebe6907
RANDOM SEED=2115268886

node115.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	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.811
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5333.62
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.811
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5226.15
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 2
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.811
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 3
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.811
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 4
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.811
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.77
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 5
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.811
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.74
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 6
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.811
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 7
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.811
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.74
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32950928 kB
MemFree:      17521376 kB
Buffers:        108256 kB
Cached:         336664 kB
SwapCached:      65764 kB
Active:        6782300 kB
Inactive:      8394564 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32950928 kB
LowFree:      17521376 kB
SwapTotal:    67111528 kB
SwapFree:     58671692 kB
Dirty:           12712 kB
Writeback:           0 kB
AnonPages:    14669992 kB
Mapped:          30272 kB
Slab:            96424 kB
PageTables:      86732 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83586992 kB
Committed_AS: 157877496 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    296008 kB
VmallocChunk: 34359440975 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 73720 MiB
End job on node115 at 2011-06-03 05:26:31