Trace number 3451958

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.9937 1.99405

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_200_10_4_15.opb
MD5SUM8b67f7a6443cbb8d169a20134c04d298
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.027995
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables400
Total number of constraints602
Number of constraints which are clauses200
Number of constraints which are cardinality constraints (but not clauses)1
Number of constraints which are nor clauses,nor cardinality constraints401
Minimum length of a constraint2
Maximum length of a constraint400
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 400
Number of bits of the biggest sum of numbers9
Number of products (including duplicates)5048
Sum of products size (including duplicates)10096
Number of different products2524
Sum of products size5048

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-3451958-1307113462.opb>
0.00/0.01	c original problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 602 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.03/0.06	c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 20592 impls, 400 clqs
0.03/0.09	c presolving (2 rounds):
0.03/0.09	c  0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.03/0.09	c  20592 implications, 400 cliques
0.03/0.09	c presolved problem has 2924 variables (2924 bin, 0 int, 0 impl, 0 cont) and 3126 constraints
0.03/0.09	c       1 constraints of type <knapsack>
0.03/0.09	c     600 constraints of type <setppc>
0.03/0.09	c    2524 constraints of type <and>
0.03/0.09	c       1 constraints of type <linear>
0.03/0.09	c transformed objective value is always integral (scale: 1)
0.03/0.09	c Presolving Time: 0.08
0.03/0.09	c - non default parameters ----------------------------------------------------------------------
0.03/0.09	c # SCIP version 2.0.1.4
0.03/0.09	c 
0.03/0.09	c # frequency for displaying node information lines
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.09	c display/freq = 10000
0.03/0.09	c 
0.03/0.09	c # maximal time in seconds to run
0.03/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.09	c limits/time = 1800
0.03/0.09	c 
0.03/0.09	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.09	c limits/memory = 13950
0.03/0.09	c 
0.03/0.09	c # solving stops, if the given number of solutions were found (-1: no limit)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.09	c limits/solutions = 1
0.03/0.09	c 
0.03/0.09	c # maximal number of separation rounds per node (-1: unlimited)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 5]
0.03/0.09	c separating/maxrounds = 1
0.03/0.09	c 
0.03/0.09	c # maximal number of separation rounds in the root node (-1: unlimited)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.09	c separating/maxroundsroot = 5
0.03/0.09	c 
0.03/0.09	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.03/0.09	c # [type: int, range: [1,2], default: 1]
0.03/0.09	c timing/clocktype = 2
0.03/0.09	c 
0.03/0.09	c # belongs reading time to solving time?
0.03/0.09	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.09	c timing/reading = TRUE
0.03/0.09	c 
0.03/0.09	c # should presolving try to simplify inequalities
0.03/0.09	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.09	c constraints/linear/simplifyinequalities = TRUE
0.03/0.09	c 
0.03/0.09	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.03/0.09	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.09	c constraints/indicator/addCouplingCons = TRUE
0.03/0.09	c 
0.03/0.09	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.03/0.09	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.03/0.09	c constraints/knapsack/disaggregation = FALSE
0.03/0.09	c 
0.03/0.09	c # should presolving try to simplify knapsacks
0.03/0.09	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.09	c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.09	c 
0.03/0.09	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.09	c presolving/probing/maxrounds = 0
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.09	c heuristics/coefdiving/freq = -1
0.03/0.09	c 
0.03/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.09	c heuristics/coefdiving/maxlpiterquot = 0.075
0.03/0.09	c 
0.03/0.09	c # additional number of allowed LP iterations
0.03/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.09	c heuristics/coefdiving/maxlpiterofs = 1500
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 30]
0.03/0.09	c heuristics/crossover/freq = -1
0.03/0.09	c 
0.03/0.09	c # number of nodes added to the contingent of the total nodes
0.03/0.09	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.03/0.09	c heuristics/crossover/nodesofs = 750
0.03/0.09	c 
0.03/0.09	c # number of nodes without incumbent change that heuristic should wait
0.03/0.09	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.03/0.09	c heuristics/crossover/nwaitingnodes = 100
0.03/0.09	c 
0.03/0.09	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.03/0.09	c # [type: real, range: [0,1], default: 0.1]
0.03/0.09	c heuristics/crossover/nodesquot = 0.15
0.03/0.09	c 
0.03/0.09	c # minimum percentage of integer variables that have to be fixed 
0.03/0.09	c # [type: real, range: [0,1], default: 0.666]
0.03/0.09	c heuristics/crossover/minfixingrate = 0.5
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.09	c heuristics/feaspump/freq = -1
0.03/0.09	c 
0.03/0.09	c # additional number of allowed LP iterations
0.03/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.09	c heuristics/feaspump/maxlpiterofs = 2000
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.09	c heuristics/fracdiving/freq = -1
0.03/0.09	c 
0.03/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.09	c heuristics/fracdiving/maxlpiterquot = 0.075
0.03/0.09	c 
0.03/0.09	c # additional number of allowed LP iterations
0.03/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.09	c heuristics/fracdiving/maxlpiterofs = 1500
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.09	c heuristics/guideddiving/freq = -1
0.03/0.09	c 
0.03/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.09	c heuristics/guideddiving/maxlpiterquot = 0.075
0.03/0.09	c 
0.03/0.09	c # additional number of allowed LP iterations
0.03/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.09	c heuristics/guideddiving/maxlpiterofs = 1500
0.03/0.09	c 
0.03/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.09	c heuristics/intdiving/maxlpiterquot = 0.075
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.09	c heuristics/intshifting/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.09	c heuristics/linesearchdiving/freq = -1
0.03/0.09	c 
0.03/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.09	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.03/0.09	c 
0.03/0.09	c # additional number of allowed LP iterations
0.03/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.09	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.09	c heuristics/objpscostdiving/freq = -1
0.03/0.09	c 
0.03/0.09	c # maximal fraction of diving LP iterations compared to total iteration number
0.03/0.09	c # [type: real, range: [0,1], default: 0.01]
0.03/0.09	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.03/0.09	c 
0.03/0.09	c # additional number of allowed LP iterations
0.03/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.09	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.09	c heuristics/oneopt/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.09	c heuristics/pscostdiving/freq = -1
0.03/0.09	c 
0.03/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.09	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.03/0.09	c 
0.03/0.09	c # additional number of allowed LP iterations
0.03/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.09	c heuristics/pscostdiving/maxlpiterofs = 1500
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.09	c heuristics/rens/freq = -1
0.03/0.09	c 
0.03/0.09	c # minimum percentage of integer variables that have to be fixable 
0.03/0.09	c # [type: real, range: [0,1], default: 0.5]
0.03/0.09	c heuristics/rens/minfixingrate = 0.3
0.03/0.09	c 
0.03/0.09	c # number of nodes added to the contingent of the total nodes
0.03/0.09	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.03/0.09	c heuristics/rens/nodesofs = 2000
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 20]
0.03/0.09	c heuristics/rootsoldiving/freq = -1
0.03/0.09	c 
0.03/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.03/0.09	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.03/0.09	c 
0.03/0.09	c # additional number of allowed LP iterations
0.03/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.09	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.09	c heuristics/rounding/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.09	c heuristics/shiftandpropagate/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.09	c heuristics/shifting/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.09	c heuristics/simplerounding/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.09	c heuristics/subnlp/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.09	c heuristics/trivial/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.09	c heuristics/trysol/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.09	c heuristics/undercover/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.03/0.09	c heuristics/veclendiving/freq = -1
0.03/0.09	c 
0.03/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.03/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.03/0.09	c heuristics/veclendiving/maxlpiterquot = 0.075
0.03/0.09	c 
0.03/0.09	c # additional number of allowed LP iterations
0.03/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.03/0.09	c heuristics/veclendiving/maxlpiterofs = 1500
0.03/0.09	c 
0.03/0.09	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.09	c heuristics/zirounding/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.09	c separating/cmir/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.09	c separating/flowcover/freq = -1
0.03/0.09	c 
0.03/0.09	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.09	c separating/rapidlearning/freq = 0
0.03/0.09	c 
0.03/0.09	c -----------------------------------------------------------------------------------------------
0.03/0.09	c start solving
0.03/0.09	c 
0.09/0.12	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.09/0.12	c   0.1s|     1 |     0 |    90 |     - |  12M|   0 |  44 |2924 |3126 |2924 |5650 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.36	c   0.4s|     1 |     0 |   108 |     - |  12M|   0 |  34 |2924 |3126 |2924 |5660 |  10 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.49/0.52	c   0.5s|     1 |     0 |   161 |     - |  12M|   0 |  45 |2924 |3126 |2924 |5668 |  18 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.69/0.77	c   0.8s|     1 |     0 |   188 |     - |  13M|   0 |  48 |2924 |3126 |2924 |5674 |  24 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.19/1.22	c   1.2s|     1 |     2 |   188 |     - |  13M|   0 |  48 |2924 |3126 |2924 |5674 |  24 |   0 |  10 | 0.000000e+00 |      --      |    Inf 
1.89/1.97	c * 2.0s|    72 |     0 |  1033 |  11.9 |  12M|  37 |   - |2924 |3129 |2924 | 762 | 299 |   3 | 398 | 0.000000e+00 | 0.000000e+00 |   0.00%
1.89/1.97	c 
1.89/1.97	c SCIP Status        : problem is solved [optimal solution found]
1.89/1.97	c Solving Time (sec) : 1.97
1.89/1.97	c Solving Nodes      : 72
1.89/1.97	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
1.89/1.97	c Dual Bound         : +0.00000000000000e+00
1.89/1.97	c Gap                : 0.00 %
1.89/1.97	s SATISFIABLE
1.89/1.97	v -x337 -x254 -x326 -x298 -x375 -x353 -x329 -x311 -x351 -x391 -x235 -x400 -x393 -x398 -x312 -x293 -x336 -x331 -x259 -x304 -x366 -x349 
1.89/1.97	v -x276 -x341 -x281 -x396 -x359 -x228 -x399 -x346 -x255 -x244 -x322 -x358 -x270 -x219 -x314 -x266 -x347 -x371 -x279 -x372 
1.89/1.97	v -x260 -x382 -x333 -x216 -x277 -x243 -x269 -x324 -x320 -x267 -x237 -x352 -x387 -x310 -x335 -x214 -x261 -x356 -x263 -x274 -x385 
1.89/1.97	v -x381 -x265 -x316 -x213 -x253 -x278 -x227 -x357 -x290 -x289 -x288 -x285 -x251 -x313 -x379 -x294 -x210 -x272 -x241 -x378 -x249 
1.89/1.97	v -x209 -x389 x286 -x250 -x234 -x224 -x264 -x306 -x361 -x268 -x388 -x334 -x383 -x380 -x330 -x271 x247 -x301 -x239 -x291 -x362 
1.89/1.97	v -x354 -x258 -x256 -x230 -x211 -x308 -x340 -x392 -x232 -x394 -x206 -x397 -x363 -x309 -x297 -x282 -x238 -x218 -x207 -x296 -x287 
1.89/1.97	v -x222 -x368 -x348 -x390 -x370 -x292 -x246 x217 -x248 -x344 -x273 -x299 -x343 -x332 -x245 -x376 -x377 -x373 -x307 -x295 x240 
1.89/1.97	v x236 x262 -x223 x325 x395 -x220 x300 x203 x367 -x257 x233 -x208 -x305 -x221 -x321 -x283 x323 x319 x374 -x369 -x202 -x360 -x339 
1.89/1.97	v -x280 -x252 -x231 -x225 -x212 -x205 -x318 -x350 -x342 -x303 -x215 -x204 -x365 -x315 -x355 -x201 -x384 -x328 -x317 -x242 -x345 
1.89/1.97	v -x386 -x229 -x226 -x338 -x364 -x327 -x275 -x284 -x302 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 
1.89/1.97	v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 
1.89/1.97	v -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 
1.89/1.97	v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 x127 
1.89/1.97	v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 
1.89/1.97	v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 
1.89/1.97	v -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 
1.89/1.97	v -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 x45 -x44 -x43 -x42 -x41 -x40 x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 
1.89/1.97	v -x31 -x30 -x29 -x28 x27 x26 x25 x24 x23 x22 -x21 x20 -x19 -x18 -x17 x16 x15 x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 
1.89/1.97	v -x3 x2 x1 
1.89/1.97	c SCIP Status        : problem is solved [optimal solution found]
1.89/1.97	c Total Time         :       1.97
1.89/1.97	c   solving          :       1.97
1.89/1.97	c   presolving       :       0.08 (included in solving)
1.89/1.97	c   reading          :       0.01 (included in solving)
1.89/1.97	c Original Problem   :
1.89/1.97	c   Problem name     : HOME/instance-3451958-1307113462.opb
1.89/1.97	c   Variables        : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.97	c   Constraints      : 602 initial, 602 maximal
1.89/1.97	c Presolved Problem  :
1.89/1.97	c   Problem name     : t_HOME/instance-3451958-1307113462.opb
1.89/1.97	c   Variables        : 2924 (2924 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.97	c   Constraints      : 3126 initial, 3129 maximal
1.89/1.97	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
1.89/1.97	c   trivial          :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.97	c   dualfix          :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.97	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.97	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.97	c   implics          :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.97	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.97	c   knapsack         :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.97	c   setppc           :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.97	c   and              :       0.05          0          0          0          0          0          0          0          0          0
1.89/1.97	c   linear           :       0.01          0          0          0          0          0          0          0          0          0
1.89/1.97	c   logicor          :       0.00          0          0          0          0          0          0          0          0          0
1.89/1.97	c   root node        :          -          0          -          -          0          -          -          -          -          -
1.89/1.97	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
1.89/1.97	c   integral         :          0          0          0         78          0          3          0          0         12          0          0        136
1.89/1.97	c   knapsack         :          1          4        209          1          0          0          0          0          0          0          0          0
1.89/1.97	c   setppc           :        600          4        212          1          0          0          0          3        237          0          0          0
1.89/1.97	c   and              :       2524         72        209          1          0          0          6          0       3062        278          0          0
1.89/1.97	c   linear           :          1          4        209          1          0          0          0          0          0          0          0          0
1.89/1.97	c   logicor          :          0+         0          4          0          0          0          0          0          3          0          0          0
1.89/1.97	c   countsols        :          0          0          0          1          0          2          0          0          0          0          0          0
1.89/1.97	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
1.89/1.97	c   integral         :       0.80       0.00       0.00       0.80       0.00       0.00       0.00
1.89/1.97	c   knapsack         :       0.01       0.01       0.00       0.00       0.00       0.00       0.00
1.89/1.97	c   setppc           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.89/1.97	c   and              :       0.03       0.02       0.01       0.00       0.00       0.00       0.00
1.89/1.97	c   linear           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.89/1.97	c   logicor          :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.89/1.97	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.89/1.97	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
1.89/1.97	c   vbounds          :          0          0          0          0
1.89/1.97	c   rootredcost      :          0          0          0          0
1.89/1.97	c   pseudoobj        :          0          0          0          0
1.89/1.97	c Propagator Timings :  TotalTime  Propagate    Resprop
1.89/1.97	c   vbounds          :       0.00       0.00       0.00
1.89/1.97	c   rootredcost      :       0.00       0.00       0.00
1.89/1.97	c   pseudoobj        :       0.00       0.00       0.00
1.89/1.97	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.89/1.97	c   propagation      :       0.00          3          3          3        3.0          0        0.0          -
1.89/1.97	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.89/1.97	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.89/1.97	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.89/1.97	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.89/1.97	c   applied globally :          -          -          -          3        3.0          -          -          -
1.89/1.97	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.89/1.97	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.89/1.97	c   cut pool         :       0.00          3          -          -          0          -    (maximal pool size: 125)
1.89/1.97	c   redcost          :       0.00         72          0          0          0          0
1.89/1.97	c   impliedbounds    :       0.00          4          0          0          4          0
1.89/1.97	c   intobj           :       0.00          0          0          0          0          0
1.89/1.97	c   gomory           :       0.43          4          0          0       1002          0
1.89/1.97	c   cgmip            :       0.00          0          0          0          0          0
1.89/1.97	c   closecuts        :       0.00          0          0          0          0          0
1.89/1.97	c   strongcg         :       0.31          4          0          0       1059          0
1.89/1.97	c   cmir             :       0.00          0          0          0          0          0
1.89/1.97	c   flowcover        :       0.00          0          0          0          0          0
1.89/1.97	c   clique           :       0.01          4          0          0         14          0
1.89/1.97	c   zerohalf         :       0.00          0          0          0          0          0
1.89/1.97	c   mcf              :       0.00          1          0          0          0          0
1.89/1.97	c   oddcycle         :       0.00          0          0          0          0          0
1.89/1.97	c   rapidlearning    :       0.06          1          0          0          0          0
1.89/1.97	c Pricers            :       Time      Calls       Vars
1.89/1.97	c   problem variables:       0.00          0          0
1.89/1.97	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.89/1.97	c   relpscost        :       0.80         77          0         12          0          0        136
1.89/1.97	c   pscost           :       0.00          0          0          0          0          0          0
1.89/1.97	c   inference        :       0.00          0          0          0          0          0          0
1.89/1.97	c   mostinf          :       0.00          0          0          0          0          0          0
1.89/1.97	c   leastinf         :       0.00          0          0          0          0          0          0
1.89/1.97	c   fullstrong       :       0.00          0          0          0          0          0          0
1.89/1.97	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.89/1.97	c   random           :       0.00          0          0          0          0          0          0
1.89/1.97	c Primal Heuristics  :       Time      Calls      Found
1.89/1.97	c   LP solutions     :       0.00          -          1
1.89/1.97	c   pseudo solutions :       0.00          -          0
1.89/1.97	c   trivial          :       0.00          1          0
1.89/1.97	c   shiftandpropagate:       0.00          0          0
1.89/1.97	c   simplerounding   :       0.00          0          0
1.89/1.97	c   zirounding       :       0.00          0          0
1.89/1.97	c   rounding         :       0.00          0          0
1.89/1.97	c   shifting         :       0.00          0          0
1.89/1.97	c   intshifting      :       0.00          0          0
1.89/1.97	c   oneopt           :       0.00          0          0
1.89/1.97	c   twoopt           :       0.00          0          0
1.89/1.97	c   fixandinfer      :       0.00          0          0
1.89/1.97	c   feaspump         :       0.00          0          0
1.89/1.97	c   clique           :       0.00          0          0
1.89/1.97	c   coefdiving       :       0.00          0          0
1.89/1.97	c   pscostdiving     :       0.00          0          0
1.89/1.97	c   fracdiving       :       0.00          0          0
1.89/1.97	c   veclendiving     :       0.00          0          0
1.89/1.97	c   intdiving        :       0.00          0          0
1.89/1.97	c   actconsdiving    :       0.00          0          0
1.89/1.97	c   objpscostdiving  :       0.00          0          0
1.89/1.97	c   rootsoldiving    :       0.00          0          0
1.89/1.97	c   linesearchdiving :       0.00          0          0
1.89/1.97	c   guideddiving     :       0.00          0          0
1.89/1.97	c   octane           :       0.00          0          0
1.89/1.97	c   rens             :       0.00          0          0
1.89/1.97	c   rins             :       0.00          0          0
1.89/1.97	c   localbranching   :       0.00          0          0
1.89/1.97	c   mutation         :       0.00          0          0
1.89/1.97	c   crossover        :       0.00          0          0
1.89/1.97	c   dins             :       0.00          0          0
1.89/1.97	c   vbounds          :       0.00          0          0
1.89/1.97	c   undercover       :       0.00          0          0
1.89/1.97	c   subnlp           :       0.00          0          0
1.89/1.97	c   trysol           :       0.00          0          0
1.89/1.97	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.89/1.97	c   primal LP        :       0.01          0          0       0.00       0.00
1.89/1.97	c   dual LP          :       0.12        129       1033       8.01    8344.17
1.89/1.97	c   lex dual LP      :       0.00          0          0       0.00          -
1.89/1.97	c   barrier LP       :       0.00          0          0       0.00          -
1.89/1.97	c   diving/probing LP:       0.00          0          0       0.00          -
1.89/1.97	c   strong branching :       0.80        398       5297      13.31    6639.48
1.89/1.97	c     (at root node) :          -         10       1376     137.60          -
1.89/1.97	c   conflict analysis:       0.00          0          0       0.00          -
1.89/1.97	c B&B Tree           :
1.89/1.97	c   number of runs   :          1
1.89/1.97	c   nodes            :         72
1.89/1.97	c   nodes (total)    :         72
1.89/1.97	c   nodes left       :          0
1.89/1.97	c   max depth        :         37
1.89/1.97	c   max depth (total):         37
1.89/1.97	c   backtracks       :          2 (2.8%)
1.89/1.97	c   delayed cutoffs  :          0
1.89/1.97	c   repropagations   :         39 (40 domain reductions, 0 cutoffs)
1.89/1.97	c   avg switch length:       3.08
1.89/1.97	c   switching time   :       0.02
1.89/1.97	c Solution           :
1.89/1.97	c   Solutions found  :          1 (1 improvements)
1.89/1.97	c   First Solution   : +0.00000000000000e+00   (in run 1, after 72 nodes, 1.97 seconds, depth 37, found by <relaxation>)
1.89/1.97	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 72 nodes, 1.97 seconds, depth 37, found by <relaxation>)
1.89/1.97	c   Dual Bound       : +0.00000000000000e+00
1.89/1.97	c   Gap              :       0.00 %
1.89/1.97	c   Root Dual Bound  : +0.00000000000000e+00
1.89/1.97	c   Root Iterations  :        188
1.89/1.99	c Time complete: 1.99.

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-3451958-1307113462/watcher-3451958-1307113462 -o /tmp/evaluation-result-3451958-1307113462/solver-3451958-1307113462 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3451958-1307113462.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.01 2.04 2.00 2/514 6096
/proc/meminfo: memFree=18999932/32950940 swapFree=67111364/67111528
[pid=6096] ppid=6094 vsize=10448 CPUtime=0 cores=1,3,5,7
/proc/6096/stat : 6096 (scip-2.0.1.4.li) R 6094 6096 4622 0 -1 4202496 1596 0 0 0 0 0 0 0 25 0 1 0 901576973 10698752 1550 33554432000 4194304 9128323 140733444630912 18446744073709551615 8057568 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/6096/statm: 2612 1550 398 1205 0 1403 0

