Trace number 3451287

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 SCIP 2.0.1.4b with SoPlex 1.5.0.4SAT 4.34534 4.34719

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/
namasivayam/tsp/normalized-t3002.11tsp11.1900669299.opb
MD5SUMa725f6ee372d31d579e8cd9c5db864a1
Bench CategoryDEC-SMALLINT-LIN (no optimisation, small integers, linear constraints)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0.029994
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables231
Total number of constraints2707
Number of constraints which are clauses2684
Number of constraints which are cardinality constraints (but not clauses)22
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint110
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 25
Number of bits of the biggest number in a constraint 5
Biggest sum of numbers in a constraint 691
Number of bits of the biggest sum of numbers10
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

0.00/0.01	c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01	c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01	c 
0.00/0.01	c user parameter file <scip.set> not found - using default parameters
0.00/0.01	c reading problem <HOME/instance-3451287-1307069362.opb>
0.01/0.02	c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.01/0.02	c problem read
0.01/0.02	c No objective function, only one solution is needed.
0.01/0.02	c presolving settings loaded
0.01/0.03	c presolving:
0.01/0.04	c (round 1) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.01/0.05	c (round 2) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.01/0.05	c (round 3) 0 del vars, 264 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.01/0.06	c presolving (4 rounds):
0.01/0.06	c  0 deleted vars, 264 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.06	c  242 implications, 22 cliques
0.01/0.06	c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.01/0.06	c       1 constraints of type <knapsack>
0.01/0.06	c      22 constraints of type <setppc>
0.01/0.06	c    2420 constraints of type <logicor>
0.01/0.06	c transformed objective value is always integral (scale: 1)
0.01/0.06	c Presolving Time: 0.03
0.01/0.06	c - non default parameters ----------------------------------------------------------------------
0.01/0.06	c # SCIP version 2.0.1.5
0.01/0.06	c 
0.01/0.06	c # frequency for displaying node information lines
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.06	c display/freq = 10000
0.01/0.06	c 
0.01/0.06	c # maximal time in seconds to run
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06	c limits/time = 1800
0.01/0.06	c 
0.01/0.06	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06	c limits/memory = 13950
0.01/0.06	c 
0.01/0.06	c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06	c limits/solutions = 1
0.01/0.06	c 
0.01/0.06	c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.06	c separating/maxrounds = 1
0.01/0.06	c 
0.01/0.06	c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06	c separating/maxroundsroot = 5
0.01/0.06	c 
0.01/0.06	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.06	c # [type: int, range: [1,2], default: 1]
0.01/0.06	c timing/clocktype = 2
0.01/0.06	c 
0.01/0.06	c # belongs reading time to solving time?
0.01/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06	c timing/reading = TRUE
0.01/0.06	c 
0.01/0.06	c # should presolving try to simplify inequalities
0.01/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06	c constraints/linear/simplifyinequalities = TRUE
0.01/0.06	c 
0.01/0.06	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06	c constraints/indicator/addCouplingCons = TRUE
0.01/0.06	c 
0.01/0.06	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.06	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.06	c constraints/knapsack/disaggregation = FALSE
0.01/0.06	c 
0.01/0.06	c # should presolving try to simplify knapsacks
0.01/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06	c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.06	c 
0.01/0.06	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06	c presolving/probing/maxrounds = 0
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/coefdiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.06	c heuristics/crossover/freq = -1
0.01/0.06	c 
0.01/0.06	c # number of nodes added to the contingent of the total nodes
0.01/0.06	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06	c heuristics/crossover/nodesofs = 750
0.01/0.06	c 
0.01/0.06	c # number of nodes without incumbent change that heuristic should wait
0.01/0.06	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.06	c heuristics/crossover/nwaitingnodes = 100
0.01/0.06	c 
0.01/0.06	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.06	c # [type: real, range: [0,1], default: 0.1]
0.01/0.06	c heuristics/crossover/nodesquot = 0.15
0.01/0.06	c 
0.01/0.06	c # minimum percentage of integer variables that have to be fixed 
0.01/0.06	c # [type: real, range: [0,1], default: 0.666]
0.01/0.06	c heuristics/crossover/minfixingrate = 0.5
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06	c heuristics/feaspump/freq = -1
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/fracdiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/guideddiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/intshifting/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/linesearchdiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06	c heuristics/objpscostdiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.06	c # [type: real, range: [0,1], default: 0.01]
0.01/0.06	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/oneopt/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/pscostdiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06	c heuristics/rens/freq = -1
0.01/0.06	c 
0.01/0.06	c # minimum percentage of integer variables that have to be fixable 
0.01/0.06	c # [type: real, range: [0,1], default: 0.5]
0.01/0.06	c heuristics/rens/minfixingrate = 0.3
0.01/0.06	c 
0.01/0.06	c # number of nodes added to the contingent of the total nodes
0.01/0.06	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06	c heuristics/rens/nodesofs = 2000
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06	c heuristics/rootsoldiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.06	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/rounding/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06	c heuristics/shiftandpropagate/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/shifting/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/simplerounding/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/subnlp/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06	c heuristics/trivial/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/trysol/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06	c heuristics/undercover/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06	c heuristics/veclendiving/freq = -1
0.01/0.06	c 
0.01/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06	c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.06	c 
0.01/0.06	c # additional number of allowed LP iterations
0.01/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06	c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.06	c 
0.01/0.06	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06	c heuristics/zirounding/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06	c separating/cmir/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06	c separating/flowcover/freq = -1
0.01/0.06	c 
0.01/0.06	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06	c separating/rapidlearning/freq = 0
0.01/0.06	c 
0.01/0.06	c -----------------------------------------------------------------------------------------------
0.01/0.06	c start solving
0.01/0.06	c 
0.01/0.07	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.07	c   0.1s|     1 |     0 |    76 |     - |3825k|   0 |  36 | 231 |2443 | 231 |2443 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.17	c   0.2s|     1 |     0 |    94 |     - |4131k|   0 |  44 | 231 |2491 | 231 |2454 |  11 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.27	c   0.3s|     1 |     0 |   115 |     - |4486k|   0 |  51 | 231 |2491 | 231 |2457 |  14 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.39	c   0.4s|     1 |     0 |   135 |     - |4848k|   0 |  53 | 231 |2491 | 231 |2458 |  15 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.49/0.55	c   0.5s|     1 |     0 |   148 |     - |5224k|   0 |  57 | 231 |2491 | 231 |2459 |  16 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.69/0.73	c   0.7s|     1 |     0 |   187 |     - |5589k|   0 |  53 | 231 |2491 | 231 |2463 |  20 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.88/1.01	c   1.0s|     1 |     2 |   187 |     - |5589k|   0 |  53 | 231 |2491 | 231 |2463 |  20 |   0 |  12 | 0.000000e+00 |      --      |    Inf 
4.30/4.33	c * 4.3s|    26 |     0 |  1979 |  71.7 |5735k|   9 |   - | 231 |2506 | 231 |2451 |  20 |  15 | 512 | 0.000000e+00 | 0.000000e+00 |   0.00%
4.30/4.33	c 
4.30/4.33	c SCIP Status        : problem is solved [optimal solution found]
4.30/4.33	c Solving Time (sec) : 4.33
4.30/4.33	c Solving Nodes      : 26
4.30/4.33	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
4.30/4.33	c Dual Bound         : +0.00000000000000e+00
4.30/4.33	c Gap                : 0.00 %
4.30/4.33	s SATISFIABLE
4.30/4.33	v -x221 -x211 -x201 x191 -x181 -x171 -x161 -x151 -x141 -x131 -x231 -x210 -x200 -x190 -x180 -x170 -x160 -x150 x140 -x130 -x230 -x220 
4.30/4.33	v -x199 -x189 x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 -x168 -x158 -x148 -x138 x128 -x228 x218 -x208 
4.30/4.33	v -x198 -x177 -x167 -x157 -x147 -x137 -x127 x227 -x217 -x207 -x197 -x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 x196 
4.30/4.33	v -x186 -x176 -x155 -x145 -x135 -x125 -x225 -x215 -x205 -x195 -x185 -x175 -x165 x144 -x134 -x124 -x224 -x214 -x204 -x194 -x184 
4.30/4.33	v -x174 x164 -x154 -x133 -x123 -x223 -x213 -x203 -x193 -x183 -x173 -x163 x153 -x143 -x122 -x222 -x212 x202 -x192 -x182 -x172 -x162 
4.30/4.33	v -x152 -x142 -x132 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 x105 -x104 
4.30/4.33	v -x103 -x102 -x101 -x100 x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 x84 -x83 -x82 -x81 -x80 
4.30/4.33	v -x79 -x78 -x77 x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 x57 -x56 -x55 -x54 
4.30/4.33	v -x53 -x52 -x51 -x50 -x49 x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 
4.30/4.33	v -x28 x27 -x26 -x25 -x24 -x23 -x22 -x11 -x21 -x10 -x20 -x9 x19 -x8 -x18 -x7 -x17 -x6 -x16 -x5 -x15 -x4 -x14 -x3 -x13 -x2 -x12 
4.30/4.33	v x1 
4.30/4.33	c SCIP Status        : problem is solved [optimal solution found]
4.30/4.33	c Total Time         :       4.33
4.30/4.33	c   solving          :       4.33
4.30/4.33	c   presolving       :       0.03 (included in solving)
4.30/4.33	c   reading          :       0.02 (included in solving)
4.30/4.33	c Original Problem   :
4.30/4.33	c   Problem name     : HOME/instance-3451287-1307069362.opb
4.30/4.33	c   Variables        : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
4.30/4.33	c   Constraints      : 2707 initial, 2707 maximal
4.30/4.33	c Presolved Problem  :
4.30/4.33	c   Problem name     : t_HOME/instance-3451287-1307069362.opb
4.30/4.33	c   Variables        : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
4.30/4.33	c   Constraints      : 2443 initial, 2506 maximal
4.30/4.33	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
4.30/4.33	c   trivial          :       0.00          0          0          0          0          0          0          0          0          0
4.30/4.33	c   dualfix          :       0.00          0          0          0          0          0          0          0          0          0
4.30/4.33	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
4.30/4.33	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
4.30/4.33	c   pseudoobj        :       0.00          0          0          0          0          0          0          0          0          0
4.30/4.33	c   implics          :       0.00          0          0          0          0          0          0          0          0          0
4.30/4.33	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
4.30/4.33	c   knapsack         :       0.00          0          0          0          0          0          0          0          0          0
4.30/4.33	c   setppc           :       0.00          0          0          0          0          0        121          0          0          0
4.30/4.33	c   linear           :       0.01          0          0          0          0          0        143          0          0          0
4.30/4.33	c   logicor          :       0.02          0          0          0          0          0          0          0          0          0
4.30/4.33	c   root node        :          -          0          -          -          0          -          -          -          -          -
4.30/4.33	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
4.30/4.33	c   integral         :          0          0          0         71          0          3          0          5        167          0          0         32
4.30/4.33	c   knapsack         :          1          5        154          1          0          0          3          0         44          0          0          0
4.30/4.33	c   setppc           :         22          5        154          1          0          0         79          3        221          0          0          0
4.30/4.33	c   linear           :          0+         5         67          0          0          0          0          0          1          0          0          0
4.30/4.33	c   logicor          :       2420+         5        135          1          0          0         34          0        345          0          0          0
4.30/4.33	c   countsols        :          0          0          0          1          0          2          0          0          0          0          0          0
4.30/4.33	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
4.30/4.33	c   integral         :       3.36       0.00       0.00       3.36       0.00       0.00       0.00
4.30/4.33	c   knapsack         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
4.30/4.33	c   setppc           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
4.30/4.33	c   linear           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
4.30/4.33	c   logicor          :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
4.30/4.33	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
4.30/4.33	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
4.30/4.33	c   vbounds          :          0          0          0          0
4.30/4.33	c   rootredcost      :          0          0          0          0
4.30/4.33	c   pseudoobj        :          0          0          0          0
4.30/4.33	c Propagator Timings :  TotalTime  Propagate    Resprop
4.30/4.33	c   vbounds          :       0.00       0.00       0.00
4.30/4.33	c   rootredcost      :       0.00       0.00       0.00
4.30/4.33	c   pseudoobj        :       0.00       0.00       0.00
4.30/4.33	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
4.30/4.33	c   propagation      :       0.00          3          3         14       19.5          0        0.0          -
4.30/4.33	c   infeasible LP    :       0.00          1          1          5       32.4          0        0.0          0
4.30/4.33	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
4.30/4.33	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
4.30/4.33	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
4.30/4.33	c   applied globally :          -          -          -         15       18.5          -          -          -
4.30/4.33	c   applied locally  :          -          -          -          0        0.0          -          -          -
4.30/4.33	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
4.30/4.33	c   cut pool         :       0.00          4          -          -         41          -    (maximal pool size: 504)
4.30/4.33	c   redcost          :       0.00         28          0          0          0          0
4.30/4.33	c   impliedbounds    :       0.00          5          0          0          0          0
4.30/4.33	c   intobj           :       0.00          0          0          0          0          0
4.30/4.33	c   gomory           :       0.35          5          0          0       1008          0
4.30/4.33	c   cgmip            :       0.00          0          0          0          0          0
4.30/4.33	c   closecuts        :       0.00          0          0          0          0          0
4.30/4.33	c   strongcg         :       0.25          5          0          0       2405          0
4.30/4.33	c   cmir             :       0.00          0          0          0          0          0
4.30/4.33	c   flowcover        :       0.00          0          0          0          0          0
4.30/4.33	c   clique           :       0.00          5          0          0          0          0
4.30/4.33	c   zerohalf         :       0.00          0          0          0          0          0
4.30/4.33	c   mcf              :       0.00          1          0          0          0          0
4.30/4.33	c   oddcycle         :       0.00          0          0          0          0          0
4.30/4.33	c   rapidlearning    :       0.04          1          0          0          0         48
4.30/4.33	c Pricers            :       Time      Calls       Vars
4.30/4.33	c   problem variables:       0.00          0          0
4.30/4.33	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
4.30/4.33	c   relpscost        :       3.36         70          5        167          0          0         32
4.30/4.33	c   pscost           :       0.00          0          0          0          0          0          0
4.30/4.33	c   inference        :       0.00          0          0          0          0          0          0
4.30/4.33	c   mostinf          :       0.00          0          0          0          0          0          0
4.30/4.33	c   leastinf         :       0.00          0          0          0          0          0          0
4.30/4.33	c   fullstrong       :       0.00          0          0          0          0          0          0
4.30/4.33	c   allfullstrong    :       0.00          0          0          0          0          0          0
4.30/4.33	c   random           :       0.00          0          0          0          0          0          0
4.30/4.33	c Primal Heuristics  :       Time      Calls      Found
4.30/4.33	c   LP solutions     :       0.00          -          1
4.30/4.33	c   pseudo solutions :       0.00          -          0
4.30/4.33	c   trivial          :       0.00          1          0
4.30/4.33	c   shiftandpropagate:       0.00          0          0
4.30/4.33	c   simplerounding   :       0.00          0          0
4.30/4.33	c   zirounding       :       0.00          0          0
4.30/4.33	c   rounding         :       0.00          0          0
4.30/4.33	c   shifting         :       0.00          0          0
4.30/4.33	c   intshifting      :       0.00          0          0
4.30/4.33	c   oneopt           :       0.00          0          0
4.30/4.33	c   twoopt           :       0.00          0          0
4.30/4.33	c   fixandinfer      :       0.00          0          0
4.30/4.33	c   feaspump         :       0.00          0          0
4.30/4.33	c   clique           :       0.00          0          0
4.30/4.33	c   coefdiving       :       0.00          0          0
4.30/4.33	c   pscostdiving     :       0.00          0          0
4.30/4.33	c   fracdiving       :       0.00          0          0
4.30/4.33	c   veclendiving     :       0.00          0          0
4.30/4.33	c   intdiving        :       0.00          0          0
4.30/4.33	c   actconsdiving    :       0.00          0          0
4.30/4.33	c   objpscostdiving  :       0.00          0          0
4.30/4.33	c   rootsoldiving    :       0.00          0          0
4.30/4.33	c   linesearchdiving :       0.00          0          0
4.30/4.33	c   guideddiving     :       0.00          0          0
4.30/4.33	c   octane           :       0.00          0          0
4.30/4.33	c   rens             :       0.00          0          0
4.30/4.33	c   rins             :       0.00          0          0
4.30/4.33	c   localbranching   :       0.00          0          0
4.30/4.33	c   mutation         :       0.00          0          0
4.30/4.33	c   crossover        :       0.00          0          0
4.30/4.33	c   dins             :       0.00          0          0
4.30/4.33	c   vbounds          :       0.00          0          0
4.30/4.33	c   undercover       :       0.00          0          0
4.30/4.33	c   subnlp           :       0.00          0          0
4.30/4.33	c   trysol           :       0.00          0          0
4.30/4.33	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
4.30/4.33	c   primal LP        :       0.00          0          0       0.00          -
4.30/4.33	c   dual LP          :       0.25         77       1979      25.70    8059.00
4.30/4.33	c   lex dual LP      :       0.00          0          0       0.00          -
4.30/4.33	c   barrier LP       :       0.00          0          0       0.00          -
4.30/4.33	c   diving/probing LP:       0.00          0          0       0.00          -
4.30/4.33	c   strong branching :       3.35        512      26544      51.84    7921.61
4.30/4.33	c     (at root node) :          -         12       2326     193.83          -
4.30/4.33	c   conflict analysis:       0.00          0          0       0.00          -
4.30/4.33	c B&B Tree           :
4.30/4.33	c   number of runs   :          1
4.30/4.33	c   nodes            :         26
4.30/4.33	c   nodes (total)    :         26
4.30/4.33	c   nodes left       :          0
4.30/4.33	c   max depth        :          9
4.30/4.33	c   max depth (total):          9
4.30/4.33	c   backtracks       :          1 (3.8%)
4.30/4.33	c   delayed cutoffs  :          0
4.30/4.33	c   repropagations   :          2 (3 domain reductions, 0 cutoffs)
4.30/4.33	c   avg switch length:       2.00
4.30/4.33	c   switching time   :       0.00
4.30/4.33	c Solution           :
4.30/4.33	c   Solutions found  :          1 (1 improvements)
4.30/4.33	c   First Solution   : +0.00000000000000e+00   (in run 1, after 26 nodes, 4.33 seconds, depth 8, found by <relaxation>)
4.30/4.33	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 26 nodes, 4.33 seconds, depth 8, found by <relaxation>)
4.30/4.33	c   Dual Bound       : +0.00000000000000e+00
4.30/4.33	c   Gap              :       0.00 %
4.30/4.33	c   Root Dual Bound  : +0.00000000000000e+00
4.30/4.33	c   Root Iterations  :        187
4.30/4.34	c Time complete: 4.34.

