Trace number 2664485

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
SCIPnone SCIP 1.2.1.2 without any LP solverSAT 1.23781 1.24005

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/
FPGA_SAT05/normalized-fpga20_20_sat_pb.cnf.cr.opb
MD5SUM192f8feb97785f57d6eda41fc7a200be
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
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.010997
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables600
Total number of constraints460
Number of constraints which are clauses420
Number of constraints which are cardinality constraints (but not clauses)40
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint10
Maximum length of a constraint20
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 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 21
Number of bits of the biggest sum of numbers5
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: NONE] [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-2664485-1276321315.opb>
0.00/0.02	c original problem has 600 variables (600 bin, 0 int, 0 impl, 0 cont) and 460 constraints
0.00/0.02	c problem read
0.00/0.02	c No objective function, only one solution is needed.
0.00/0.02	c presolving settings loaded
0.00/0.02	c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.03	c presolving:
0.00/0.05	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 460 upgd conss, 0 impls, 40 clqs
0.00/0.06	c presolving (2 rounds):
0.00/0.06	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.06	c  0 implications, 40 cliques
0.00/0.06	c presolved problem has 600 variables (600 bin, 0 int, 0 impl, 0 cont) and 460 constraints
0.00/0.06	c      40 constraints of type <setppc>
0.00/0.06	c     420 constraints of type <logicor>
0.00/0.06	c transformed objective value is always integral (scale: 1)
0.00/0.06	c Presolving Time: 0.01
0.00/0.06	c - non default parameters ----------------------------------------------------------------------
0.00/0.06	c # SCIP version 1.2.1.2
0.00/0.06	c 
0.00/0.06	c # frequency for displaying node information lines
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06	c display/freq = 10000
0.00/0.06	c 
0.00/0.06	c # maximal time in seconds to run
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06	c limits/time = 1799.99
0.00/0.06	c 
0.00/0.06	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06	c limits/memory = 1620
0.00/0.06	c 
0.00/0.06	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06	c limits/solutions = 1
0.00/0.06	c 
0.00/0.06	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c lp/solvefreq = -1
0.00/0.06	c 
0.00/0.06	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.06	c separating/maxrounds = 1
0.00/0.06	c 
0.00/0.06	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06	c separating/maxroundsroot = 5
0.00/0.06	c 
0.00/0.06	c # should presolving try to simplify inequalities
0.00/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06	c constraints/linear/simplifyinequalities = TRUE
0.00/0.06	c 
0.00/0.06	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.06	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.06	c constraints/knapsack/disaggregation = FALSE
0.00/0.06	c 
0.00/0.06	c # should presolving try to simplify knapsacks
0.00/0.06	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06	c 
0.00/0.06	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06	c presolving/probing/maxrounds = 0
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/coefdiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.06	c heuristics/crossover/freq = -1
0.00/0.06	c 
0.00/0.06	c # number of nodes added to the contingent of the total nodes
0.00/0.06	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06	c heuristics/crossover/nodesofs = 750
0.00/0.06	c 
0.00/0.06	c # number of nodes without incumbent change that heuristic should wait
0.00/0.06	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.06	c heuristics/crossover/nwaitingnodes = 100
0.00/0.06	c 
0.00/0.06	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.06	c # [type: real, range: [0,1], default: 0.1]
0.00/0.06	c heuristics/crossover/nodesquot = 0.15
0.00/0.06	c 
0.00/0.06	c # minimum percentage of integer variables that have to be fixed 
0.00/0.06	c # [type: real, range: [0,1], default: 0.666]
0.00/0.06	c heuristics/crossover/minfixingrate = 0.5
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06	c heuristics/feaspump/freq = -1
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/fracdiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/guideddiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/intshifting/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/linesearchdiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/nlp/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06	c heuristics/objpscostdiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.06	c # [type: real, range: [0,1], default: 0.01]
0.00/0.06	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/oneopt/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/pscostdiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06	c heuristics/rens/freq = -1
0.00/0.06	c 
0.00/0.06	c # minimum percentage of integer variables that have to be fixable 
0.00/0.06	c # [type: real, range: [0,1], default: 0.5]
0.00/0.06	c heuristics/rens/minfixingrate = 0.3
0.00/0.06	c 
0.00/0.06	c # number of nodes added to the contingent of the total nodes
0.00/0.06	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06	c heuristics/rens/nodesofs = 2000
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06	c heuristics/rootsoldiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.06	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/rounding/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/shifting/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/simplerounding/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06	c heuristics/trivial/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/trysol/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06	c heuristics/veclendiving/freq = -1
0.00/0.06	c 
0.00/0.06	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.06	c 
0.00/0.06	c # additional number of allowed LP iterations
0.00/0.06	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.06	c 
0.00/0.06	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06	c heuristics/zirounding/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06	c separating/cmir/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06	c separating/flowcover/freq = -1
0.00/0.06	c 
0.00/0.06	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06	c separating/rapidlearning/freq = 0
0.00/0.06	c 
0.00/0.06	c -----------------------------------------------------------------------------------------------
0.00/0.06	c start solving
0.00/0.06	c 
0.00/0.06	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.06	c   0.0s|     1 |     2 |     0 |     - |1835k|   0 |   - | 600 | 460 |   0 |   0 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.20/1.22	c * 1.1s|  5024 |     0 |     0 |   0.0 |2208k| 347 |   - | 600 | 503 |   0 |   0 |   0 | 110 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
1.20/1.22	c 
1.20/1.22	c SCIP Status        : problem is solved [optimal solution found]
1.20/1.22	c Solving Time (sec) : 1.10
1.20/1.22	c Solving Nodes      : 5024
1.20/1.22	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
1.20/1.22	c Dual Bound         : +0.00000000000000e+00
1.20/1.22	c Gap                : 0.00 %
1.20/1.22	s SATISFIABLE
1.20/1.22	v -x269 -x279 -x271 -x275 -x277 -x376 -x368 -x365 -x220 -x215 -x211 -x204 -x370 -x359 -x358 -x356 -x343 -x261 -x270 x347 -x297 -x296 
1.20/1.22	v -x294 -x292 -x290 -x282 -x276 x206 -x373 -x342 -x351 -x295 -x291 -x213 -x274 -x120 -x117 -x114 -x113 -x111 -x109 -x103 -x159 
1.20/1.22	v -x156 -x155 -x151 -x145 -x144 -x142 x110 -x205 -x299 -x118 -x201 -x273 -x112 -x345 -x104 -x265 -x280 -x141 -x78 -x74 -x73 
1.20/1.22	v -x72 -x71 -x70 -x68 -x67 -x65 -x64 -x62 -x61 -x179 -x178 -x177 -x176 -x172 -x171 -x170 -x168 -x166 -x163 -x161 -x372 x263 -x147 
1.20/1.22	v -x284 -x289 -x380 -x341 -x175 -x169 -x210 -x153 -x157 -x66 -x240 -x239 -x238 -x236 -x235 -x233 -x231 -x229 -x226 -x225 -x224 
1.20/1.22	v -x222 -x378 x180 -x260 -x257 -x256 -x252 -x248 -x247 x245 -x241 -x369 -x249 -x56 -x55 -x54 x52 -x49 -x48 -x46 -x44 -x43 -x42 
1.20/1.22	v -x221 -x227 -x234 -x59 -x101 -x350 -x262 -x167 -x361 -x106 -x38 -x37 -x36 -x35 -x31 -x30 -x27 -x26 -x24 -x21 -x107 -x158 
1.20/1.22	v -x51 -x20 -x17 -x15 -x14 -x10 -x9 x8 -x7 -x5 -x3 -x146 -x346 -x150 x79 -x366 x371 -x143 -x53 -x285 -x154 -x140 x138 -x136 -x134 
1.20/1.22	v -x132 -x129 -x128 -x123 -x122 -x121 -x1 -x28 -x77 -x281 -x115 -x344 -x377 -x250 -x360 -x363 -x228 x149 -x367 -x34 -x133 -x340 
1.20/1.22	v -x339 -x338 -x337 -x332 -x330 -x328 -x326 -x325 x324 -x322 -x321 -x60 -x63 -x300 -x2 -x126 -x259 -x267 -x116 -x272 -x400 
1.20/1.22	v -x397 x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x23 -x354 -x209 -x333 -x381 -x334 -x230 -x208 
1.20/1.22	v -x69 x22 -x329 -x45 -x364 -x399 -x6 -x13 -x200 -x199 -x198 -x197 x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 
1.20/1.22	v -x186 -x185 -x184 -x183 -x100 -x99 -x98 -x97 -x96 -x93 -x92 -x91 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 x81 -x223 -x75 -x336 
1.20/1.22	v -x286 -x278 -x165 -x374 -x102 -x246 -x90 -x254 -x323 -x50 -x298 -x335 -x253 -x216 -x219 -x244 -x58 -x127 -x357 -x242 -x18 
1.20/1.22	v -x353 -x396 -x202 -x125 -x355 -x173 -x349 -x203 -x131 -x214 -x57 -x40 -x19 -x264 -x108 -x258 -x124 -x181 -x32 -x207 -x398 -x33 
1.20/1.22	v -x460 -x459 -x458 x457 -x456 -x455 -x454 -x453 -x452 -x451 -x266 -x232 -x80 -x382 x237 -x39 -x95 -x379 -x212 -x600 -x599 
1.20/1.22	v x598 -x597 -x596 -x595 -x594 -x593 -x592 -x591 -x160 -x320 -x319 -x316 -x315 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 
1.20/1.22	v -x305 -x304 -x303 -x302 -x301 -x174 -x217 -x139 -x287 -x317 -x375 -x251 -x4 -x490 -x489 -x488 -x487 -x486 -x485 x484 -x483 -x482 
1.20/1.22	v -x481 -x29 -x500 -x499 -x498 -x497 x496 -x495 -x494 -x493 -x492 -x491 -x130 -x331 -x243 -x430 x429 -x428 -x427 -x426 -x425 
1.20/1.22	v -x424 -x423 -x422 -x421 -x283 -x530 x529 -x528 -x527 -x526 -x525 -x524 -x523 -x522 -x521 x293 -x162 -x25 -x590 -x589 -x588 
1.20/1.22	v -x587 x586 -x585 -x584 -x583 -x582 -x581 -x119 -x94 -x135 -x540 -x539 -x538 -x537 -x536 x535 -x534 -x533 -x532 -x531 x314 x410 
1.20/1.22	v -x409 -x408 -x407 -x406 -x405 -x404 -x403 -x402 -x401 -x41 -x76 -x12 -x348 -x268 x510 -x509 -x508 -x507 -x506 -x505 -x504 -x503 
1.20/1.22	v -x502 -x501 -x11 -x440 -x439 -x438 -x437 -x436 -x435 -x434 -x433 -x432 x431 -x164 -x148 -x570 -x569 -x568 -x567 -x566 -x565 
1.20/1.22	v -x564 x563 -x562 -x561 -x137 -x480 -x479 -x478 -x477 -x476 -x475 -x474 -x473 x472 -x471 -x288 -x152 -x520 -x519 -x518 -x517 
1.20/1.22	v -x516 -x515 x514 -x513 -x512 -x511 -x352 -x327 -x470 -x469 x468 -x467 -x466 -x465 -x464 -x463 -x462 -x461 -x47 -x450 -x449 
1.20/1.22	v -x448 -x447 -x446 -x445 -x444 x443 -x442 -x441 -x105 -x550 -x549 -x548 -x547 -x546 -x545 -x544 -x543 -x542 x541 -x255 -x318 
1.20/1.22	v -x580 -x579 -x578 -x577 -x576 -x575 -x574 -x573 x572 -x571 -x218 -x362 -x560 -x559 -x558 x557 -x556 -x555 -x554 -x553 -x552 -x551 
1.20/1.22	v -x16 -x420 -x419 -x418 -x417 -x416 x415 -x414 -x413 -x412 -x411 -x182 
1.20/1.22	c SCIP Status        : problem is solved [optimal solution found]
1.20/1.22	c Solving Time       :       1.10
1.20/1.22	c Original Problem   :
1.20/1.22	c   Problem name     : HOME/instance-2664485-1276321315.opb
1.20/1.22	c   Variables        : 600 (600 binary, 0 integer, 0 implicit integer, 0 continuous)
1.20/1.22	c   Constraints      : 460 initial, 460 maximal
1.20/1.22	c Presolved Problem  :
1.20/1.22	c   Problem name     : t_HOME/instance-2664485-1276321315.opb
1.20/1.22	c   Variables        : 600 (600 binary, 0 integer, 0 implicit integer, 0 continuous)
1.20/1.22	c   Constraints      : 460 initial, 514 maximal
1.20/1.22	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.20/1.22	c   trivial          :       0.00          0          0          0          0          0          0          0          0
1.20/1.22	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.20/1.22	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.20/1.22	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.20/1.22	c   implics          :       0.00          0          0          0          0          0          0          0          0
1.20/1.22	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.20/1.22	c   setppc           :       0.00          0          0          0          0          0          0          0          0
1.20/1.22	c   logicor          :       0.00          0          0          0          0          0          0          0          0
1.20/1.22	c   root node        :          -          0          -          -          0          -          -          -          -
1.20/1.22	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.20/1.22	c   integral         :          0          0          0          0          0          0          0          0          0          0
1.20/1.22	c   setppc           :         40          0       5863          0       4974         65       3341          0          0          0
1.20/1.22	c   logicor          :        420+         0       2213          0       4975          8       3632          0          0          0
1.20/1.22	c   countsols        :          0          0          0          0       4975          0          0          0          0          0
1.20/1.22	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.20/1.22	c   integral         :       0.00       0.00       0.00       0.00       0.00
1.20/1.23	c   setppc           :       0.05       0.00       0.00       0.00       0.05
1.20/1.23	c   logicor          :       0.57       0.00       0.03       0.00       0.54
1.20/1.23	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.20/1.23	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.20/1.23	c   vbounds          :       0.01          1          0          0
1.20/1.23	c   rootredcost      :       0.00          0          0          0
1.20/1.23	c   pseudoobj        :       0.00          0          0          0
1.20/1.23	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.20/1.23	c   propagation      :       0.00         73         73        778      109.5          0        0.0          -
1.20/1.23	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.20/1.23	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.20/1.23	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.20/1.23	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.20/1.23	c   applied globally :          -          -          -         79       46.3          -          -          -
1.20/1.23	c   applied locally  :          -          -          -         31       85.3          -          -          -
1.20/1.23	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.20/1.23	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
1.20/1.23	c   redcost          :       0.00          0          0          0          0          0
1.20/1.23	c   impliedbounds    :       0.00          0          0          0          0          0
1.20/1.23	c   intobj           :       0.00          0          0          0          0          0
1.20/1.23	c   cgmip            :       0.00          0          0          0          0          0
1.20/1.23	c   gomory           :       0.00          0          0          0          0          0
1.20/1.23	c   strongcg         :       0.00          0          0          0          0          0
1.20/1.23	c   cmir             :       0.00          0          0          0          0          0
1.20/1.23	c   flowcover        :       0.00          0          0          0          0          0
1.20/1.23	c   clique           :       0.00          0          0          0          0          0
1.20/1.23	c   zerohalf         :       0.00          0          0          0          0          0
1.20/1.23	c   mcf              :       0.00          0          0          0          0          0
1.20/1.23	c   rapidlearning    :       0.00          0          0          0          0          0
1.20/1.23	c Pricers            :       Time      Calls       Vars
1.20/1.23	c   problem variables:       0.00          0          0
1.20/1.23	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.20/1.23	c   relpscost        :       0.00          0          0          0          0          0          0
1.20/1.23	c   pscost           :       0.00          0          0          0          0          0          0
1.20/1.23	c   inference        :       0.32       4974          0          0          0          0       9948
1.20/1.23	c   mostinf          :       0.00          0          0          0          0          0          0
1.20/1.23	c   leastinf         :       0.00          0          0          0          0          0          0
1.20/1.23	c   fullstrong       :       0.00          0          0          0          0          0          0
1.20/1.23	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.20/1.23	c   random           :       0.00          0          0          0          0          0          0
1.20/1.23	c Primal Heuristics  :       Time      Calls      Found
1.20/1.23	c   LP solutions     :       0.00          -          0
1.20/1.23	c   pseudo solutions :       0.00          -          1
1.20/1.23	c   trivial          :       0.00          1          0
1.20/1.23	c   simplerounding   :       0.00          0          0
1.20/1.23	c   zirounding       :       0.00          0          0
1.20/1.23	c   rounding         :       0.00          0          0
1.20/1.23	c   shifting         :       0.00          0          0
1.20/1.23	c   intshifting      :       0.00          0          0
1.20/1.23	c   oneopt           :       0.00          0          0
1.20/1.23	c   twoopt           :       0.00          0          0
1.20/1.23	c   fixandinfer      :       0.00          0          0
1.20/1.23	c   feaspump         :       0.00          0          0
1.20/1.23	c   coefdiving       :       0.00          0          0
1.20/1.23	c   pscostdiving     :       0.00          0          0
1.20/1.23	c   fracdiving       :       0.00          0          0
1.20/1.23	c   veclendiving     :       0.00          0          0
1.20/1.23	c   intdiving        :       0.00          0          0
1.20/1.23	c   actconsdiving    :       0.00          0          0
1.20/1.23	c   objpscostdiving  :       0.00          0          0
1.20/1.23	c   rootsoldiving    :       0.00          0          0
1.20/1.23	c   linesearchdiving :       0.00          0          0
1.20/1.23	c   guideddiving     :       0.00          0          0
1.20/1.23	c   octane           :       0.00          0          0
1.20/1.23	c   rens             :       0.00          0          0
1.20/1.23	c   rins             :       0.00          0          0
1.20/1.23	c   localbranching   :       0.00          0          0
1.20/1.23	c   mutation         :       0.00          0          0
1.20/1.23	c   crossover        :       0.00          0          0
1.20/1.23	c   dins             :       0.00          0          0
1.20/1.23	c   undercover       :       0.00          0          0
1.20/1.23	c   nlp              :       0.00          0          0
1.20/1.23	c   trysol           :       0.00          0          0
1.20/1.23	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.20/1.23	c   primal LP        :       0.00          0          0       0.00          -
1.20/1.23	c   dual LP          :       0.00          0          0       0.00          -
1.20/1.23	c   lex dual LP      :       0.00          0          0       0.00          -
1.20/1.23	c   barrier LP       :       0.00          0          0       0.00          -
1.20/1.23	c   diving/probing LP:       0.00          0          0       0.00          -
1.20/1.23	c   strong branching :       0.00          0          0       0.00          -
1.20/1.23	c     (at root node) :          -          0          0       0.00          -
1.20/1.23	c   conflict analysis:       0.00          0          0       0.00          -
1.20/1.23	c B&B Tree           :
1.20/1.23	c   number of runs   :          1
1.20/1.23	c   nodes            :       5024
1.20/1.23	c   nodes (total)    :       5024
1.20/1.23	c   nodes left       :          0
1.20/1.23	c   max depth        :        347
1.20/1.23	c   max depth (total):        347
1.20/1.23	c   backtracks       :         26 (0.5%)
1.20/1.23	c   delayed cutoffs  :         37
1.20/1.23	c   repropagations   :        122 (838 domain reductions, 24 cutoffs)
1.20/1.23	c   avg switch length:       2.20
1.20/1.23	c   switching time   :       0.03
1.20/1.23	c Solution           :
1.20/1.23	c   Solutions found  :          1 (1 improvements)
1.20/1.23	c   First Solution   : +0.00000000000000e+00   (in run 1, after 5024 nodes, 1.10 seconds, depth 326, found by <relaxation>)
1.20/1.23	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 5024 nodes, 1.10 seconds, depth 326, found by <relaxation>)
1.20/1.23	c   Dual Bound       : +0.00000000000000e+00
1.20/1.23	c   Gap              :       0.00 %
1.20/1.23	c   Root Dual Bound  : +0.00000000000000e+00
1.20/1.23	c   Root Iterations  :          0
1.20/1.23	c Time complete: 1.22.