[startup+0.0406149 s]
/proc/loadavg: 2.01 2.04 2.00 2/514 6096
/proc/meminfo: memFree=18999932/32950940 swapFree=67111364/67111528
[pid=6096] ppid=6094 vsize=22808 CPUtime=0.03 cores=1,3,5,7
/proc/6096/stat : 6096 (scip-2.0.1.4.li) R 6094 6096 4622 0 -1 4202496 4698 0 0 0 3 0 0 0 25 0 1 0 901576973 23355392 4394 33554432000 4194304 9128323 140733444630912 18446744073709551615 18446744073699065904 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6096/statm: 5702 4394 491 1205 0 4493 0
Current children cumulated CPU time (s) 0.03
Current children cumulated vsize (KiB) 22808

[startup+0.100607 s]
/proc/loadavg: 2.01 2.04 2.00 2/514 6096
/proc/meminfo: memFree=18999932/32950940 swapFree=67111364/67111528
[pid=6096] ppid=6094 vsize=29316 CPUtime=0.09 cores=1,3,5,7
/proc/6096/stat : 6096 (scip-2.0.1.4.li) R 6094 6096 4622 0 -1 4202496 6430 0 0 0 9 0 0 0 25 0 1 0 901576973 30019584 6126 33554432000 4194304 9128323 140733444630912 18446744073709551615 8117530 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6096/statm: 7329 6126 583 1205 0 6120 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 29316

