Trace number 2665740

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
SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solverUNSAT 4.09268 2.10365

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1111224255.opb
MD5SUM907b081b964ca265d29825e5079e97bd
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.206968
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables169
Total number of constraints101
Number of constraints which are clauses30
Number of constraints which are cardinality constraints (but not clauses)70
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint169
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 38
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 1217
Number of bits of the biggest sum of numbers11
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.00	c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00	c Copyright (c) 2002-2010 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-2665740-1276274394.opb>
0.00/0.01	c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01	c problem read
0.00/0.01	c No objective function, only one solution is needed.
0.00/0.01	c presolving settings loaded
0.00/0.01	c presolving:
0.00/0.02	c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03	c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.03	c presolving (3 rounds):
0.00/0.03	c  0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03	c  8 implications, 68 cliques
0.00/0.03	c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03	c       1 constraints of type <knapsack>
0.00/0.03	c      68 constraints of type <setppc>
0.00/0.03	c       4 constraints of type <logicor>
0.00/0.03	c transformed objective value is always integral (scale: 1)
0.00/0.03	c Presolving Time: 0.02
0.00/0.03	c - non default parameters ----------------------------------------------------------------------
0.00/0.03	c # SCIP version 1.2.1.2
0.00/0.03	c 
0.00/0.03	c # frequency for displaying node information lines
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03	c display/freq = 10000
0.00/0.03	c 
0.00/0.03	c # maximal time in seconds to run
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/time = 1800
0.00/0.03	c 
0.00/0.03	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/memory = 1620
0.00/0.03	c 
0.00/0.03	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c limits/solutions = 1
0.00/0.03	c 
0.00/0.03	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03	c separating/maxrounds = 1
0.00/0.03	c 
0.00/0.03	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/maxroundsroot = 5
0.00/0.03	c 
0.00/0.03	c # should presolving try to simplify inequalities
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/linear/simplifyinequalities = TRUE
0.00/0.03	c 
0.00/0.03	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03	c constraints/knapsack/disaggregation = FALSE
0.00/0.03	c 
0.00/0.03	c # should presolving try to simplify knapsacks
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03	c 
0.00/0.03	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c presolving/probing/maxrounds = 0
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/coefdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03	c heuristics/crossover/freq = -1
0.00/0.03	c 
0.00/0.03	c # number of nodes added to the contingent of the total nodes
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03	c heuristics/crossover/nodesofs = 750
0.00/0.03	c 
0.00/0.03	c # number of nodes without incumbent change that heuristic should wait
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03	c heuristics/crossover/nwaitingnodes = 100
0.00/0.03	c 
0.00/0.03	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03	c # [type: real, range: [0,1], default: 0.1]
0.00/0.03	c heuristics/crossover/nodesquot = 0.15
0.00/0.03	c 
0.00/0.03	c # minimum percentage of integer variables that have to be fixed 
0.00/0.03	c # [type: real, range: [0,1], default: 0.666]
0.00/0.03	c heuristics/crossover/minfixingrate = 0.5
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/feaspump/freq = -1
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/fracdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/guideddiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/intshifting/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/linesearchdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/nlp/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/objpscostdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03	c # [type: real, range: [0,1], default: 0.01]
0.00/0.03	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/oneopt/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/pscostdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c heuristics/rens/freq = -1
0.00/0.03	c 
0.00/0.03	c # minimum percentage of integer variables that have to be fixable 
0.00/0.03	c # [type: real, range: [0,1], default: 0.5]
0.00/0.03	c heuristics/rens/minfixingrate = 0.3
0.00/0.03	c 
0.00/0.03	c # number of nodes added to the contingent of the total nodes
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03	c heuristics/rens/nodesofs = 2000
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/rootsoldiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/rounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/shifting/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/simplerounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c heuristics/trivial/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/trysol/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/veclendiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/zirounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c separating/cmir/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c separating/flowcover/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/rapidlearning/freq = 0
0.00/0.03	c 
0.00/0.03	c -----------------------------------------------------------------------------------------------
0.00/0.03	c start solving
0.00/0.04	c 
0.00/0.04	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.04	c   0.0s|     1 |     0 |    52 |     - | 743k|   0 |  44 | 169 |  73 | 169 |  73 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.22	c   0.2s|     1 |     0 |    82 |     - |1147k|   0 |  49 | 169 | 216 | 169 |  88 |  15 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.25	c   0.2s|     1 |     0 |   122 |     - |1440k|   0 |  58 | 169 | 216 | 169 |  94 |  21 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.27	c   0.2s|     1 |     0 |   168 |     - |1723k|   0 |  58 | 169 | 216 | 169 | 100 |  27 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.29	c   0.2s|     1 |     0 |   190 |     - |1932k|   0 |  59 | 169 | 216 | 169 | 104 |  31 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.32	c   0.3s|     1 |     0 |   229 |     - |2105k|   0 |  56 | 169 | 216 | 169 | 105 |  32 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.49/0.56	c   0.5s|     1 |     0 |   251 |     - |2059k|   0 |  57 | 169 | 174 | 169 | 105 |  32 |   0 |  12 | 0.000000e+00 |      --      |    Inf 
0.59/0.69	c   0.6s|     1 |     0 |   372 |     - |2052k|   0 |  53 | 169 | 167 | 169 | 105 |  32 |   0 |  19 | 0.000000e+00 |      --      |    Inf 
0.79/0.85	c   0.8s|     1 |     0 |   392 |     - |2032k|   0 |  54 | 169 | 148 | 169 | 105 |  32 |   0 |  29 | 0.000000e+00 |      --      |    Inf 
1.00/1.02	c   0.9s|     1 |     0 |   409 |     - |2026k|   0 |  54 | 169 | 142 | 169 | 105 |  32 |   0 |  36 | 0.000000e+00 |      --      |    Inf 
1.09/1.13	c   1.1s|     1 |     0 |   456 |     - |2014k|   0 |  52 | 169 | 132 | 169 | 105 |  32 |   0 |  42 | 0.000000e+00 |      --      |    Inf 
1.19/1.26	c   1.2s|     1 |     0 |   472 |     - |2007k|   0 |  52 | 169 | 124 | 169 |  94 |  32 |   0 |  51 | 0.000000e+00 |      --      |    Inf 
1.29/1.33	c   1.3s|     1 |     0 |   484 |     - |2005k|   0 |  53 | 169 | 123 | 169 |  94 |  32 |   0 |  57 | 0.000000e+00 |      --      |    Inf 
1.39/1.47	c   1.4s|     1 |     0 |   484 |     - |2005k|   0 |   - | 169 | 123 | 169 |  94 |  32 |   0 |  66 | 0.000000e+00 |      --      |    Inf 
1.39/1.47	c (run 1, node 1) restarting after 38 global fixings of integer variables
1.39/1.47	c 
1.39/1.47	c (restart) converted 21 cuts from the global cut pool into linear constraints
1.39/1.47	c 
1.39/1.47	c presolving:
1.39/1.48	c (round 1) 38 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 77 clqs
1.39/1.48	c (round 2) 38 del vars, 7 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 77 clqs
1.39/1.48	c (round 3) 38 del vars, 7 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 65 upgd conss, 16 impls, 77 clqs
1.39/1.49	c presolving (4 rounds):
1.39/1.49	c  38 deleted vars, 7 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
1.39/1.49	c  16 implications, 77 cliques
1.39/1.49	c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 137 constraints
1.39/1.49	c       8 constraints of type <knapsack>
1.39/1.49	c      77 constraints of type <setppc>
1.39/1.49	c      52 constraints of type <logicor>
1.39/1.49	c transformed objective value is always integral (scale: 1)
1.39/1.49	c Presolving Time: 0.04
1.39/1.49	c 
1.49/1.50	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.49/1.50	c   1.4s|     1 |     0 |   562 |     - | 876k|   0 |  40 | 131 | 137 | 131 |  90 |   0 |   0 |  66 | 0.000000e+00 |      --      |    Inf 
1.49/1.53	c   1.4s|     1 |     0 |   711 |     - |1128k|   0 |  43 | 131 | 137 | 131 | 102 |  12 |   0 |  66 | 0.000000e+00 |      --      |    Inf 
1.79/1.80	c   1.7s|     1 |     0 |   775 |     - |1128k|   0 |  47 | 131 | 137 | 131 | 102 |  12 |   0 |  85 | 0.000000e+00 |      --      |    Inf 
1.89/1.91	c   1.8s|     1 |     0 |   854 |     - |1128k|   0 |  48 | 131 | 136 | 131 | 102 |  12 |   0 |  92 | 0.000000e+00 |      --      |    Inf 
1.99/2.03	c   1.9s|     1 |     0 |  1007 |     - |1128k|   0 |  43 | 131 | 136 | 131 | 102 |  12 |   0 |  99 | 0.000000e+00 |      --      |    Inf 
1.99/2.09	c   2.0s|     1 |     0 |  1166 |     - |1128k|   0 |  43 | 131 | 136 | 131 | 102 |  12 |   0 | 104 | 0.000000e+00 |      --      |    Inf 
1.99/2.09	c   2.0s|     1 |     0 |  1166 |     - |1128k|   0 |  43 | 131 | 136 | 131 | 102 |  12 |   0 | 106 |      --      |      --      |   0.00%
1.99/2.09	c 
1.99/2.09	c SCIP Status        : problem is solved [infeasible]
1.99/2.09	c Solving Time (sec) : 1.98
1.99/2.09	c Solving Nodes      : 1 (total of 2 nodes in 2 runs)
1.99/2.09	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
1.99/2.09	c Dual Bound         : +1.00000000000000e+20
1.99/2.09	c Gap                : 0.00 %
1.99/2.09	s UNSATISFIABLE
1.99/2.09	c SCIP Status        : problem is solved [infeasible]
1.99/2.09	c Solving Time       :       1.98
1.99/2.09	c Original Problem   :
1.99/2.09	c   Problem name     : HOME/instance-2665740-1276274394.opb
1.99/2.09	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.09	c   Constraints      : 101 initial, 101 maximal
1.99/2.09	c Presolved Problem  :
1.99/2.09	c   Problem name     : t_HOME/instance-2665740-1276274394.opb
1.99/2.09	c   Variables        : 131 (131 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.09	c   Constraints      : 137 initial, 137 maximal
1.99/2.09	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.99/2.09	c   trivial          :       0.00         38          0          0          0          0          0          0          0
1.99/2.09	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.99/2.09	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.99/2.09	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.99/2.09	c   implics          :       0.00          0          0          0          0          0          0          0          0
1.99/2.09	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.99/2.09	c   knapsack         :       0.01          0          0          0          0          0          0          0          0
1.99/2.09	c   setppc           :       0.01          0          0          0          0          0          0          0          0
1.99/2.09	c   linear           :       0.02          0          0          0          0          0         34          3          0
1.99/2.09	c   logicor          :       0.00          0          0          0          0          0          1          0          0
1.99/2.09	c   root node        :          -         58          -          -         58          -          -          -          -
1.99/2.09	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.99/2.09	c   integral         :          0          0          0         13          0          1         58          0          0          0
1.99/2.09	c   knapsack         :          8          6         13          0          0          0          0          0          0          0
1.99/2.09	c   setppc           :         77          6         13          0          0          0          0          0          0          0
1.99/2.09	c   logicor          :         52          6          6          0          0          0          0          0          0          0
1.99/2.09	c   countsols        :          0          0          0          0          0          0          0          0          0          0
1.99/2.09	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.99/2.09	c   integral         :       1.61       0.00       0.00       1.61       0.00
1.99/2.09	c   knapsack         :       0.01       0.01       0.00       0.00       0.00
1.99/2.09	c   setppc           :       0.00       0.00       0.00       0.00       0.00
1.99/2.09	c   logicor          :       0.00       0.00       0.00       0.00       0.00
1.99/2.09	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.99/2.09	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.99/2.09	c   vbounds          :       0.00          2          0          0
1.99/2.09	c   rootredcost      :       0.00          0          0          0
1.99/2.09	c   pseudoobj        :       0.00          0          0          0
1.99/2.09	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.99/2.09	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
1.99/2.09	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.99/2.09	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.99/2.09	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.99/2.09	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.99/2.09	c   applied globally :          -          -          -          0        0.0          -          -          -
1.99/2.09	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.99/2.09	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.99/2.09	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 79)
1.99/2.09	c   redcost          :       0.00          6          0          0          0          0
1.99/2.09	c   impliedbounds    :       0.00          6          0          0          0          0
1.99/2.09	c   intobj           :       0.00          0          0          0          0          0
1.99/2.09	c   cgmip            :       0.00          0          0          0          0          0
1.99/2.09	c   gomory           :       0.03          6          0          0          9          0
1.99/2.09	c   strongcg         :       0.05          6          0          0        340          0
1.99/2.09	c   cmir             :       0.00          0          0          0          0          0
1.99/2.09	c   flowcover        :       0.00          0          0          0          0          0
1.99/2.09	c   clique           :       0.01          6          0          0         27          0
1.99/2.09	c   zerohalf         :       0.00          0          0          0          0          0
1.99/2.09	c   mcf              :       0.00          2          0          0          0          0
1.99/2.09	c   rapidlearning    :       0.15          1          0          0          0        143
1.99/2.09	c Pricers            :       Time      Calls       Vars
1.99/2.09	c   problem variables:       0.00          0          0
1.99/2.09	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.99/2.09	c   relpscost        :       1.61         13          1         58          0          0          0
1.99/2.09	c   pscost           :       0.00          0          0          0          0          0          0
1.99/2.09	c   inference        :       0.00          0          0          0          0          0          0
1.99/2.09	c   mostinf          :       0.00          0          0          0          0          0          0
1.99/2.09	c   leastinf         :       0.00          0          0          0          0          0          0
1.99/2.09	c   fullstrong       :       0.00          0          0          0          0          0          0
1.99/2.09	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.99/2.09	c   random           :       0.00          0          0          0          0          0          0
1.99/2.09	c Primal Heuristics  :       Time      Calls      Found
1.99/2.09	c   LP solutions     :       0.00          -          0
1.99/2.09	c   pseudo solutions :       0.00          -          0
1.99/2.09	c   trivial          :       0.00          1          0
1.99/2.09	c   simplerounding   :       0.00          0          0
1.99/2.09	c   zirounding       :       0.00          0          0
1.99/2.09	c   rounding         :       0.00          0          0
1.99/2.09	c   shifting         :       0.00          0          0
1.99/2.09	c   intshifting      :       0.00          0          0
1.99/2.09	c   oneopt           :       0.00          0          0
1.99/2.09	c   twoopt           :       0.00          0          0
1.99/2.09	c   fixandinfer      :       0.00          0          0
1.99/2.09	c   feaspump         :       0.00          0          0
1.99/2.09	c   coefdiving       :       0.00          0          0
1.99/2.09	c   pscostdiving     :       0.00          0          0
1.99/2.09	c   fracdiving       :       0.00          0          0
1.99/2.09	c   veclendiving     :       0.00          0          0
1.99/2.09	c   intdiving        :       0.00          0          0
1.99/2.09	c   actconsdiving    :       0.00          0          0
1.99/2.09	c   objpscostdiving  :       0.00          0          0
1.99/2.09	c   rootsoldiving    :       0.00          0          0
1.99/2.09	c   linesearchdiving :       0.00          0          0
1.99/2.09	c   guideddiving     :       0.00          0          0
1.99/2.09	c   octane           :       0.00          0          0
1.99/2.09	c   rens             :       0.00          0          0
1.99/2.09	c   rins             :       0.00          0          0
1.99/2.09	c   localbranching   :       0.00          0          0
1.99/2.09	c   mutation         :       0.00          0          0
1.99/2.09	c   crossover        :       0.00          0          0
1.99/2.09	c   dins             :       0.00          0          0
1.99/2.09	c   undercover       :       0.00          0          0
1.99/2.09	c   nlp              :       0.00          0          0
1.99/2.09	c   trysol           :       0.00          0          0
1.99/2.09	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.99/2.09	c   primal LP        :       0.00          0          0       0.00          -
1.99/2.09	c   dual LP          :       0.04         19       1166      61.37   29150.00
1.99/2.09	c   lex dual LP      :       0.00          0          0       0.00          -
1.99/2.09	c   barrier LP       :       0.00          0          0       0.00          -
1.99/2.09	c   diving/probing LP:       0.00          0          0       0.00          -
1.99/2.09	c   strong branching :       1.61        106      28034     264.47   17412.42
1.99/2.09	c     (at root node) :          -        106      28034     264.47          -
1.99/2.09	c   conflict analysis:       0.00          0          0       0.00          -
1.99/2.09	c B&B Tree           :
1.99/2.09	c   number of runs   :          2
1.99/2.09	c   nodes            :          1
1.99/2.09	c   nodes (total)    :          2
1.99/2.09	c   nodes left       :          0
1.99/2.09	c   max depth        :          0
1.99/2.09	c   max depth (total):          0
1.99/2.09	c   backtracks       :          0 (0.0%)
1.99/2.09	c   delayed cutoffs  :          0
1.99/2.09	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
1.99/2.09	c   avg switch length:       2.00
1.99/2.09	c   switching time   :       0.00
1.99/2.09	c Solution           :
1.99/2.09	c   Solutions found  :          0 (0 improvements)
1.99/2.09	c   Primal Bound     : infeasible
1.99/2.09	c   Dual Bound       :          -
1.99/2.09	c   Gap              :       0.00 %
1.99/2.09	c   Root Dual Bound  :          -
1.99/2.09	c   Root Iterations  :       1166
1.99/2.10	c Time complete: 2.09.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2665740-1276274394/watcher-2665740-1276274394 -o /tmp/evaluation-result-2665740-1276274394/solver-2665740-1276274394 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665740-1276274394.opb -t 1800 -m 1800 

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): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 1.27 1.08 1.02 3/106 4394
/proc/meminfo: memFree=1725012/2059040 swapFree=4192956/4192956
[pid=4394] ppid=4392 vsize=9288 CPUtime=0
/proc/4394/stat : 4394 (pbscip.linux.x8) R 4392 4394 2317 0 -1 4202496 1039 0 0 0 0 0 0 0 20 0 1 0 1095717 9510912 960 1992294400 4194304 9819077 140736143749264 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/4394/statm: 2322 969 371 1374 0 943 0

