Trace number 3451964

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.616905 0.617096

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_200_10_3_15.opb
MD5SUMbbe3a085a15e9497809c2511fab038f0
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.024995
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)4976
Sum of products size (including duplicates)9952
Number of different products2488
Sum of products size4976

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

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

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

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


[startup+0 s]
/proc/loadavg: 2.53 2.18 2.06 2/530 30590
/proc/meminfo: memFree=15151576/32951132 swapFree=46579808/67111528
[pid=30590] ppid=30588 vsize=14344 CPUtime=0.01 cores=0,2,4,6
/proc/30590/stat : 30590 (scip-2.0.1.4.li) R 30588 30590 28716 0 -1 4202496 2562 0 0 0 1 0 0 0 25 0 1 0 822948056 14688256 2514 33554432000 4194304 9128323 140734772418784 18446744073709551615 7980987 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/30590/statm: 3586 2514 434 1205 0 2377 0

[startup+0.024675 s]
/proc/loadavg: 2.53 2.18 2.06 2/530 30590
/proc/meminfo: memFree=15151576/32951132 swapFree=46579808/67111528
[pid=30590] ppid=30588 vsize=20156 CPUtime=0.01 cores=0,2,4,6
/proc/30590/stat : 30590 (scip-2.0.1.4.li) R 30588 30590 28716 0 -1 4202496 3771 0 0 0 1 0 0 0 25 0 1 0 822948056 20639744 3723 33554432000 4194304 9128323 140734772418784 18446744073709551615 5203019 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/30590/statm: 5039 3723 473 1205 0 3830 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 20156

[startup+0.100673 s]
/proc/loadavg: 2.53 2.18 2.06 2/530 30590
/proc/meminfo: memFree=15151576/32951132 swapFree=46579808/67111528
[pid=30590] ppid=30588 vsize=26416 CPUtime=0.09 cores=0,2,4,6
/proc/30590/stat : 30590 (scip-2.0.1.4.li) R 30588 30590 28716 0 -1 4202496 5652 0 0 0 9 0 0 0 25 0 1 0 822948056 27049984 5347 33554432000 4194304 9128323 140734772418784 18446744073709551615 18446744073699066094 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/30590/statm: 6604 5347 532 1205 0 5395 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 26416

[startup+0.300607 s]
/proc/loadavg: 2.53 2.18 2.06 2/530 30590
/proc/meminfo: memFree=15151576/32951132 swapFree=46579808/67111528
[pid=30590] ppid=30588 vsize=46688 CPUtime=0.29 cores=0,2,4,6
/proc/30590/stat : 30590 (scip-2.0.1.4.li) R 30588 30590 28716 0 -1 4202496 11199 0 0 0 28 1 0 0 25 0 1 0 822948056 47808512 10653 33554432000 4194304 9128323 140734772418784 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/30590/statm: 11672 10653 664 1205 0 10463 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 46688

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

[startup+0.500567 s]
/proc/loadavg: 2.53 2.18 2.06 2/530 30590
/proc/meminfo: memFree=15151576/32951132 swapFree=46579808/67111528
[pid=30590] ppid=30588 vsize=64824 CPUtime=0.49 cores=0,2,4,6
/proc/30590/stat : 30590 (scip-2.0.1.4.li) R 30588 30590 28716 0 -1 4202496 16595 0 0 0 47 2 0 0 25 0 1 0 822948056 66379776 14970 33554432000 4194304 9128323 140734772418784 18446744073709551615 6664542 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/30590/statm: 16206 14970 732 1205 0 14997 0
Current children cumulated CPU time (s) 0.49
Current children cumulated vsize (KiB) 64824

[startup+0.600536 s]
/proc/loadavg: 2.53 2.18 2.06 2/530 30590
/proc/meminfo: memFree=15151576/32951132 swapFree=46579808/67111528
[pid=30590] ppid=30588 vsize=64824 CPUtime=0.59 cores=0,2,4,6
/proc/30590/stat : 30590 (scip-2.0.1.4.li) R 30588 30590 28716 0 -1 4202496 16621 0 0 0 57 2 0 0 25 0 1 0 822948056 66379776 14978 33554432000 4194304 9128323 140734772418784 18446744073709551615 6662890 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/30590/statm: 16206 14978 718 1205 0 14997 0
Current children cumulated CPU time (s) 0.59
Current children cumulated vsize (KiB) 64824

Child status: 0
Real time (s): 0.617096
CPU time (s): 0.616905
CPU user time (s): 0.58691
CPU system time (s): 0.029995
CPU usage (%): 99.9691
Max. virtual memory (cumulated for all children) (KiB): 64824

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

runsolver used 0.009998 second user time and 0.012998 second system time

The end

Launcher Data 

Begin job on node128 at 2011-06-03 17:04:54
IDJOB=3451964
IDBENCH=48333
IDSOLVER=1949
FILE ID=node128/3451964-1307113494
RUNJOBID= node128-1307108023-29939
PBS_JOBID= 13497962
Free space on /tmp= 73904 MiB

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

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

MD5SUM BENCH= bbe3a085a15e9497809c2511fab038f0
RANDOM SEED=619487636

node128.alineos.net Linux 2.6.18-164.el5 #1 SMP Thu Sep 3 03:28:30 EDT 2009

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

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

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

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

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

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

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

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


/proc/meminfo:
MemTotal:     32951132 kB
MemFree:      15151732 kB
Buffers:        322504 kB
Cached:        3474004 kB
SwapCached:      35620 kB
Active:        9108480 kB
Inactive:      8374960 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32951132 kB
LowFree:      15151732 kB
SwapTotal:    67111528 kB
SwapFree:     46579808 kB
Dirty:           24860 kB
Writeback:           0 kB
AnonPages:    13660684 kB
Mapped:          20788 kB
Slab:           133952 kB
PageTables:     112460 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83587092 kB
Committed_AS: 174900552 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    296000 kB
VmallocChunk: 34359440975 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

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