Trace number 3488181

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 E_2 2011-06-10 (fixed)SAT 0.102983 0.10337

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_100_10_3_15.opb
MD5SUMa83a124b727fa475751dec9ebe86c153
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.015996
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables200
Total number of constraints302
Number of constraints which are clauses100
Number of constraints which are cardinality constraints (but not clauses)1
Number of constraints which are nor clauses,nor cardinality constraints201
Minimum length of a constraint2
Maximum length of a constraint200
Number of terms in the objective function 0
Biggest coefficient in the objective function 0
Number of bits for the biggest coefficient in the objective function 0
Sum of the numbers in the objective function 0
Number of bits of the sum of numbers in the objective function 0
Biggest number in a constraint 15
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 200
Number of bits of the biggest sum of numbers8
Number of products (including duplicates)2488
Sum of products size (including duplicates)4976
Number of different products1244
Sum of products size2488

Solver Data 

0.00/0.00	c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
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-3488181-1307787553.opb>
0.00/0.01	c original problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1746 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.01	c presolving:
0.01/0.04	c (round 1) 0 del vars, 1644 del conss, 200 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 101 upgd conss, 10152 impls, 199 clqs
0.01/0.05	c (round 2) 1244 del vars, 1644 del conss, 200 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10152 impls, 0 clqs
0.01/0.05	c presolving (3 rounds):
0.01/0.05	c  1244 deleted vars, 1644 deleted constraints, 200 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.05	c  10152 implications, 0 cliques
0.01/0.05	c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 302 constraints
0.01/0.05	c     201 constraints of type <knapsack>
0.01/0.05	c     100 constraints of type <setppc>
0.01/0.05	c       1 constraints of type <linear>
0.01/0.05	c transformed objective value is always integral (scale: 1)
0.01/0.05	c Presolving Time: 0.04
0.01/0.05	c - non default parameters ----------------------------------------------------------------------
0.01/0.05	c # SCIP version 2.0.1.5
0.01/0.05	c 
0.01/0.05	c # frequency for displaying node information lines
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.05	c display/freq = 10000
0.01/0.05	c 
0.01/0.05	c # maximal time in seconds to run
0.01/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.05	c limits/time = 1797
0.01/0.05	c 
0.01/0.05	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.05	c limits/memory = 13950
0.01/0.05	c 
0.01/0.05	c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.05	c limits/solutions = 1
0.01/0.05	c 
0.01/0.05	c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.05	c separating/maxrounds = 1
0.01/0.05	c 
0.01/0.05	c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.05	c separating/maxroundsroot = 5
0.01/0.05	c 
0.01/0.05	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.05	c # [type: int, range: [1,2], default: 1]
0.01/0.05	c timing/clocktype = 2
0.01/0.05	c 
0.01/0.05	c # belongs reading time to solving time?
0.01/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.05	c timing/reading = TRUE
0.01/0.05	c 
0.01/0.05	c # should presolving try to simplify inequalities
0.01/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.05	c constraints/linear/simplifyinequalities = TRUE
0.01/0.05	c 
0.01/0.05	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.05	c constraints/indicator/addCouplingCons = TRUE
0.01/0.05	c 
0.01/0.05	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.05	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.05	c constraints/knapsack/disaggregation = FALSE
0.01/0.05	c 
0.01/0.05	c # should presolving try to simplify knapsacks
0.01/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.05	c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.05	c 
0.01/0.05	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.05	c presolving/probing/maxrounds = 0
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05	c heuristics/coefdiving/freq = -1
0.01/0.05	c 
0.01/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.05	c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.05	c 
0.01/0.05	c # additional number of allowed LP iterations
0.01/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05	c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.05	c heuristics/crossover/freq = -1
0.01/0.05	c 
0.01/0.05	c # number of nodes added to the contingent of the total nodes
0.01/0.05	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.05	c heuristics/crossover/nodesofs = 750
0.01/0.05	c 
0.01/0.05	c # number of nodes without incumbent change that heuristic should wait
0.01/0.05	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.05	c heuristics/crossover/nwaitingnodes = 100
0.01/0.05	c 
0.01/0.05	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.05	c # [type: real, range: [0,1], default: 0.1]
0.01/0.05	c heuristics/crossover/nodesquot = 0.15
0.01/0.05	c 
0.01/0.05	c # minimum percentage of integer variables that have to be fixed 
0.01/0.05	c # [type: real, range: [0,1], default: 0.666]
0.01/0.05	c heuristics/crossover/minfixingrate = 0.5
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.05	c heuristics/feaspump/freq = -1
0.01/0.05	c 
0.01/0.05	c # additional number of allowed LP iterations
0.01/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05	c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05	c heuristics/fracdiving/freq = -1
0.01/0.05	c 
0.01/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.05	c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.05	c 
0.01/0.05	c # additional number of allowed LP iterations
0.01/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05	c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05	c heuristics/guideddiving/freq = -1
0.01/0.05	c 
0.01/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.05	c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.05	c 
0.01/0.05	c # additional number of allowed LP iterations
0.01/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05	c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.05	c 
0.01/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.05	c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05	c heuristics/intshifting/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05	c heuristics/linesearchdiving/freq = -1
0.01/0.05	c 
0.01/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.05	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.05	c 
0.01/0.05	c # additional number of allowed LP iterations
0.01/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.05	c heuristics/objpscostdiving/freq = -1
0.01/0.05	c 
0.01/0.05	c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.05	c # [type: real, range: [0,1], default: 0.01]
0.01/0.05	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.05	c 
0.01/0.05	c # additional number of allowed LP iterations
0.01/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05	c heuristics/oneopt/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05	c heuristics/pscostdiving/freq = -1
0.01/0.05	c 
0.01/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.05	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.05	c 
0.01/0.05	c # additional number of allowed LP iterations
0.01/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05	c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05	c heuristics/rens/freq = -1
0.01/0.05	c 
0.01/0.05	c # minimum percentage of integer variables that have to be fixable 
0.01/0.05	c # [type: real, range: [0,1], default: 0.5]
0.01/0.05	c heuristics/rens/minfixingrate = 0.3
0.01/0.05	c 
0.01/0.05	c # number of nodes added to the contingent of the total nodes
0.01/0.05	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.05	c heuristics/rens/nodesofs = 2000
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.05	c heuristics/rootsoldiving/freq = -1
0.01/0.05	c 
0.01/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.05	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.05	c 
0.01/0.05	c # additional number of allowed LP iterations
0.01/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05	c heuristics/rounding/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05	c heuristics/shiftandpropagate/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05	c heuristics/shifting/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05	c heuristics/simplerounding/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05	c heuristics/subnlp/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05	c heuristics/trivial/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05	c heuristics/trysol/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05	c heuristics/undercover/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.05	c heuristics/veclendiving/freq = -1
0.01/0.05	c 
0.01/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.05	c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.05	c 
0.01/0.05	c # additional number of allowed LP iterations
0.01/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.05	c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.05	c 
0.01/0.05	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.05	c heuristics/zirounding/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05	c separating/cmir/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.05	c separating/flowcover/freq = -1
0.01/0.05	c 
0.01/0.05	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.05	c separating/rapidlearning/freq = 0
0.01/0.05	c 
0.01/0.05	c -----------------------------------------------------------------------------------------------
0.01/0.05	c start solving
0.01/0.05	c 
0.01/0.05	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.01/0.05	c   0.1s|     1 |     0 |    61 |     - |4100k|   0 |  28 | 200 | 302 | 200 | 302 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.01/0.09	c y 0.1s|     1 |     0 |    61 |     - |4514k|   0 |   - | 200 | 302 | 200 | 302 |   0 |   0 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.01/0.09	c   0.1s|     1 |     0 |    61 |     - |4403k|   0 |   - | 200 | 302 | 200 | 302 |   0 |   0 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.01/0.09	c 
0.01/0.09	c SCIP Status        : problem is solved [optimal solution found]
0.01/0.09	c Solving Time (sec) : 0.09
0.01/0.09	c Solving Nodes      : 1
0.01/0.09	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
0.01/0.09	c Dual Bound         : +0.00000000000000e+00
0.01/0.09	c Gap                : 0.00 %
0.01/0.09	s SATISFIABLE
0.01/0.09	v -x166 -x164 -x158 -x163 -x121 -x171 x113 -x156 x144 -x135 -x152 -x161 -x122 -x130 -x157 -x146 -x181 -x129 -x111 -x192 x167 x154 
0.01/0.09	v -x185 x127 -x117 x184 -x120 -x124 x134 -x178 -x168 -x136 -x172 -x110 x187 -x190 -x200 -x105 -x151 -x131 -x109 x106 -x183 -x153 
0.01/0.09	v x182 -x189 -x149 -x195 -x104 -x198 -x193 -x188 -x128 x119 -x112 -x191 -x179 -x162 -x107 -x137 -x115 -x175 x145 -x132 x108 
0.01/0.09	v -x199 -x138 x148 -x174 -x139 -x143 -x197 x180 -x160 -x155 x150 x118 -x114 -x116 -x196 -x176 x142 -x103 -x140 -x194 -x125 -x101 
0.01/0.09	v -x170 x133 -x123 -x159 -x165 -x102 -x177 -x173 -x126 -x141 -x169 -x186 -x147 -x100 x99 -x98 x97 -x96 -x95 -x94 -x93 -x92 -x91 
0.01/0.09	v -x90 -x89 -x88 -x87 -x86 -x85 -x84 x83 -x82 -x81 -x80 x79 -x78 -x77 -x76 x75 -x74 -x73 -x72 -x71 x70 x69 -x68 -x67 -x66 x65 
0.01/0.09	v -x64 -x63 -x62 x61 -x60 -x59 -x58 -x57 x56 -x55 -x54 -x53 x52 -x51 -x50 x49 -x48 x47 -x46 -x45 -x44 x43 -x42 -x41 -x40 -x39 
0.01/0.09	v -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 x21 -x20 -x19 -x18 -x17 -x16 x15 x14 -x13 
0.01/0.09	v -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1 
0.01/0.09	c SCIP Status        : problem is solved [optimal solution found]
0.01/0.09	c Total Time         :       0.09
0.01/0.09	c   solving          :       0.09
0.01/0.09	c   presolving       :       0.04 (included in solving)
0.01/0.09	c   reading          :       0.01 (included in solving)
0.01/0.09	c Original Problem   :
0.01/0.09	c   Problem name     : HOME/instance-3488181-1307787553.opb
0.01/0.09	c   Variables        : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.09	c   Constraints      : 1746 initial, 1746 maximal
0.01/0.09	c Presolved Problem  :
0.01/0.09	c   Problem name     : t_HOME/instance-3488181-1307787553.opb
0.01/0.09	c   Variables        : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.09	c   Constraints      : 302 initial, 302 maximal
0.01/0.09	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
0.01/0.09	c   trivial          :       0.00          0          0          0          0          0          0          0          0          0
0.01/0.09	c   dualfix          :       0.00       1244          0          0          0          0          0          0          0          0
0.01/0.09	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
0.01/0.09	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
0.01/0.09	c   pseudoobj        :       0.00          0          0          0          0          0          0          0          0          0
0.01/0.09	c   implics          :       0.00          0          0          0          0          0          0          0          0          0
0.01/0.09	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
0.01/0.09	c   knapsack         :       0.00          0          0          0          0          0          0          0          0          0
0.01/0.09	c   setppc           :       0.00          0          0          0          0          0          0          0          0          0
0.01/0.09	c   linear           :       0.00          0          0          0          0          0          0          0          0          0
0.01/0.09	c   pseudoboolean    :       0.00          0          0          0          0          0       1644        200          0          0
0.01/0.09	c   root node        :          -          0          -          -          0          -          -          -          -          -
0.01/0.09	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
0.01/0.09	c   integral         :          0          0          0          0          0          4          0          0          0          0          0          0
0.01/0.09	c   knapsack         :        201          1          1          0          0          1          0          0          0         56          0          0
0.01/0.09	c   setppc           :        100          1          1          0          0          1          0          0          0          0          0          0
0.01/0.09	c   linear           :          1          1          1          0          0          1          0          0          0          0          0          0
0.01/0.09	c   countsols        :          0          0          0          0          0          3          0          0          0          0          0          0
0.01/0.09	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
0.01/0.09	c   integral         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.01/0.09	c   knapsack         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.01/0.09	c   setppc           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.01/0.09	c   linear           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.01/0.09	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.01/0.09	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
0.01/0.09	c   vbounds          :          0          0          0          0
0.01/0.09	c   rootredcost      :          0          0          0          0
0.01/0.09	c   pseudoobj        :          0          0          0          0
0.01/0.09	c Propagator Timings :  TotalTime  Propagate    Resprop
0.01/0.09	c   vbounds          :       0.00       0.00       0.00
0.01/0.09	c   rootredcost      :       0.00       0.00       0.00
0.01/0.09	c   pseudoobj        :       0.00       0.00       0.00
0.01/0.09	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.01/0.09	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.01/0.09	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.01/0.09	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.01/0.09	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.01/0.09	c   pseudo solution  :       0.00          1          0          0        0.0          0        0.0          -
0.01/0.09	c   applied globally :          -          -          -          0        0.0          -          -          -
0.01/0.09	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.01/0.09	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.01/0.09	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 70)
0.01/0.09	c   redcost          :       0.00          1          0          0          0          0
0.01/0.09	c   impliedbounds    :       0.00          1          0          0          0          0
0.01/0.09	c   intobj           :       0.00          0          0          0          0          0
0.01/0.09	c   gomory           :       0.01          1          0          0          0          0
0.01/0.09	c   cgmip            :       0.00          0          0          0          0          0
0.01/0.09	c   closecuts        :       0.00          0          0          0          0          0
0.01/0.09	c   strongcg         :       0.01          1          0          0         90          0
0.01/0.09	c   cmir             :       0.00          0          0          0          0          0
0.01/0.09	c   flowcover        :       0.00          0          0          0          0          0
0.01/0.09	c   clique           :       0.00          1          0          0          0          0
0.01/0.09	c   zerohalf         :       0.00          0          0          0          0          0
0.01/0.09	c   mcf              :       0.00          1          0          0          0          0
0.01/0.09	c   oddcycle         :       0.00          0          0          0          0          0
0.01/0.09	c   rapidlearning    :       0.02          1          0          0          0          0
0.01/0.09	c Pricers            :       Time      Calls       Vars
0.01/0.09	c   problem variables:       0.00          0          0
0.01/0.09	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.01/0.09	c   pscost           :       0.00          0          0          0          0          0          0
0.01/0.09	c   inference        :       0.00          0          0          0          0          0          0
0.01/0.09	c   mostinf          :       0.00          0          0          0          0          0          0
0.01/0.09	c   leastinf         :       0.00          0          0          0          0          0          0
0.01/0.09	c   fullstrong       :       0.00          0          0          0          0          0          0
0.01/0.09	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.01/0.09	c   random           :       0.00          0          0          0          0          0          0
0.01/0.09	c   relpscost        :       0.00          0          0          0          0          0          0
0.01/0.09	c Primal Heuristics  :       Time      Calls      Found
0.01/0.09	c   LP solutions     :       0.00          -          0
0.01/0.09	c   pseudo solutions :       0.00          -          0
0.01/0.09	c   trivial          :       0.00          1          0
0.01/0.09	c   shiftandpropagate:       0.00          0          0
0.01/0.09	c   simplerounding   :       0.00          0          0
0.01/0.09	c   zirounding       :       0.00          0          0
0.01/0.09	c   rounding         :       0.00          0          0
0.01/0.09	c   shifting         :       0.00          0          0
0.01/0.09	c   intshifting      :       0.00          0          0
0.01/0.09	c   oneopt           :       0.00          0          0
0.01/0.09	c   twoopt           :       0.00          0          0
0.01/0.09	c   fixandinfer      :       0.00          0          0
0.01/0.09	c   feaspump         :       0.00          0          0
0.01/0.09	c   clique           :       0.00          0          0
0.01/0.09	c   coefdiving       :       0.00          0          0
0.01/0.09	c   pscostdiving     :       0.00          0          0
0.01/0.09	c   fracdiving       :       0.00          0          0
0.01/0.09	c   veclendiving     :       0.00          0          0
0.01/0.09	c   intdiving        :       0.00          0          0
0.01/0.09	c   actconsdiving    :       0.00          0          0
0.01/0.09	c   objpscostdiving  :       0.00          0          0
0.01/0.09	c   rootsoldiving    :       0.00          0          0
0.01/0.09	c   linesearchdiving :       0.00          0          0
0.01/0.09	c   guideddiving     :       0.00          0          0
0.01/0.09	c   octane           :       0.00          0          0
0.01/0.09	c   rens             :       0.00          0          0
0.01/0.09	c   rins             :       0.00          0          0
0.01/0.09	c   localbranching   :       0.00          0          0
0.01/0.09	c   mutation         :       0.00          0          0
0.01/0.09	c   crossover        :       0.00          0          0
0.01/0.09	c   dins             :       0.00          0          0
0.01/0.09	c   vbounds          :       0.00          0          0
0.01/0.09	c   undercover       :       0.00          0          0
0.01/0.09	c   subnlp           :       0.00          0          0
0.01/0.09	c   trysol           :       0.00          0          0
0.01/0.09	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.01/0.09	c   primal LP        :       0.00          0          0       0.00          -
0.01/0.09	c   dual LP          :       0.00          1         61      61.00          -
0.01/0.09	c   lex dual LP      :       0.00          0          0       0.00          -
0.01/0.09	c   barrier LP       :       0.00          0          0       0.00          -
0.01/0.09	c   diving/probing LP:       0.00          0          0       0.00          -
0.01/0.09	c   strong branching :       0.00          0          0       0.00          -
0.01/0.09	c     (at root node) :          -          0          0       0.00          -
0.01/0.09	c   conflict analysis:       0.00          0          0       0.00          -
0.01/0.09	c B&B Tree           :
0.01/0.09	c   number of runs   :          1
0.01/0.09	c   nodes            :          1
0.01/0.09	c   nodes (total)    :          1
0.01/0.09	c   nodes left       :          0
0.01/0.09	c   max depth        :          0
0.01/0.09	c   max depth (total):          0
0.01/0.09	c   backtracks       :          0 (0.0%)
0.01/0.09	c   delayed cutoffs  :          0
0.01/0.09	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.01/0.09	c   avg switch length:       2.00
0.01/0.09	c   switching time   :       0.00
0.01/0.09	c Solution           :
0.01/0.09	c   Solutions found  :          1 (1 improvements)
0.01/0.09	c   First Solution   : +0.00000000000000e+00   (in run 1, after 1 nodes, 0.08 seconds, depth 0, found by <trysol>)
0.01/0.09	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 1 nodes, 0.08 seconds, depth 0, found by <trysol>)
0.01/0.09	c   Dual Bound       : +0.00000000000000e+00
0.01/0.09	c   Gap              :       0.00 %
0.01/0.09	c   Root Dual Bound  : +0.00000000000000e+00
0.01/0.09	c   Root Iterations  :         61
0.09/0.10	c Time complete: 0.09.