Verifier Data 

OK	0

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.0 (svn: 977)

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3451287-1307069362/watcher-3451287-1307069362 -o /tmp/evaluation-result-3451287-1307069362/solver-3451287-1307069362 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f HOME/instance-3451287-1307069362.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.01 1.99 1.68 3/521 19824
/proc/meminfo: memFree=21666012/32951124 swapFree=58800704/67111528
[pid=19824] ppid=19821 vsize=13484 CPUtime=0 cores=0,2,4,6
/proc/19824/stat : 19824 (scip-2.0.1.4b.l) R 19821 19824 18505 0 -1 4202496 2350 0 0 0 0 0 0 0 25 0 1 0 799351707 13807616 2303 33554432000 4194304 9163163 140734350059280 18446744073709551615 8090512 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/19824/statm: 3371 2303 392 1214 0 2153 0

[startup+0.0214169 s]
/proc/loadavg: 2.01 1.99 1.68 3/521 19824
/proc/meminfo: memFree=21666012/32951124 swapFree=58800704/67111528
[pid=19824] ppid=19821 vsize=14036 CPUtime=0.01 cores=0,2,4,6
/proc/19824/stat : 19824 (scip-2.0.1.4b.l) R 19821 19824 18505 0 -1 4202496 2481 0 0 0 1 0 0 0 25 0 1 0 799351707 14372864 2434 33554432000 4194304 9163163 140734350059280 18446744073709551615 6165471 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/19824/statm: 3509 2434 392 1214 0 2291 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 14036