[startup+0.0127461 s]
/proc/loadavg: 1.27 1.08 1.02 3/106 4394
/proc/meminfo: memFree=1725012/2059040 swapFree=4192956/4192956
[pid=4394] ppid=4392 vsize=10688 CPUtime=0
/proc/4394/stat : 4394 (pbscip.linux.x8) R 4392 4394 2317 0 -1 4202496 1608 0 0 0 0 0 0 0 20 0 1 0 1095717 10944512 1529 1992294400 4194304 9819077 140736143749264 18446744073709551615 8585088 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/4394/statm: 2672 1529 386 1374 0 1293 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 10688

[startup+0.100748 s]
/proc/loadavg: 1.27 1.08 1.02 3/106 4394
/proc/meminfo: memFree=1725012/2059040 swapFree=4192956/4192956
[pid=4394] ppid=4392 vsize=23552 CPUtime=0.09
/proc/4394/stat : 4394 (pbscip.linux.x8) R 4392 4394 2317 0 -1 4202496 8842 0 0 0 6 3 0 0 20 0 1 0 1095717 24117248 4290 1992294400 4194304 9819077 140736143749264 18446744073709551615 4854299 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4394/statm: 5888 4290 681 1374 0 4509 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 23552

[startup+0.300785 s]
/proc/loadavg: 1.27 1.08 1.02 3/106 4394
/proc/meminfo: memFree=1725012/2059040 swapFree=4192956/4192956
[pid=4394] ppid=4392 vsize=17628 CPUtime=0.29
/proc/4394/stat : 4394 (pbscip.linux.x8) R 4392 4394 2317 0 -1 4202496 9140 0 0 0 26 3 0 0 20 0 1 0 1095717 18051072 3291 1992294400 4194304 9819077 140736143749264 18446744073709551615 6051987 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4394/statm: 4407 3291 694 1374 0 3028 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 17628