Verifier Data 

OK	0

Watcher Data 

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2664485-1276321315/watcher-2664485-1276321315 -o /tmp/evaluation-result-2664485-1276321315/solver-2664485-1276321315 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664485-1276321315.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: 0.80 1.02 1.02 3/106 7808
/proc/meminfo: memFree=1871852/2059040 swapFree=4135896/4192956
[pid=7808] ppid=7806 vsize=6584 CPUtime=0
/proc/7808/stat : 7808 (pbscip.linux.x8) R 7806 7808 7191 0 -1 4202496 1147 0 0 0 0 0 0 0 20 0 1 0 5786870 6742016 1071 1992294400 4194304 7136930 140735238884256 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/7808/statm: 1646 1079 254 719 0 925 0

[startup+0.100996 s]
/proc/loadavg: 0.80 1.02 1.02 3/106 7808
/proc/meminfo: memFree=1871852/2059040 swapFree=4135896/4192956
[pid=7808] ppid=7806 vsize=14136 CPUtime=0.09
/proc/7808/stat : 7808 (pbscip.linux.x8) R 7806 7808 7191 0 -1 4202496 4498 0 0 0 7 2 0 0 20 0 1 0 5786870 14475264 2782 1992294400 4194304 7136930 140735238884256 18446744073709551615 4697665 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/7808/statm: 3534 2782 374 719 0 2813 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 14136