[startup+0.100445 s]
/proc/loadavg: 2.01 1.99 1.68 3/521 19824
/proc/meminfo: memFree=21666012/32951124 swapFree=58800704/67111528
[pid=19824] ppid=19821 vsize=26796 CPUtime=0.09 cores=0,2,4,6
/proc/19824/stat : 19824 (scip-2.0.1.4b.l) R 19821 19824 18505 0 -1 4202496 5985 0 0 0 9 0 0 0 18 0 1 0 799351707 27439104 5640 33554432000 4194304 9163163 140734350059280 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/19824/statm: 6699 5640 650 1214 0 5481 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 26796

[startup+0.300404 s]
/proc/loadavg: 2.01 1.99 1.68 3/521 19824
/proc/meminfo: memFree=21666012/32951124 swapFree=58800704/67111528
[pid=19824] ppid=19821 vsize=41764 CPUtime=0.29 cores=0,2,4,6
/proc/19824/stat : 19824 (scip-2.0.1.4b.l) R 19821 19824 18505 0 -1 4202496 10177 0 0 0 28 1 0 0 18 0 1 0 799351707 42766336 9123 33554432000 4194304 9163163 140734350059280 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/19824/statm: 10441 9123 702 1214 0 9223 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 41764

[startup+0.700329 s]
/proc/loadavg: 2.01 1.99 1.68 3/521 19824
/proc/meminfo: memFree=21666012/32951124 swapFree=58800704/67111528
[pid=19824] ppid=19821 vsize=41904 CPUtime=0.69 cores=0,2,4,6
/proc/19824/stat : 19824 (scip-2.0.1.4b.l) R 19821 19824 18505 0 -1 4202496 10216 0 0 0 68 1 0 0 18 0 1 0 799351707 42909696 9162 33554432000 4194304 9163163 140734350059280 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/19824/statm: 10476 9162 702 1214 0 9258 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 41904