[startup+0.70086 s]
/proc/loadavg: 1.27 1.08 1.02 3/106 4394
/proc/meminfo: memFree=1725012/2059040 swapFree=4192956/4192956
[pid=4394] ppid=4392 vsize=18732 CPUtime=0.69
/proc/4394/stat : 4394 (pbscip.linux.x8) R 4392 4394 2317 0 -1 4202496 9859 0 0 0 64 5 0 0 21 0 1 0 1095717 19181568 3307 1992294400 4194304 9819077 140736143749264 18446744073709551615 6676955 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4394/statm: 4683 3307 700 1374 0 3304 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 18732

[startup+1.50101 s]
/proc/loadavg: 1.27 1.08 1.02 2/107 4395
/proc/meminfo: memFree=1714340/2059040 swapFree=4192956/4192956
[pid=4394] ppid=4392 vsize=17560 CPUtime=1.49
/proc/4394/stat : 4394 (pbscip.linux.x8) R 4392 4394 2317 0 -1 4202496 13797 0 0 0 141 8 0 0 23 0 1 0 1095717 17981440 3310 1992294400 4194304 9819077 140736143749264 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4394/statm: 4390 3310 710 1374 0 3011 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 17560

############
# WARNING:
# current cumulated CPU time (0 s) is less than in the last sample (1.99 s)
# The time of a child was probably not reported to its father.
# (see the two samples below)
# Adding the difference (1.99 s) to the 'lost time'.

