Trace number 3451955

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.52277 1.52701

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_100_10_5_15.opb
MD5SUM83214d787cadd98abf7f558767343a58
Bench CategoryDEC-SMALLINT-NLC (no optimisation, small integers, non 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.020996
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables200
Total number of constraints302
Number of constraints which are clauses100
Number of constraints which are cardinality constraints (but not clauses)1
Number of constraints which are nor clauses,nor cardinality constraints201
Minimum length of a constraint2
Maximum length of a constraint200
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 15
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 200
Number of bits of the biggest sum of numbers8
Number of products (including duplicates)2504
Sum of products size (including duplicates)5008
Number of different products1252
Sum of products size2504

Solver Data 

0.00/0.01	c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01	c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01	c 
0.00/0.01	c user parameter file <scip.set> not found - using default parameters
0.00/0.01	c reading problem <HOME/instance-3451955-1307113443.opb>
0.00/0.01	c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 302 constraints
0.00/0.01	c problem read
0.00/0.01	c No objective function, only one solution is needed.
0.00/0.01	c presolving settings loaded
0.00/0.02	c presolving:
0.02/0.04	c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10216 impls, 200 clqs
0.02/0.07	c presolving (2 rounds):
0.02/0.07	c  0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.07	c  10216 implications, 200 cliques
0.02/0.07	c presolved problem has 1452 variables (1452 bin, 0 int, 0 impl, 0 cont) and 1554 constraints
0.02/0.07	c       1 constraints of type <knapsack>
0.02/0.07	c     300 constraints of type <setppc>
0.02/0.07	c    1252 constraints of type <and>
0.02/0.07	c       1 constraints of type <linear>
0.02/0.07	c transformed objective value is always integral (scale: 1)
0.02/0.07	c Presolving Time: 0.06
0.02/0.07	c - non default parameters ----------------------------------------------------------------------
0.02/0.07	c # SCIP version 2.0.1.4
0.02/0.07	c 
0.02/0.07	c # frequency for displaying node information lines
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.07	c display/freq = 10000
0.02/0.07	c 
0.02/0.07	c # maximal time in seconds to run
0.02/0.07	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.07	c limits/time = 1800
0.02/0.07	c 
0.02/0.07	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.07	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.07	c limits/memory = 13950
0.02/0.07	c 
0.02/0.07	c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.07	c limits/solutions = 1
0.02/0.07	c 
0.02/0.07	c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.07	c separating/maxrounds = 1
0.02/0.07	c 
0.02/0.07	c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.07	c separating/maxroundsroot = 5
0.02/0.07	c 
0.02/0.07	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.07	c # [type: int, range: [1,2], default: 1]
0.02/0.07	c timing/clocktype = 2
0.02/0.07	c 
0.02/0.07	c # belongs reading time to solving time?
0.02/0.07	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07	c timing/reading = TRUE
0.02/0.07	c 
0.02/0.07	c # should presolving try to simplify inequalities
0.02/0.07	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07	c constraints/linear/simplifyinequalities = TRUE
0.02/0.07	c 
0.02/0.07	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.07	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07	c constraints/indicator/addCouplingCons = TRUE
0.02/0.07	c 
0.02/0.07	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.07	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.07	c constraints/knapsack/disaggregation = FALSE
0.02/0.07	c 
0.02/0.07	c # should presolving try to simplify knapsacks
0.02/0.07	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07	c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.07	c 
0.02/0.07	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.07	c presolving/probing/maxrounds = 0
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.07	c heuristics/coefdiving/freq = -1
0.02/0.07	c 
0.02/0.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.07	c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.07	c 
0.02/0.07	c # additional number of allowed LP iterations
0.02/0.07	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.07	c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.07	c heuristics/crossover/freq = -1
0.02/0.07	c 
0.02/0.07	c # number of nodes added to the contingent of the total nodes
0.02/0.07	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.07	c heuristics/crossover/nodesofs = 750
0.02/0.07	c 
0.02/0.07	c # number of nodes without incumbent change that heuristic should wait
0.02/0.07	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.07	c heuristics/crossover/nwaitingnodes = 100
0.02/0.07	c 
0.02/0.07	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.07	c # [type: real, range: [0,1], default: 0.1]
0.02/0.07	c heuristics/crossover/nodesquot = 0.15
0.02/0.07	c 
0.02/0.07	c # minimum percentage of integer variables that have to be fixed 
0.02/0.07	c # [type: real, range: [0,1], default: 0.666]
0.02/0.07	c heuristics/crossover/minfixingrate = 0.5
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.07	c heuristics/feaspump/freq = -1
0.02/0.07	c 
0.02/0.07	c # additional number of allowed LP iterations
0.02/0.07	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.07	c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.07	c heuristics/fracdiving/freq = -1
0.02/0.07	c 
0.02/0.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.07	c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.07	c 
0.02/0.07	c # additional number of allowed LP iterations
0.02/0.07	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.07	c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.07	c heuristics/guideddiving/freq = -1
0.02/0.07	c 
0.02/0.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.07	c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.07	c 
0.02/0.07	c # additional number of allowed LP iterations
0.02/0.07	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.07	c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.07	c 
0.02/0.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.07	c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.07	c heuristics/intshifting/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.07	c heuristics/linesearchdiving/freq = -1
0.02/0.07	c 
0.02/0.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.07	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.07	c 
0.02/0.07	c # additional number of allowed LP iterations
0.02/0.07	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.07	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.07	c heuristics/objpscostdiving/freq = -1
0.02/0.07	c 
0.02/0.07	c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.07	c # [type: real, range: [0,1], default: 0.01]
0.02/0.07	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.07	c 
0.02/0.07	c # additional number of allowed LP iterations
0.02/0.07	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.07	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.07	c heuristics/oneopt/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.07	c heuristics/pscostdiving/freq = -1
0.02/0.07	c 
0.02/0.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.07	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.07	c 
0.02/0.07	c # additional number of allowed LP iterations
0.02/0.07	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.07	c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.07	c heuristics/rens/freq = -1
0.02/0.07	c 
0.02/0.07	c # minimum percentage of integer variables that have to be fixable 
0.02/0.07	c # [type: real, range: [0,1], default: 0.5]
0.02/0.07	c heuristics/rens/minfixingrate = 0.3
0.02/0.07	c 
0.02/0.07	c # number of nodes added to the contingent of the total nodes
0.02/0.07	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.07	c heuristics/rens/nodesofs = 2000
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.07	c heuristics/rootsoldiving/freq = -1
0.02/0.07	c 
0.02/0.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.07	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.07	c 
0.02/0.07	c # additional number of allowed LP iterations
0.02/0.07	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.07	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.07	c heuristics/rounding/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.07	c heuristics/shiftandpropagate/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.07	c heuristics/shifting/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.07	c heuristics/simplerounding/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.07	c heuristics/subnlp/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.07	c heuristics/trivial/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.07	c heuristics/trysol/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.07	c heuristics/undercover/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.07	c heuristics/veclendiving/freq = -1
0.02/0.07	c 
0.02/0.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.07	c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.07	c 
0.02/0.07	c # additional number of allowed LP iterations
0.02/0.07	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.07	c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.07	c 
0.02/0.07	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.07	c heuristics/zirounding/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.07	c separating/cmir/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.07	c separating/flowcover/freq = -1
0.02/0.07	c 
0.02/0.07	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.07	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.07	c separating/rapidlearning/freq = 0
0.02/0.07	c 
0.02/0.07	c -----------------------------------------------------------------------------------------------
0.02/0.07	c start solving
0.02/0.07	c 
0.02/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.02/0.09	c   0.1s|     1 |     0 |   146 |     - |6152k|   0 |  79 |1452 |1554 |1452 |2806 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.27	c   0.3s|     1 |     0 |   177 |     - |6570k|   0 |  75 |1452 |1565 |1452 |2818 |  12 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.39/0.42	c   0.4s|     1 |     0 |   215 |     - |6939k|   0 |  95 |1452 |1565 |1452 |2825 |  19 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.58/0.60	c   0.6s|     1 |     0 |   240 |     - |7316k|   0 |  97 |1452 |1565 |1452 |2834 |  28 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.68/0.76	c   0.8s|     1 |     0 |   266 |     - |7645k|   0 |  95 |1452 |1565 |1452 |2842 |  36 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.89/0.94	c   0.9s|     1 |     0 |   309 |     - |8075k|   0 |  97 |1452 |1565 |1452 |2848 |  42 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.11/1.16	c   1.2s|     1 |     2 |   309 |     - |8076k|   0 |  97 |1452 |1565 |1452 |2848 |  42 |   0 |   9 | 0.000000e+00 |      --      |    Inf 
1.48/1.51	c * 1.5s|    22 |     0 |   893 |  27.8 |7927k|  20 |   - |1452 |1566 |1452 | 517 | 211 |   1 | 208 | 0.000000e+00 | 0.000000e+00 |   0.00%
1.48/1.51	c 
1.48/1.51	c SCIP Status        : problem is solved [optimal solution found]
1.48/1.51	c Solving Time (sec) : 1.51
1.48/1.51	c Solving Nodes      : 22
1.48/1.51	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
1.48/1.51	c Dual Bound         : +0.00000000000000e+00
1.48/1.51	c Gap                : 0.00 %
1.48/1.51	s SATISFIABLE
1.48/1.51	v -x148 -x139 -x160 -x157 -x183 -x131 -x156 -x196 -x165 -x122 -x198 -x197 -x170 -x113 -x163 -x158 -x130 -x126 -x125 -x119 -x159 -x192 
1.48/1.51	v -x195 -x144 -x142 -x120 -x164 -x175 x107 -x181 -x118 x188 x145 -x191 -x151 -x169 -x134 -x117 -x143 -x190 -x186 -x116 -x124 
1.48/1.51	v -x136 -x104 -x193 -x179 x140 -x108 -x138 -x154 x172 x162 -x200 -x109 x103 x194 -x178 -x146 x141 x137 -x185 -x128 -x147 -x168 
1.48/1.51	v x153 -x184 x180 -x102 -x171 -x135 -x114 -x110 -x105 -x106 x115 -x187 -x129 -x199 -x161 x127 -x101 -x189 -x167 -x155 -x152 
1.48/1.51	v -x149 -x132 -x123 -x112 -x182 -x174 -x150 x121 -x133 -x177 -x173 -x111 -x166 -x176 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 
1.48/1.51	v -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 
1.48/1.51	v -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 x44 x43 -x42 
1.48/1.51	v -x41 -x40 -x39 x38 -x37 -x36 -x35 -x34 -x33 x32 x31 -x30 -x29 -x28 -x27 -x26 x25 x24 -x23 -x22 -x21 x20 x19 -x18 -x17 -x16 -x15 
1.48/1.51	v x14 -x13 x12 -x11 -x10 -x9 -x8 -x7 x6 x5 -x4 -x3 -x2 x1 
1.48/1.51	c SCIP Status        : problem is solved [optimal solution found]
1.48/1.51	c Total Time         :       1.51
1.48/1.51	c   solving          :       1.51
1.48/1.51	c   presolving       :       0.06 (included in solving)
1.48/1.51	c   reading          :       0.01 (included in solving)
1.48/1.51	c Original Problem   :
1.48/1.51	c   Problem name     : HOME/instance-3451955-1307113443.opb
1.48/1.51	c   Variables        : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
1.48/1.51	c   Constraints      : 302 initial, 302 maximal
1.48/1.51	c Presolved Problem  :
1.48/1.51	c   Problem name     : t_HOME/instance-3451955-1307113443.opb
1.48/1.51	c   Variables        : 1452 (1452 binary, 0 integer, 0 implicit integer, 0 continuous)
1.48/1.51	c   Constraints      : 1554 initial, 1566 maximal
1.48/1.51	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
1.48/1.51	c   trivial          :       0.00          0          0          0          0          0          0          0          0          0
1.48/1.51	c   dualfix          :       0.00          0          0          0          0          0          0          0          0          0
1.48/1.51	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
1.48/1.51	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
1.48/1.51	c   implics          :       0.00          0          0          0          0          0          0          0          0          0
1.48/1.51	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
1.48/1.51	c   knapsack         :       0.00          0          0          0          0          0          0          0          0          0
1.48/1.51	c   setppc           :       0.00          0          0          0          0          0          0          0          0          0
1.48/1.51	c   and              :       0.04          0          0          0          0          0          0          0          0          0
1.48/1.51	c   linear           :       0.00          0          0          0          0          0          0          0          0          0
1.48/1.51	c   logicor          :       0.00          0          0          0          0          0          0          0          0          0
1.48/1.51	c   root node        :          -          0          -          -          0          -          -          -          -          -
1.48/1.51	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
1.48/1.51	c   integral         :          0          0          0         27          0          3          0          0          5          0          0         40
1.48/1.51	c   knapsack         :          1          5         60          3          0          0          0          0          0          0          0          0
1.48/1.51	c   setppc           :        300          5         60          3          0          0          0          1        113          0          0          0
1.48/1.51	c   and              :       1252         25         59          3          0          0          2          0       1139        174          0          0
1.48/1.51	c   linear           :          1+         6         59          1          0          0          0          0          1          0          0          0
1.48/1.51	c   logicor          :          0+         0          1          0          0          0          0          0          1          0          0          0
1.48/1.51	c   countsols        :          0          0          0          1          0          2          0          0          0          0          0          0
1.48/1.51	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
1.48/1.51	c   integral         :       0.52       0.00       0.00       0.52       0.00       0.00       0.00
1.48/1.51	c   knapsack         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.48/1.51	c   setppc           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.48/1.51	c   and              :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.48/1.51	c   linear           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.48/1.51	c   logicor          :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.48/1.51	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.48/1.51	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
1.48/1.51	c   vbounds          :          0          0          0          0
1.48/1.51	c   rootredcost      :          0          0          0          0
1.48/1.51	c   pseudoobj        :          0          0          0          0
1.48/1.51	c Propagator Timings :  TotalTime  Propagate    Resprop
1.48/1.51	c   vbounds          :       0.00       0.00       0.00
1.48/1.51	c   rootredcost      :       0.00       0.00       0.00
1.48/1.51	c   pseudoobj        :       0.00       0.00       0.00
1.48/1.51	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.48/1.51	c   propagation      :       0.00          1          1          1        3.0          0        0.0          -
1.48/1.51	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.48/1.51	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.48/1.51	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.48/1.51	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.48/1.51	c   applied globally :          -          -          -          1        3.0          -          -          -
1.48/1.51	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.48/1.51	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.48/1.51	c   cut pool         :       0.00          4          -          -         15          -    (maximal pool size: 417)
1.48/1.51	c   redcost          :       0.00         25          0          0          0          0
1.48/1.51	c   impliedbounds    :       0.00          5          0          0         14          0
1.48/1.51	c   intobj           :       0.00          0          0          0          0          0
1.48/1.51	c   gomory           :       0.48          5          0          0         56          0
1.48/1.51	c   cgmip            :       0.00          0          0          0          0          0
1.48/1.51	c   closecuts        :       0.00          0          0          0          0          0
1.48/1.51	c   strongcg         :       0.27          5          0          0       2500          0
1.48/1.51	c   cmir             :       0.00          0          0          0          0          0
1.48/1.51	c   flowcover        :       0.00          0          0          0          0          0
1.48/1.51	c   clique           :       0.01          5          0          0         30          0
1.48/1.51	c   zerohalf         :       0.00          0          0          0          0          0
1.48/1.51	c   mcf              :       0.00          1          0          0          0          0
1.48/1.51	c   oddcycle         :       0.00          0          0          0          0          0
1.48/1.51	c   rapidlearning    :       0.05          1          0          0          0         11
1.48/1.51	c Pricers            :       Time      Calls       Vars
1.48/1.51	c   problem variables:       0.00          0          0
1.48/1.51	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.48/1.51	c   relpscost        :       0.52         24          0          5          0          0         40
1.48/1.51	c   pscost           :       0.00          0          0          0          0          0          0
1.48/1.51	c   inference        :       0.00          0          0          0          0          0          0
1.48/1.51	c   mostinf          :       0.00          0          0          0          0          0          0
1.48/1.51	c   leastinf         :       0.00          0          0          0          0          0          0
1.48/1.51	c   fullstrong       :       0.00          0          0          0          0          0          0
1.48/1.51	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.48/1.51	c   random           :       0.00          0          0          0          0          0          0
1.48/1.51	c Primal Heuristics  :       Time      Calls      Found
1.48/1.51	c   LP solutions     :       0.00          -          1
1.48/1.51	c   pseudo solutions :       0.00          -          0
1.48/1.51	c   trivial          :       0.00          1          0
1.48/1.51	c   shiftandpropagate:       0.00          0          0
1.48/1.51	c   simplerounding   :       0.00          0          0
1.48/1.51	c   zirounding       :       0.00          0          0
1.48/1.51	c   rounding         :       0.00          0          0
1.48/1.51	c   shifting         :       0.00          0          0
1.48/1.51	c   intshifting      :       0.00          0          0
1.48/1.51	c   oneopt           :       0.00          0          0
1.48/1.51	c   twoopt           :       0.00          0          0
1.48/1.51	c   fixandinfer      :       0.00          0          0
1.48/1.51	c   feaspump         :       0.00          0          0
1.48/1.51	c   clique           :       0.00          0          0
1.48/1.51	c   coefdiving       :       0.00          0          0
1.48/1.51	c   pscostdiving     :       0.00          0          0
1.48/1.51	c   fracdiving       :       0.00          0          0
1.48/1.51	c   veclendiving     :       0.00          0          0
1.48/1.51	c   intdiving        :       0.00          0          0
1.48/1.51	c   actconsdiving    :       0.00          0          0
1.48/1.51	c   objpscostdiving  :       0.00          0          0
1.48/1.51	c   rootsoldiving    :       0.00          0          0
1.48/1.51	c   linesearchdiving :       0.00          0          0
1.48/1.51	c   guideddiving     :       0.00          0          0
1.48/1.51	c   octane           :       0.00          0          0
1.48/1.51	c   rens             :       0.00          0          0
1.48/1.51	c   rins             :       0.00          0          0
1.48/1.51	c   localbranching   :       0.00          0          0
1.48/1.51	c   mutation         :       0.00          0          0
1.48/1.51	c   crossover        :       0.00          0          0
1.48/1.51	c   dins             :       0.00          0          0
1.48/1.51	c   vbounds          :       0.00          0          0
1.48/1.51	c   undercover       :       0.00          0          0
1.48/1.51	c   subnlp           :       0.00          0          0
1.48/1.51	c   trysol           :       0.00          0          0
1.48/1.51	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.48/1.51	c   primal LP        :       0.00          0          0       0.00          -
1.48/1.51	c   dual LP          :       0.07         52        893      17.17   12605.34
1.48/1.51	c   lex dual LP      :       0.00          0          0       0.00          -
1.48/1.51	c   barrier LP       :       0.00          0          0       0.00          -
1.48/1.51	c   diving/probing LP:       0.00          0          0       0.00          -
1.48/1.51	c   strong branching :       0.52        208       5561      26.74   10664.78
1.48/1.51	c     (at root node) :          -          9       1761     195.67          -
1.48/1.51	c   conflict analysis:       0.00          0          0       0.00          -
1.48/1.51	c B&B Tree           :
1.48/1.51	c   number of runs   :          1
1.48/1.51	c   nodes            :         22
1.48/1.51	c   nodes (total)    :         22
1.48/1.51	c   nodes left       :          0
1.48/1.51	c   max depth        :         20
1.48/1.51	c   max depth (total):         20
1.48/1.51	c   backtracks       :          0 (0.0%)
1.48/1.51	c   delayed cutoffs  :          0
1.48/1.51	c   repropagations   :          1 (8 domain reductions, 0 cutoffs)
1.48/1.51	c   avg switch length:       2.00
1.48/1.51	c   switching time   :       0.01
1.48/1.51	c Solution           :
1.48/1.51	c   Solutions found  :          1 (1 improvements)
1.48/1.51	c   First Solution   : +0.00000000000000e+00   (in run 1, after 22 nodes, 1.51 seconds, depth 20, found by <relaxation>)
1.48/1.51	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 22 nodes, 1.51 seconds, depth 20, found by <relaxation>)
1.48/1.51	c   Dual Bound       : +0.00000000000000e+00
1.48/1.51	c   Gap              :       0.00 %
1.48/1.51	c   Root Dual Bound  : +0.00000000000000e+00
1.48/1.51	c   Root Iterations  :        309
1.48/1.52	c Time complete: 1.52.

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-3451955-1307113443/watcher-3451955-1307113443 -o /tmp/evaluation-result-3451955-1307113443/solver-3451955-1307113443 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3451955-1307113443.opb -t 1800 -m 15500 