[startup+1.50021 s]
/proc/loadavg: 2.01 1.99 1.68 3/522 19825
/proc/meminfo: memFree=21630540/32951124 swapFree=58800704/67111528
[pid=19824] ppid=19821 vsize=41996 CPUtime=1.49 cores=0,2,4,6
/proc/19824/stat : 19824 (scip-2.0.1.4b.l) R 19821 19824 18505 0 -1 4202496 10321 0 0 0 147 2 0 0 19 0 1 0 799351707 43003904 9267 33554432000 4194304 9163163 140734350059280 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/19824/statm: 10499 9267 706 1214 0 9281 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 41996

[startup+3.10091 s]
/proc/loadavg: 2.01 1.99 1.68 3/522 19825
/proc/meminfo: memFree=21629336/32951124 swapFree=58800704/67111528
[pid=19824] ppid=19821 vsize=41996 CPUtime=3.09 cores=0,2,4,6
/proc/19824/stat : 19824 (scip-2.0.1.4b.l) R 19821 19824 18505 0 -1 4202496 10327 0 0 0 305 4 0 0 25 0 1 0 799351707 43003904 9273 33554432000 4194304 9163163 140734350059280 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/19824/statm: 10499 9273 707 1214 0 9281 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 41996

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

[startup+3.90076 s]
/proc/loadavg: 2.01 1.99 1.68 3/522 19825
/proc/meminfo: memFree=21629212/32951124 swapFree=58800704/67111528
[pid=19824] ppid=19821 vsize=41996 CPUtime=3.89 cores=0,2,4,6
/proc/19824/stat : 19824 (scip-2.0.1.4b.l) R 19821 19824 18505 0 -1 4202496 10327 0 0 0 384 5 0 0 25 0 1 0 799351707 43003904 9273 33554432000 4194304 9163163 140734350059280 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/19824/statm: 10499 9273 707 1214 0 9281 0
Current children cumulated CPU time (s) 3.89
Current children cumulated vsize (KiB) 41996