Verifier Data 

OK	0

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.1 (svn: 988)

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-3488181-1307787553/watcher-3488181-1307787553 -o /tmp/evaluation-result-3488181-1307787553/solver-3488181-1307787553 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3488181-1307787553.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.00 2.00 1.98 2/177 9400
/proc/meminfo: memFree=31300076/32950928 swapFree=67056212/67111528
[pid=9400] ppid=9398 vsize=12828 CPUtime=0 cores=0,2,4,6
/proc/9400/stat : 9400 (scip-2.0.1.4b_2) R 9398 9400 9093 0 -1 4202496 2219 0 0 0 0 0 0 0 25 0 1 0 968985948 13135872 2174 33554432000 4194304 9016284 140733709717376 18446744073709551615 7824814 0 0 4096 0 0 0 0 17 2 0 0 0
/proc/9400/statm: 3257 2180 375 1178 0 2075 0

[startup+0.01753 s]
/proc/loadavg: 2.00 2.00 1.98 2/177 9400
/proc/meminfo: memFree=31300076/32950928 swapFree=67056212/67111528
[pid=9400] ppid=9398 vsize=19848 CPUtime=0.01 cores=0,2,4,6
/proc/9400/stat : 9400 (scip-2.0.1.4b_2) R 9398 9400 9093 0 -1 4202496 3941 0 0 0 1 0 0 0 25 0 1 0 968985948 20324352 3896 33554432000 4194304 9016284 140733709717376 18446744073709551615 4789612 0 0 4096 16384 0 0 0 17 2 0 0 0
/proc/9400/statm: 4962 3896 445 1178 0 3780 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 19848