running on 4 cores: 1,3,5,7

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


[startup+0 s]
/proc/loadavg: 2.29 2.09 2.02 3/530 30387
/proc/meminfo: memFree=15163412/32951132 swapFree=46579808/67111528
[pid=30387] ppid=30384 vsize=16968 CPUtime=0.01 cores=1,3,5,7
/proc/30387/stat : 30387 (scip-2.0.1.4.li) R 30384 30387 28716 0 -1 4202496 2998 0 0 0 1 0 0 0 25 0 1 0 822942927 17375232 2950 33554432000 4194304 9128323 140733610006336 18446744073709551615 8062746 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/30387/statm: 4339 2966 473 1205 0 3130 0

[startup+0.0284821 s]
/proc/loadavg: 2.29 2.09 2.02 3/530 30387
/proc/meminfo: memFree=15163412/32951132 swapFree=46579808/67111528
[pid=30387] ppid=30384 vsize=18848 CPUtime=0.02 cores=1,3,5,7
/proc/30387/stat : 30387 (scip-2.0.1.4.li) R 30384 30387 28716 0 -1 4202496 3743 0 0 0 2 0 0 0 25 0 1 0 822942927 19300352 3438 33554432000 4194304 9128323 140733610006336 18446744073709551615 18446744073699065939 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/30387/statm: 4712 3438 491 1205 0 3503 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 18848