[startup+0.200993 s]
/proc/loadavg: 0.80 1.02 1.02 3/106 7808
/proc/meminfo: memFree=1871852/2059040 swapFree=4135896/4192956
[pid=7808] ppid=7806 vsize=14840 CPUtime=0.19
/proc/7808/stat : 7808 (pbscip.linux.x8) R 7806 7808 7191 0 -1 4202496 4676 0 0 0 16 3 0 0 20 0 1 0 5786870 15196160 2960 1992294400 4194304 7136930 140735238884256 18446744073709551615 4407988 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/7808/statm: 3710 2960 379 719 0 2989 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 14840

[startup+0.300989 s]
/proc/loadavg: 0.80 1.02 1.02 3/106 7808
/proc/meminfo: memFree=1871852/2059040 swapFree=4135896/4192956
[pid=7808] ppid=7806 vsize=14840 CPUtime=0.3
/proc/7808/stat : 7808 (pbscip.linux.x8) R 7806 7808 7191 0 -1 4202496 4706 0 0 0 26 4 0 0 20 0 1 0 5786870 15196160 2990 1992294400 4194304 7136930 140735238884256 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/7808/statm: 3710 2990 379 719 0 2989 0
Current children cumulated CPU time (s) 0.3
Current children cumulated vsize (KiB) 14840