[startup+0.100565 s]
/proc/loadavg: 2.00 2.00 1.98 2/177 9400
/proc/meminfo: memFree=31300076/32950928 swapFree=67056212/67111528
[pid=9400] ppid=9398 vsize=20188 CPUtime=0.09 cores=0,2,4,6
/proc/9400/stat : 9400 (scip-2.0.1.4b_2) R 9398 9400 9093 0 -1 4202496 8432 0 0 0 9 0 0 0 18 0 1 0 968985948 20672512 4345 33554432000 4194304 9016284 140733709717376 18446744073709551615 4909035 0 0 4096 0 0 0 0 17 2 0 0 0
/proc/9400/statm: 5047 4345 691 1178 0 3865 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 20188

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

Child status: 0
Real time (s): 0.10337
CPU time (s): 0.102983
CPU user time (s): 0.092985
CPU system time (s): 0.009998
CPU usage (%): 99.6257
Max. virtual memory (cumulated for all children) (KiB): 20188

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

runsolver used 0.002999 second user time and 0.005999 second system time

The end

Launcher Data 

Begin job on node115 at 2011-06-11 12:19:13
IDJOB=3488181
IDBENCH=48290
IDSOLVER=1979
FILE ID=node115/3488181-1307787553
RUNJOBID= node115-1307783957-9111
PBS_JOBID= 13550896
Free space on /tmp= 74112 MiB

SOLVER NAME= SCIP spx E_2 2011-06-10 (fixed)
BENCH NAME= PB07/normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/manquinho/dbsg/normalized-dbsg_100_10_3_15.opb
COMMAND LINE= HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3488181-1307787553/watcher-3488181-1307787553 -o /tmp/evaluation-result-3488181-1307787553/solver-3488181-1307787553 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3488181-1307787553.opb -t 1800 -m 15500

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

MD5SUM BENCH= a83a124b727fa475751dec9ebe86c153
RANDOM SEED=906260417

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

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

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

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

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

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

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

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

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


/proc/meminfo:
MemTotal:     32950928 kB
MemFree:      31300380 kB
Buffers:        277232 kB
Cached:         968540 kB
SwapCached:       9476 kB
Active:         659592 kB
Inactive:       800260 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32950928 kB
LowFree:      31300380 kB
SwapTotal:    67111528 kB
SwapFree:     67056212 kB
Dirty:           16716 kB
Writeback:           0 kB
AnonPages:      211048 kB
Mapped:          16208 kB
Slab:           125648 kB
PageTables:       4852 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83586992 kB
Committed_AS:   406748 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= 74096 MiB
End job on node115 at 2011-06-11 12:19:13