Trace number 3451972

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 0.349946 0.349847

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_200_10_2_15.opb
MD5SUM6247d91366961bc8ff12c33e03e6ccbd
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.029994
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)4984
Sum of products size (including duplicates)9968
Number of different products2492
Sum of products size4984

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-3451972-1307113567.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.01/0.02	c presolving:
0.01/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, 20336 impls, 400 clqs
0.01/0.09	c presolving (2 rounds):
0.01/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.01/0.09	c  20336 implications, 400 cliques
0.01/0.09	c presolved problem has 2892 variables (2892 bin, 0 int, 0 impl, 0 cont) and 3094 constraints
0.01/0.09	c       1 constraints of type <knapsack>
0.01/0.09	c     600 constraints of type <setppc>
0.01/0.09	c    2492 constraints of type <and>
0.01/0.09	c       1 constraints of type <linear>
0.01/0.09	c transformed objective value is always integral (scale: 1)
0.01/0.09	c Presolving Time: 0.08
0.01/0.09	c - non default parameters ----------------------------------------------------------------------
0.01/0.09	c # SCIP version 2.0.1.4
0.01/0.09	c 
0.01/0.09	c # frequency for displaying node information lines
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.09	c display/freq = 10000
0.01/0.09	c 
0.01/0.09	c # maximal time in seconds to run
0.01/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.09	c limits/time = 1800
0.01/0.09	c 
0.01/0.09	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.09	c limits/memory = 13950
0.01/0.09	c 
0.01/0.09	c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.09	c limits/solutions = 1
0.01/0.09	c 
0.01/0.09	c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.09	c separating/maxrounds = 1
0.01/0.09	c 
0.01/0.09	c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.09	c separating/maxroundsroot = 5
0.01/0.09	c 
0.01/0.09	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.09	c # [type: int, range: [1,2], default: 1]
0.01/0.09	c timing/clocktype = 2
0.01/0.09	c 
0.01/0.09	c # belongs reading time to solving time?
0.01/0.09	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.09	c timing/reading = TRUE
0.01/0.09	c 
0.01/0.09	c # should presolving try to simplify inequalities
0.01/0.09	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.09	c constraints/linear/simplifyinequalities = TRUE
0.01/0.09	c 
0.01/0.09	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.09	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.09	c constraints/indicator/addCouplingCons = TRUE
0.01/0.09	c 
0.01/0.09	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.09	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.09	c constraints/knapsack/disaggregation = FALSE
0.01/0.09	c 
0.01/0.09	c # should presolving try to simplify knapsacks
0.01/0.09	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.09	c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.09	c 
0.01/0.09	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.09	c presolving/probing/maxrounds = 0
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.09	c heuristics/coefdiving/freq = -1
0.01/0.09	c 
0.01/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.09	c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.09	c 
0.01/0.09	c # additional number of allowed LP iterations
0.01/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09	c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.09	c heuristics/crossover/freq = -1
0.01/0.09	c 
0.01/0.09	c # number of nodes added to the contingent of the total nodes
0.01/0.09	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.09	c heuristics/crossover/nodesofs = 750
0.01/0.09	c 
0.01/0.09	c # number of nodes without incumbent change that heuristic should wait
0.01/0.09	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.09	c heuristics/crossover/nwaitingnodes = 100
0.01/0.09	c 
0.01/0.09	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.09	c # [type: real, range: [0,1], default: 0.1]
0.01/0.09	c heuristics/crossover/nodesquot = 0.15
0.01/0.09	c 
0.01/0.09	c # minimum percentage of integer variables that have to be fixed 
0.01/0.09	c # [type: real, range: [0,1], default: 0.666]
0.01/0.09	c heuristics/crossover/minfixingrate = 0.5
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.09	c heuristics/feaspump/freq = -1
0.01/0.09	c 
0.01/0.09	c # additional number of allowed LP iterations
0.01/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09	c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.09	c heuristics/fracdiving/freq = -1
0.01/0.09	c 
0.01/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.09	c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.09	c 
0.01/0.09	c # additional number of allowed LP iterations
0.01/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09	c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.09	c heuristics/guideddiving/freq = -1
0.01/0.09	c 
0.01/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.09	c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.09	c 
0.01/0.09	c # additional number of allowed LP iterations
0.01/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09	c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.09	c 
0.01/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.09	c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.09	c heuristics/intshifting/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.09	c heuristics/linesearchdiving/freq = -1
0.01/0.09	c 
0.01/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.09	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.09	c 
0.01/0.09	c # additional number of allowed LP iterations
0.01/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.09	c heuristics/objpscostdiving/freq = -1
0.01/0.09	c 
0.01/0.09	c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.09	c # [type: real, range: [0,1], default: 0.01]
0.01/0.09	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.09	c 
0.01/0.09	c # additional number of allowed LP iterations
0.01/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.09	c heuristics/oneopt/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.09	c heuristics/pscostdiving/freq = -1
0.01/0.09	c 
0.01/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.09	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.09	c 
0.01/0.09	c # additional number of allowed LP iterations
0.01/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09	c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.09	c heuristics/rens/freq = -1
0.01/0.09	c 
0.01/0.09	c # minimum percentage of integer variables that have to be fixable 
0.01/0.09	c # [type: real, range: [0,1], default: 0.5]
0.01/0.09	c heuristics/rens/minfixingrate = 0.3
0.01/0.09	c 
0.01/0.09	c # number of nodes added to the contingent of the total nodes
0.01/0.09	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.09	c heuristics/rens/nodesofs = 2000
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.09	c heuristics/rootsoldiving/freq = -1
0.01/0.09	c 
0.01/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.09	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.09	c 
0.01/0.09	c # additional number of allowed LP iterations
0.01/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.09	c heuristics/rounding/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.09	c heuristics/shiftandpropagate/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.09	c heuristics/shifting/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.09	c heuristics/simplerounding/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.09	c heuristics/subnlp/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.09	c heuristics/trivial/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.09	c heuristics/trysol/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.09	c heuristics/undercover/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.09	c heuristics/veclendiving/freq = -1
0.01/0.09	c 
0.01/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.09	c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.09	c 
0.01/0.09	c # additional number of allowed LP iterations
0.01/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.09	c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.09	c 
0.01/0.09	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.09	c heuristics/zirounding/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.09	c separating/cmir/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.09	c separating/flowcover/freq = -1
0.01/0.09	c 
0.01/0.09	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.09	c separating/rapidlearning/freq = 0
0.01/0.09	c 
0.01/0.09	c -----------------------------------------------------------------------------------------------
0.01/0.09	c start solving
0.01/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 |    68 |     - |  12M|   0 |  13 |2892 |3094 |2892 |5586 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.23	c   0.2s|     1 |     0 |    83 |     - |  12M|   0 |  20 |2892 |3094 |2892 |5591 |   5 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.33	c   0.3s|     1 |     0 |    84 |     - |  12M|   0 |   0 |2892 |3094 |2892 |5594 |   8 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.33	c * 0.3s|     1 |     0 |    84 |     - |  12M|   0 |   - |2892 |3094 |2892 |5594 |   8 |   0 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.29/0.33	c 
0.29/0.33	c SCIP Status        : problem is solved [optimal solution found]
0.29/0.33	c Solving Time (sec) : 0.33
0.29/0.33	c Solving Nodes      : 1
0.29/0.33	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
0.29/0.33	c Dual Bound         : +0.00000000000000e+00
0.29/0.33	c Gap                : 0.00 %
0.29/0.33	s SATISFIABLE
0.29/0.33	v -x337 -x271 -x243 -x325 -x375 -x334 -x247 -x395 -x360 -x303 -x396 -x330 -x295 -x298 -x296 -x256 -x244 -x394 -x313 -x328 -x326 -x258 
0.29/0.33	v -x377 -x287 -x227 -x249 -x251 -x289 -x263 -x381 -x308 -x302 -x286 -x388 -x226 -x348 -x354 -x364 -x230 -x301 -x266 -x314 
0.29/0.33	v -x352 -x272 -x365 -x223 -x312 -x290 -x281 -x240 -x220 -x279 -x327 -x353 -x216 -x339 -x241 -x341 -x267 -x372 -x268 -x399 -x217 
0.29/0.33	v -x323 -x345 -x340 -x285 -x269 -x292 -x351 -x213 -x305 -x232 -x333 -x382 -x342 -x306 -x336 -x275 -x393 -x390 -x273 -x233 -x284 
0.29/0.33	v -x212 -x347 -x283 -x384 -x355 -x239 -x215 -x319 -x309 -x356 -x209 -x260 -x242 -x224 -x218 -x252 -x304 -x282 -x277 -x254 -x234 
0.29/0.33	v -x386 -x207 -x371 -x288 -x311 -x391 -x369 -x318 -x257 -x317 -x206 -x379 -x359 -x338 -x235 -x363 -x349 -x324 -x361 -x367 -x400 
0.29/0.33	v -x246 -x205 -x344 -x321 -x293 -x259 -x208 -x276 -x315 -x357 -x366 -x261 -x307 -x329 -x385 -x237 -x236 -x358 -x398 -x378 -x253 
0.29/0.33	v -x397 -x362 -x383 -x387 -x203 -x335 -x310 -x274 -x270 -x248 -x225 -x204 -x214 -x297 -x231 -x211 -x392 -x316 -x370 -x373 
0.29/0.33	v -x202 -x332 -x322 -x300 -x280 -x245 -x229 -x219 -x210 -x331 -x368 -x374 -x255 x250 -x238 x294 x350 x380 x343 x201 x264 x222 x221 
0.29/0.33	v x228 x346 x278 x265 x299 -x262 -x376 -x389 x320 -x291 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 
0.29/0.33	v -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 
0.29/0.33	v -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 
0.29/0.33	v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 
0.29/0.33	v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 
0.29/0.33	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 
0.29/0.33	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 
0.29/0.33	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 
0.29/0.33	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 -x3 
0.29/0.33	v -x2 -x1 
0.29/0.33	c SCIP Status        : problem is solved [optimal solution found]
0.29/0.33	c Total Time         :       0.33
0.29/0.33	c   solving          :       0.33
0.29/0.33	c   presolving       :       0.08 (included in solving)
0.29/0.33	c   reading          :       0.01 (included in solving)
0.29/0.33	c Original Problem   :
0.29/0.33	c   Problem name     : HOME/instance-3451972-1307113567.opb
0.29/0.33	c   Variables        : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.33	c   Constraints      : 602 initial, 602 maximal
0.29/0.33	c Presolved Problem  :
0.29/0.33	c   Problem name     : t_HOME/instance-3451972-1307113567.opb
0.29/0.33	c   Variables        : 2892 (2892 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.33	c   Constraints      : 3094 initial, 3094 maximal
0.29/0.33	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
0.29/0.33	c   trivial          :       0.00          0          0          0          0          0          0          0          0          0
0.29/0.33	c   dualfix          :       0.00          0          0          0          0          0          0          0          0          0
0.29/0.33	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
0.29/0.33	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
0.29/0.33	c   implics          :       0.00          0          0          0          0          0          0          0          0          0
0.29/0.33	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
0.29/0.33	c   knapsack         :       0.00          0          0          0          0          0          0          0          0          0
0.29/0.33	c   setppc           :       0.00          0          0          0          0          0          0          0          0          0
0.29/0.33	c   and              :       0.05          0          0          0          0          0          0          0          0          0
0.29/0.33	c   linear           :       0.01          0          0          0          0          0          0          0          0          0
0.29/0.33	c   root node        :          -          0          -          -          0          -          -          -          -          -
0.29/0.33	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
0.29/0.33	c   integral         :          0          0          0          1          0          3          0          0          0          0          0          0
0.29/0.33	c   knapsack         :          1          3          1          1          0          0          0          0          0          0          0          0
0.29/0.33	c   setppc           :        600          3          1          1          0          0          0          0          0          0          0          0
0.29/0.33	c   and              :       2492          3          1          1          0          0          0          0          0          0          0          0
0.29/0.33	c   linear           :          1          3          1          1          0          0          0          0          0          0          0          0
0.29/0.33	c   countsols        :          0          0          0          1          0          2          0          0          0          0          0          0
0.29/0.33	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
0.29/0.33	c   integral         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.29/0.33	c   knapsack         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.29/0.33	c   setppc           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.29/0.33	c   and              :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.29/0.33	c   linear           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.29/0.33	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.29/0.33	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
0.29/0.33	c   vbounds          :          0          0          0          0
0.29/0.33	c   rootredcost      :          0          0          0          0
0.29/0.33	c   pseudoobj        :          0          0          0          0
0.29/0.33	c Propagator Timings :  TotalTime  Propagate    Resprop
0.29/0.33	c   vbounds          :       0.00       0.00       0.00
0.29/0.33	c   rootredcost      :       0.00       0.00       0.00
0.29/0.33	c   pseudoobj        :       0.00       0.00       0.00
0.29/0.33	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.29/0.33	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.29/0.33	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.29/0.33	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.29/0.33	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.29/0.33	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.29/0.33	c   applied globally :          -          -          -          0        0.0          -          -          -
0.29/0.33	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.29/0.33	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.29/0.33	c   cut pool         :       0.00          2          -          -          0          -    (maximal pool size: 26)
0.29/0.33	c   redcost          :       0.00          3          0          0          0          0
0.29/0.33	c   impliedbounds    :       0.00          2          0          0          0          0
0.29/0.33	c   intobj           :       0.00          0          0          0          0          0
0.29/0.33	c   gomory           :       0.06          2          0          0        501          0
0.29/0.33	c   cgmip            :       0.00          0          0          0          0          0
0.29/0.33	c   closecuts        :       0.00          0          0          0          0          0
0.29/0.33	c   strongcg         :       0.06          2          0          0        501          0
0.29/0.33	c   cmir             :       0.00          0          0          0          0          0
0.29/0.33	c   flowcover        :       0.00          0          0          0          0          0
0.29/0.33	c   clique           :       0.01          2          0          0          3          0
0.29/0.33	c   zerohalf         :       0.00          0          0          0          0          0
0.29/0.33	c   mcf              :       0.00          1          0          0          0          0
0.29/0.33	c   oddcycle         :       0.00          0          0          0          0          0
0.29/0.33	c   rapidlearning    :       0.06          1          0          0          0          0
0.29/0.33	c Pricers            :       Time      Calls       Vars
0.29/0.33	c   problem variables:       0.00          0          0
0.29/0.33	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.29/0.33	c   pscost           :       0.00          0          0          0          0          0          0
0.29/0.33	c   inference        :       0.00          0          0          0          0          0          0
0.29/0.33	c   mostinf          :       0.00          0          0          0          0          0          0
0.29/0.33	c   leastinf         :       0.00          0          0          0          0          0          0
0.29/0.33	c   fullstrong       :       0.00          0          0          0          0          0          0
0.29/0.33	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.29/0.33	c   random           :       0.00          0          0          0          0          0          0
0.29/0.33	c   relpscost        :       0.00          0          0          0          0          0          0
0.29/0.33	c Primal Heuristics  :       Time      Calls      Found
0.29/0.33	c   LP solutions     :       0.00          -          1
0.29/0.33	c   pseudo solutions :       0.00          -          0
0.29/0.33	c   trivial          :       0.00          1          0
0.29/0.33	c   shiftandpropagate:       0.00          0          0
0.29/0.33	c   simplerounding   :       0.00          0          0
0.29/0.33	c   zirounding       :       0.00          0          0
0.29/0.33	c   rounding         :       0.00          0          0
0.29/0.33	c   shifting         :       0.00          0          0
0.29/0.33	c   intshifting      :       0.00          0          0
0.29/0.33	c   oneopt           :       0.00          0          0
0.29/0.33	c   twoopt           :       0.00          0          0
0.29/0.33	c   fixandinfer      :       0.00          0          0
0.29/0.33	c   feaspump         :       0.00          0          0
0.29/0.33	c   clique           :       0.00          0          0
0.29/0.33	c   coefdiving       :       0.00          0          0
0.29/0.33	c   pscostdiving     :       0.00          0          0
0.29/0.33	c   fracdiving       :       0.00          0          0
0.29/0.33	c   veclendiving     :       0.00          0          0
0.29/0.33	c   intdiving        :       0.00          0          0
0.29/0.33	c   actconsdiving    :       0.00          0          0
0.29/0.33	c   objpscostdiving  :       0.00          0          0
0.29/0.33	c   rootsoldiving    :       0.00          0          0
0.29/0.33	c   linesearchdiving :       0.00          0          0
0.29/0.33	c   guideddiving     :       0.00          0          0
0.29/0.33	c   octane           :       0.00          0          0
0.29/0.33	c   rens             :       0.00          0          0
0.29/0.33	c   rins             :       0.00          0          0
0.29/0.33	c   localbranching   :       0.00          0          0
0.29/0.33	c   mutation         :       0.00          0          0
0.29/0.33	c   crossover        :       0.00          0          0
0.29/0.33	c   dins             :       0.00          0          0
0.29/0.33	c   vbounds          :       0.00          0          0
0.29/0.33	c   undercover       :       0.00          0          0
0.29/0.33	c   subnlp           :       0.00          0          0
0.29/0.33	c   trysol           :       0.00          0          0
0.29/0.33	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.29/0.33	c   primal LP        :       0.00          0          0       0.00          -
0.29/0.33	c   dual LP          :       0.01          3         84      28.00    5728.31
0.29/0.33	c   lex dual LP      :       0.00          0          0       0.00          -
0.29/0.33	c   barrier LP       :       0.00          0          0       0.00          -
0.29/0.33	c   diving/probing LP:       0.00          0          0       0.00          -
0.29/0.33	c   strong branching :       0.00          0          0       0.00          -
0.29/0.33	c     (at root node) :          -          0          0       0.00          -
0.29/0.33	c   conflict analysis:       0.00          0          0       0.00          -
0.29/0.33	c B&B Tree           :
0.29/0.33	c   number of runs   :          1
0.29/0.33	c   nodes            :          1
0.29/0.33	c   nodes (total)    :          1
0.29/0.33	c   nodes left       :          0
0.29/0.33	c   max depth        :          0
0.29/0.33	c   max depth (total):          0
0.29/0.33	c   backtracks       :          0 (0.0%)
0.29/0.33	c   delayed cutoffs  :          0
0.29/0.33	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.29/0.33	c   avg switch length:       2.00
0.29/0.33	c   switching time   :       0.00
0.29/0.33	c Solution           :
0.29/0.33	c   Solutions found  :          1 (1 improvements)
0.29/0.33	c   First Solution   : +0.00000000000000e+00   (in run 1, after 1 nodes, 0.33 seconds, depth 0, found by <relaxation>)
0.29/0.33	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 1 nodes, 0.33 seconds, depth 0, found by <relaxation>)
0.29/0.33	c   Dual Bound       : +0.00000000000000e+00
0.29/0.33	c   Gap              :       0.00 %
0.29/0.33	c   Root Dual Bound  : +0.00000000000000e+00
0.29/0.33	c   Root Iterations  :         84
0.29/0.34	c Time complete: 0.34.

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-3451972-1307113567/watcher-3451972-1307113567 -o /tmp/evaluation-result-3451972-1307113567/solver-3451972-1307113567 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3451972-1307113567.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.03 2.00 2/483 13458
/proc/meminfo: memFree=24653820/32950928 swapFree=61542356/67111528
[pid=13458] ppid=13456 vsize=10448 CPUtime=0 cores=1,3,5,7
/proc/13458/stat : 13458 (scip-2.0.1.4.li) R 13456 13458 12040 0 -1 4202496 1626 0 0 0 0 0 0 0 25 0 1 0 901587345 10698752 1580 33554432000 4194304 9128323 140735783273344 18446744073709551615 8057568 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/13458/statm: 2612 1580 398 1205 0 1403 0