[startup+2.0011 s]
/proc/loadavg: 1.27 1.08 1.02 2/107 4395
/proc/meminfo: memFree=1714340/2059040 swapFree=4192956/4192956
[pid=4394] ppid=4392 vsize=19192 CPUtime=1.99
/proc/4394/stat : 4394 (pbscip.linux.x8) R 4392 4394 2317 0 -1 4202496 15621 0 0 0 189 10 0 0 25 0 1 0 1095717 19652608 3325 1992294400 4194304 9819077 140736143749264 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4394/statm: 4798 3325 711 1374 0 3419 0
Current children cumulated CPU time (s) 1.99
Current children cumulated vsize (KiB) 19192

[startup+2.10112 s]
/proc/loadavg: 1.27 1.08 1.02 2/107 4395
/proc/meminfo: memFree=1718184/2059040 swapFree=4192956/4192956
[pid=4394] ppid=-1 vsize=0 CPUtime=0
/proc/4394/stat : -- couldn't open stat file --/proc/4394/statm: Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 0
#
############


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

[startup+1.90108 s]
/proc/loadavg: 1.27 1.08 1.02 2/107 4395
/proc/meminfo: memFree=1714340/2059040 swapFree=4192956/4192956
[pid=4394] ppid=4392 vsize=19176 CPUtime=1.89
/proc/4394/stat : 4394 (pbscip.linux.x8) R 4392 4394 2317 0 -1 4202496 15284 0 0 0 179 10 0 0 25 0 1 0 1095717 19636224 3327 1992294400 4194304 9819077 140736143749264 18446744073709551615 7317197 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4394/statm: 4794 3327 711 1374 0 3415 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 19176