[startup+0.300574 s]
/proc/loadavg: 2.01 2.04 2.00 2/514 6096
/proc/meminfo: memFree=18999932/32950940 swapFree=67111364/67111528
[pid=6096] ppid=6094 vsize=60236 CPUtime=0.29 cores=1,3,5,7
/proc/6096/stat : 6096 (scip-2.0.1.4.li) R 6094 6096 4622 0 -1 4202496 14552 0 0 0 28 1 0 0 25 0 1 0 901576973 61681664 14004 33554432000 4194304 9128323 140733444630912 18446744073709551615 4820409 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6096/statm: 15059 14008 689 1205 0 13850 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 60236

[startup+0.7005 s]
/proc/loadavg: 2.01 2.04 2.00 2/514 6096
/proc/meminfo: memFree=18999932/32950940 swapFree=67111364/67111528
[pid=6096] ppid=6094 vsize=64804 CPUtime=0.69 cores=1,3,5,7
/proc/6096/stat : 6096 (scip-2.0.1.4.li) R 6094 6096 4622 0 -1 4202496 16606 0 0 0 67 2 0 0 25 0 1 0 901576973 66359296 14983 33554432000 4194304 9128323 140733444630912 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6096/statm: 16201 14983 712 1205 0 14992 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 64804

[startup+1.50036 s]
/proc/loadavg: 2.01 2.04 2.00 3/515 6097
/proc/meminfo: memFree=18941272/32950940 swapFree=67111364/67111528
[pid=6096] ppid=6094 vsize=64804 CPUtime=1.49 cores=1,3,5,7
/proc/6096/stat : 6096 (scip-2.0.1.4.li) R 6094 6096 4622 0 -1 4202496 16610 0 0 0 146 3 0 0 25 0 1 0 901576973 66359296 14987 33554432000 4194304 9128323 140733444630912 18446744073709551615 4765980 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6096/statm: 16201 14987 716 1205 0 14992 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 64804

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