[startup+0.700974 s]
/proc/loadavg: 0.80 1.02 1.02 3/106 7808
/proc/meminfo: memFree=1871852/2059040 swapFree=4135896/4192956
[pid=7808] ppid=7806 vsize=15764 CPUtime=0.69
/proc/7808/stat : 7808 (pbscip.linux.x8) R 7806 7808 7191 0 -1 4202496 4921 0 0 0 63 6 0 0 21 0 1 0 5786870 16142336 3205 1992294400 4194304 7136930 140735238884256 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/7808/statm: 3941 3205 379 719 0 3220 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 15764

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

[startup+0.80097 s]
/proc/loadavg: 0.80 1.02 1.02 3/106 7808
/proc/meminfo: memFree=1871852/2059040 swapFree=4135896/4192956
[pid=7808] ppid=7806 vsize=15896 CPUtime=0.79
/proc/7808/stat : 7808 (pbscip.linux.x8) R 7806 7808 7191 0 -1 4202496 4972 0 0 0 73 6 0 0 21 0 1 0 5786870 16277504 3256 1992294400 4194304 7136930 140735238884256 18446744073709551615 4697599 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/7808/statm: 3974 3256 379 719 0 3253 0
Current children cumulated CPU time (s) 0.79
Current children cumulated vsize (KiB) 15896