[startup+0.0208289 s]
/proc/loadavg: 2.01 2.03 2.00 2/483 13458
/proc/meminfo: memFree=24653820/32950928 swapFree=61542356/67111528
[pid=13458] ppid=13456 vsize=19000 CPUtime=0.01 cores=1,3,5,7
/proc/13458/stat : 13458 (scip-2.0.1.4.li) R 13456 13458 12040 0 -1 4202496 3503 0 0 0 1 0 0 0 25 0 1 0 901587345 19456000 3456 33554432000 4194304 9128323 140735783273344 18446744073709551615 4338650 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/13458/statm: 4750 3456 473 1205 0 3541 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 19000

[startup+0.100818 s]
/proc/loadavg: 2.01 2.03 2.00 2/483 13458
/proc/meminfo: memFree=24653820/32950928 swapFree=61542356/67111528
[pid=13458] ppid=13456 vsize=30588 CPUtime=0.09 cores=1,3,5,7
/proc/13458/stat : 13458 (scip-2.0.1.4.li) R 13456 13458 12040 0 -1 4202496 6582 0 0 0 9 0 0 0 25 0 1 0 901587345 31322112 6279 33554432000 4194304 9128323 140735783273344 18446744073709551615 6886064 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/13458/statm: 7647 6311 583 1205 0 6438 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 30588