[startup+1.90029 s]
/proc/loadavg: 2.01 2.04 2.00 3/515 6097
/proc/meminfo: memFree=18941272/32950940 swapFree=67111364/67111528
[pid=6096] ppid=6094 vsize=64804 CPUtime=1.89 cores=1,3,5,7
/proc/6096/stat : 6096 (scip-2.0.1.4.li) R 6094 6096 4622 0 -1 4202496 16610 0 0 0 185 4 0 0 25 0 1 0 901576973 66359296 14987 33554432000 4194304 9128323 140733444630912 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6096/statm: 16201 14987 716 1205 0 14992 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 64804

Child status: 0
Real time (s): 1.99405
CPU time (s): 1.9937
CPU user time (s): 1.9417
CPU system time (s): 0.051992
CPU usage (%): 99.9823
Max. virtual memory (cumulated for all children) (KiB): 64804

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.9417
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= 16622
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= 28

runsolver used 0.008998 second user time and 0.030995 second system time

The end

Launcher Data 

Begin job on node117 at 2011-06-03 17:04:22
IDJOB=3451958
IDBENCH=48327
IDSOLVER=1949
FILE ID=node117/3451958-1307113462
RUNJOBID= node117-1307109834-5830
PBS_JOBID= 13497973
Free space on /tmp= 73612 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_200_10_4_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-3451958-1307113462/watcher-3451958-1307113462 -o /tmp/evaluation-result-3451958-1307113462/solver-3451958-1307113462 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3451958-1307113462.opb -t 1800 -m 15500

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

MD5SUM BENCH= 8b67f7a6443cbb8d169a20134c04d298
RANDOM SEED=222342197

node117.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.849
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.69
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.849
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.849
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.74
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.849
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.849
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.75
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.849
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.849
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.849
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	: 5267.44
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32950940 kB
MemFree:      19000212 kB
Buffers:        365272 kB
Cached:        3155144 kB
SwapCached:          0 kB
Active:       10479636 kB
Inactive:      3074788 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32950940 kB
LowFree:      19000212 kB
SwapTotal:    67111528 kB
SwapFree:     67111364 kB
Dirty:           11956 kB
Writeback:           0 kB
AnonPages:    10034072 kB
Mapped:          45152 kB
Slab:           268540 kB
PageTables:      58612 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83586996 kB
Committed_AS: 149742496 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= 73600 MiB
End job on node117 at 2011-06-03 17:04:24