[startup+0.100468 s]
/proc/loadavg: 2.29 2.09 2.02 3/530 30387
/proc/meminfo: memFree=15163412/32951132 swapFree=46579808/67111528
[pid=30387] ppid=30384 vsize=27432 CPUtime=0.09 cores=1,3,5,7
/proc/30387/stat : 30387 (scip-2.0.1.4.li) R 30384 30387 28716 0 -1 4202496 6228 0 0 0 9 0 0 0 18 0 1 0 822942927 28090368 5808 33554432000 4194304 9128323 140733610006336 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/30387/statm: 6858 5808 665 1205 0 5649 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 27432

[startup+0.300435 s]
/proc/loadavg: 2.29 2.09 2.02 3/530 30387
/proc/meminfo: memFree=15163412/32951132 swapFree=46579808/67111528
[pid=30387] ppid=30384 vsize=44888 CPUtime=0.29 cores=1,3,5,7
/proc/30387/stat : 30387 (scip-2.0.1.4.li) R 30384 30387 28716 0 -1 4202496 10892 0 0 0 28 1 0 0 18 0 1 0 822942927 45965312 10112 33554432000 4194304 9128323 140733610006336 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/30387/statm: 11222 10112 719 1205 0 10013 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 44888

[startup+0.700363 s]
/proc/loadavg: 2.29 2.09 2.02 3/530 30387
/proc/meminfo: memFree=15163412/32951132 swapFree=46579808/67111528
[pid=30387] ppid=30384 vsize=44888 CPUtime=0.68 cores=1,3,5,7
/proc/30387/stat : 30387 (scip-2.0.1.4.li) R 30384 30387 28716 0 -1 4202496 10939 0 0 0 67 1 0 0 18 0 1 0 822942927 45965312 10158 33554432000 4194304 9128323 140733610006336 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/30387/statm: 11222 10158 718 1205 0 10013 0
Current children cumulated CPU time (s) 0.68
Current children cumulated vsize (KiB) 44888