[startup+1.20895 s]
/proc/loadavg: 0.80 1.02 1.02 2/107 7809
/proc/meminfo: memFree=1859444/2059040 swapFree=4135896/4192956
[pid=7808] ppid=7806 vsize=16544 CPUtime=1.2
/proc/7808/stat : 7808 (pbscip.linux.x8) R 7806 7808 7191 0 -1 4202496 5139 0 0 0 111 9 0 0 22 0 1 0 5786870 16941056 3423 1992294400 4194304 7136930 140735238884256 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/7808/statm: 4136 3423 379 719 0 3415 0
Current children cumulated CPU time (s) 1.2
Current children cumulated vsize (KiB) 16544

Child status: 0
Real time (s): 1.24005
CPU time (s): 1.23781
CPU user time (s): 1.13783
CPU system time (s): 0.099984
CPU usage (%): 99.8193
Max. virtual memory (cumulated for all children) (KiB): 16544

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.13783
system time used= 0.099984
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 5163
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= 35

runsolver used 0.008998 second user time and 0.017997 second system time

The end

Launcher Data 

Begin job on node026 at 2010-06-12 07:41:55
IDJOB=2664485
IDBENCH=1391
IDSOLVER=1167
FILE ID=node026/2664485-1276321315
PBS_JOBID= 11173158
Free space on /tmp= 62508 MiB

SOLVER NAME= SCIPnone SCIP 1.2.1.2 without any LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/FPGA_SAT05/normalized-fpga20_20_sat_pb.cnf.cr.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.none -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2664485-1276321315/watcher-2664485-1276321315 -o /tmp/evaluation-result-2664485-1276321315/solver-2664485-1276321315 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664485-1276321315.opb -t 1800 -m 1800

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

MD5SUM BENCH= 192f8feb97785f57d6eda41fc7a200be
RANDOM SEED=1986334462

node026.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.201
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.40
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.201
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.46
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1872380 kB
Buffers:          2380 kB
Cached:         100460 kB
SwapCached:      18696 kB
Active:          48396 kB
Inactive:        75376 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1872380 kB
SwapTotal:     4192956 kB
SwapFree:      4135896 kB
Dirty:            3352 kB
Writeback:           0 kB
AnonPages:        8736 kB
Mapped:           7840 kB
Slab:            41080 kB
PageTables:       4012 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181328 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= 62508 MiB
End job on node026 at 2010-06-12 07:41:56