[startup+2.10112 s]
/proc/loadavg: 1.27 1.08 1.02 2/107 4395
/proc/meminfo: memFree=1718184/2059040 swapFree=4192956/4192956
[pid=4394] ppid=-1 vsize=0 CPUtime=0
/proc/4394/stat : -- couldn't open stat file --/proc/4394/statm: Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 0

Child status: 0

# WARNING:
# The CPU time of some children was not reported to their father
# (probably because of a missing or aborted wait()).
# This 'lost CPU time' is added to the watched process CPU time.
#  lost CPU time (s): 1.99
#  lost CPU user time (s): 1.89
#  lost CPU system time (s): 0.1

Real time (s): 2.10365
CPU time (s): 4.09268
CPU user time (s): 3.8787
CPU system time (s): 0.213982
CPU usage (%): 194.551
Max. virtual memory (cumulated for all children) (KiB): 23816

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

runsolver used 0.010998 second user time and 0.020996 second system time

The end

Launcher Data 

Begin job on node019 at 2010-06-11 18:39:54
IDJOB=2665740
IDBENCH=1202
IDSOLVER=1168
FILE ID=node019/2665740-1276274394
PBS_JOBID= 11172193
Free space on /tmp= 62356 MiB

SOLVER NAME= SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/wnqueen/normalized-t2001.13queen13.1111224255.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.clp -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2665740-1276274394/watcher-2665740-1276274394 -o /tmp/evaluation-result-2665740-1276274394/solver-2665740-1276274394 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665740-1276274394.opb -t 1800 -m 1800

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 1800 MiB
MAX NB THREAD= 0

MD5SUM BENCH= 907b081b964ca265d29825e5079e97bd
RANDOM SEED=588812649

node019.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	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.264
cache size	: 2048 KB
physical id	: 0
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
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 lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 6000.52
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.264
cache size	: 2048 KB
physical id	: 3
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
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 lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5599.54
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1725416 kB
Buffers:         37220 kB
Cached:         171508 kB
SwapCached:          0 kB
Active:         129948 kB
Inactive:       137976 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1725416 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            6344 kB
Writeback:           0 kB
AnonPages:       59144 kB
Mapped:          15424 kB
Slab:            44008 kB
PageTables:       3976 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180960 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264948 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62352 MiB
End job on node019 at 2010-06-11 18:39:56