[startup+1.50022 s]
/proc/loadavg: 2.29 2.09 2.02 3/531 30388
/proc/meminfo: memFree=15124904/32951132 swapFree=46579808/67111528
[pid=30387] ppid=30384 vsize=44888 CPUtime=1.48 cores=1,3,5,7
/proc/30387/stat : 30387 (scip-2.0.1.4.li) R 30384 30387 28716 0 -1 4202496 11000 0 0 0 144 4 0 0 19 0 1 0 822942927 45965312 10219 33554432000 4194304 9128323 140733610006336 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/30387/statm: 11222 10219 721 1205 0 10013 0
Current children cumulated CPU time (s) 1.48
Current children cumulated vsize (KiB) 44888

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

Child status: 0
Real time (s): 1.52701
CPU time (s): 1.52277
CPU user time (s): 1.47078
CPU system time (s): 0.051992
CPU usage (%): 99.7221
Max. virtual memory (cumulated for all children) (KiB): 44888

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.47078
system time used= 0.051992
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 11007
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 3
involuntary context switches= 2

runsolver used 0.010998 second user time and 0.030995 second system time

The end

Launcher Data 

Begin job on node128 at 2011-06-03 17:04:03
IDJOB=3451955
IDBENCH=48324
IDSOLVER=1949
FILE ID=node128/3451955-1307113443
RUNJOBID= node128-1307108023-29940
PBS_JOBID= 13497962
Free space on /tmp= 73904 MiB