[startup+0.300846 s]
/proc/loadavg: 2.01 2.03 2.00 2/483 13458
/proc/meminfo: memFree=24653820/32950928 swapFree=61542356/67111528
[pid=13458] ppid=13456 vsize=57016 CPUtime=0.29 cores=1,3,5,7
/proc/13458/stat : 13458 (scip-2.0.1.4.li) R 13456 13458 12040 0 -1 4202496 14662 0 0 0 28 1 0 0 25 0 1 0 901587345 58384384 13031 33554432000 4194304 9128323 140735783273344 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/13458/statm: 14254 13031 719 1205 0 13045 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 57016

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

Child status: 0
Real time (s): 0.349847
CPU time (s): 0.349946
CPU user time (s): 0.32695
CPU system time (s): 0.022996
CPU usage (%): 100.028
Max. virtual memory (cumulated for all children) (KiB): 60920

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

runsolver used 0.006998 second user time and 0.013997 second system time

The end

Launcher Data 

Begin job on node116 at 2011-06-03 17:06:07
IDJOB=3451972
IDBENCH=48341
IDSOLVER=1949
FILE ID=node116/3451972-1307113567
RUNJOBID= node116-1307109962-13220
PBS_JOBID= 13498000
Free space on /tmp= 73828 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_2_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-3451972-1307113567/watcher-3451972-1307113567 -o /tmp/evaluation-result-3451972-1307113567/solver-3451972-1307113567 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3451972-1307113567.opb -t 1800 -m 15500

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

MD5SUM BENCH= 6247d91366961bc8ff12c33e03e6ccbd
RANDOM SEED=486161826

node116.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.826
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.65
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.826
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5226.15
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 2
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.826
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 3
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.826
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.826
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.77
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 5
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.826
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.826
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.826
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32950928 kB
MemFree:      24653976 kB
Buffers:        236680 kB
Cached:         446516 kB
SwapCached:      12572 kB
Active:        7681984 kB
Inactive:       346208 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32950928 kB
LowFree:      24653976 kB
SwapTotal:    67111528 kB
SwapFree:     61542356 kB
Dirty:           12068 kB
Writeback:           0 kB
AnonPages:     7343104 kB
Mapped:          25588 kB
Slab:           138720 kB
PageTables:      62548 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83586992 kB
Committed_AS: 139836684 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= 73816 MiB
End job on node116 at 2011-06-03 17:06:07