[startup+4.30069 s]
/proc/loadavg: 2.01 1.99 1.68 3/522 19825
/proc/meminfo: memFree=21629716/32951124 swapFree=58800704/67111528
[pid=19824] ppid=19821 vsize=41996 CPUtime=4.3 cores=0,2,4,6
/proc/19824/stat : 19824 (scip-2.0.1.4b.l) R 19821 19824 18505 0 -1 4202496 10327 0 0 0 425 5 0 0 25 0 1 0 799351707 43003904 9273 33554432000 4194304 9163163 140734350059280 18446744073709551615 7085129 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/19824/statm: 10499 9273 707 1214 0 9281 0
Current children cumulated CPU time (s) 4.3
Current children cumulated vsize (KiB) 41996

Child status: 0
Real time (s): 4.34719
CPU time (s): 4.34534
CPU user time (s): 4.29035
CPU system time (s): 0.054991
CPU usage (%): 99.9573
Max. virtual memory (cumulated for all children) (KiB): 41996

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 4.29035
system time used= 0.054991
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10334
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 5
involuntary context switches= 12

runsolver used 0.029995 second user time and 0.067989 second system time

The end

Launcher Data 

Begin job on node142 at 2011-06-03 04:49:22
IDJOB=3451287
IDBENCH=1341
IDSOLVER=1948
FILE ID=node142/3451287-1307069362
RUNJOBID= node142-1307068304-19569
PBS_JOBID= 13497844
Free space on /tmp= 73912 MiB

SOLVER NAME= SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/tsp/normalized-t3002.11tsp11.1900669299.opb
COMMAND LINE= HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3451287-1307069362/watcher-3451287-1307069362 -o /tmp/evaluation-result-3451287-1307069362/solver-3451287-1307069362 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f HOME/instance-3451287-1307069362.opb -t 1800 -m 15500

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

MD5SUM BENCH= a725f6ee372d31d579e8cd9c5db864a1
RANDOM SEED=846393600

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

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


/proc/meminfo:
MemTotal:     32951124 kB
MemFree:      21666416 kB
Buffers:        209096 kB
Cached:         359416 kB
SwapCached:      11452 kB
Active:        9299960 kB
Inactive:      1724312 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32951124 kB
LowFree:      21666416 kB
SwapTotal:    67111528 kB
SwapFree:     58800704 kB
Dirty:           12480 kB
Writeback:           0 kB
AnonPages:    10453388 kB
Mapped:          34664 kB
Slab:           115316 kB
PageTables:      74868 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83587088 kB
Committed_AS: 145443824 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= 73900 MiB
End job on node142 at 2011-06-03 04:49:27