SOLVER NAME= SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4
BENCH NAME= PB07/normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/manquinho/dbsg/normalized-dbsg_100_10_5_15.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-3451955-1307113443/watcher-3451955-1307113443 -o /tmp/evaluation-result-3451955-1307113443/solver-3451955-1307113443 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3451955-1307113443.opb -t 1800 -m 15500

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

MD5SUM BENCH= 83214d787cadd98abf7f558767343a58
RANDOM SEED=704517525

node128.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.852
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.70
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.852
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	: 5332.75
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.852
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.82
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.852
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.852
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.82
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.852
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.75
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.852
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.82
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.852
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	: 5434.49
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32951132 kB
MemFree:      15163568 kB
Buffers:        322296 kB
Cached:        3473304 kB
SwapCached:      35620 kB
Active:        9097496 kB
Inactive:      8374764 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32951132 kB
LowFree:      15163568 kB
SwapTotal:    67111528 kB
SwapFree:     46579808 kB
Dirty:           12280 kB
Writeback:          28 kB
AnonPages:    13650628 kB
Mapped:          20924 kB
Slab:           133272 kB
PageTables:     112332 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83587092 kB
Committed_AS: 174887128 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    296000 kB
VmallocChunk: 34359440975 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 73892 MiB
End job on node128 at 2011-06-03 17:04:04