Trace number 1884868

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.1.0.7 with CLP 1.8.2SAT 4.41833 4.42929

General information on the benchmark

Name/PURE-SAT/SAT09/CRAFTED/sgi/
satsgi-n22himBHm25-p0-q229.opb
MD5SUMa7f6d091d2a72c2403551174062eb6f8
Bench CategoryPURE-SAT (instances containing only clauses)
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.038993
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables550
Total number of constraints12397
Number of constraints which are clauses12397
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint2
Maximum length of a constraint25
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 26
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.09/0.17	c SCIP version 1.1.0.7
0.09/0.17	c LP-Solver Clp 1.8.2
0.09/0.17	c user parameter file <scip.set> not found - using default parameters
0.09/0.17	c read problem <HOME/instance-1884868-1245260565.opb>
0.09/0.17	c original problem has 550 variables (550 bin, 0 int, 0 impl, 0 cont) and 12397 constraints
0.19/0.20	c No objective function, only one solution is needed.
0.19/0.20	c start presolving problem
0.19/0.20	c presolving:
0.29/0.34	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12397 upgd conss, 24750 impls, 0 clqs
0.29/0.36	c presolving (2 rounds):
0.29/0.36	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.36	c  24750 implications, 0 cliques
0.29/0.36	c presolved problem has 550 variables (550 bin, 0 int, 0 impl, 0 cont) and 12397 constraints
0.29/0.36	c   12397 constraints of type <logicor>
0.29/0.36	c transformed objective value is always integral (scale: 1)
0.29/0.36	c Presolving Time: 0.13
0.29/0.36	c PURESAT
0.29/0.36	c -----------------------------------------------------------------------------------------------
0.29/0.36	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36	c separating/flowcover/freq = c -1
0.29/0.36	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36	c separating/cmir/freq = c -1
0.29/0.36	c # additional number of allowed LP iterations
0.29/0.36	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36	c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.36	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.36	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36	c heuristics/veclendiving/freq = c -1
0.29/0.36	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36	c heuristics/simplerounding/freq = c -1
0.29/0.36	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36	c heuristics/shifting/freq = c -1
0.29/0.36	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36	c heuristics/rounding/freq = c -1
0.29/0.36	c # additional number of allowed LP iterations
0.29/0.36	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.36	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.36	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.36	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36	c heuristics/rootsoldiving/freq = c -1
0.29/0.36	c # number of nodes added to the contingent of the total nodes
0.29/0.36	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.36	c heuristics/rens/nodesofs = c 2000
0.29/0.36	c # minimum percentage of integer variables that have to be fixable 
0.29/0.36	c # [type: real, range: [0,1], default: 0.5]
0.29/0.36	c heuristics/rens/minfixingrate = c 0.3
0.29/0.36	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36	c heuristics/rens/freq = c -1
0.29/0.36	c # additional number of allowed LP iterations
0.29/0.36	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.36	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.36	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36	c heuristics/pscostdiving/freq = c -1
0.29/0.36	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36	c heuristics/oneopt/freq = c -1
0.29/0.36	c # additional number of allowed LP iterations
0.29/0.36	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.36	c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.36	c # [type: real, range: [0,1], default: 0.01]
0.29/0.36	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.36	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36	c heuristics/objpscostdiving/freq = c -1
0.29/0.36	c # additional number of allowed LP iterations
0.29/0.36	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.36	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.36	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36	c heuristics/linesearchdiving/freq = c -1
0.29/0.36	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36	c heuristics/intshifting/freq = c -1
0.29/0.36	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36	c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.36	c # additional number of allowed LP iterations
0.29/0.36	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36	c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.36	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.36	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36	c heuristics/guideddiving/freq = c -1
0.29/0.36	c # additional number of allowed LP iterations
0.29/0.36	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36	c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.36	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.36	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36	c heuristics/fracdiving/freq = c -1
0.29/0.36	c # additional number of allowed LP iterations
0.29/0.36	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36	c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.36	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36	c heuristics/feaspump/freq = c -1
0.29/0.36	c # minimum percentage of integer variables that have to be fixed 
0.29/0.36	c # [type: real, range: [0,1], default: 0.666]
0.29/0.36	c heuristics/crossover/minfixingrate = c 0.5
0.29/0.36	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.36	c # [type: real, range: [0,1], default: 0.1]
0.29/0.36	c heuristics/crossover/nodesquot = c 0.15
0.29/0.36	c # number of nodes without incumbent change that heuristic should wait
0.29/0.36	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.36	c heuristics/crossover/nwaitingnodes = c 100
0.29/0.36	c # number of nodes added to the contingent of the total nodes
0.29/0.36	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.36	c heuristics/crossover/nodesofs = c 750
0.29/0.36	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.36	c heuristics/crossover/freq = c -1
0.29/0.36	c # additional number of allowed LP iterations
0.29/0.36	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36	c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.36	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.36	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36	c heuristics/coefdiving/freq = c -1
0.29/0.36	c # priority of node selection rule <dfs> in standard mode
0.29/0.36	c # [type: int, range: [-536870912,536870911], default: 0]
0.29/0.36	c nodeselection/dfs/stdpriority = c 1000000
0.29/0.36	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.36	c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36	c presolving/probing/maxrounds = c 0
0.29/0.36	c # should presolving try to simplify knapsacks
0.29/0.36	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.36	c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.36	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.36	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.36	c constraints/knapsack/disaggregation = c FALSE
0.29/0.36	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.37	c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37	c constraints/knapsack/maxnumcardlift = c 0
0.29/0.37	c # should presolving try to simplify inequalities
0.29/0.37	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.37	c constraints/linear/simplifyinequalities = c TRUE
0.29/0.37	c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.37	c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37	c separating/maxroundsroot = c 5
0.29/0.37	c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.37	c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.37	c separating/maxrounds = c 1
0.29/0.37	c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.29/0.37	c # [type: char, range: {lafpsqd}, default: l]
0.29/0.37	c lp/pricing = c a
0.29/0.37	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.29/0.37	c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.37	c lp/solvefreq = c 0
0.29/0.37	c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.37	c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37	c limits/solutions = c 1
0.29/0.37	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.37	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.37	c limits/memory = c 1620
0.29/0.37	c # maximal time in seconds to run
0.29/0.37	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.37	c limits/time = c 1791
0.29/0.37	c # frequency for displaying node information lines
0.29/0.37	c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.37	c display/freq = c 10000
0.29/0.37	c # should enforcement of pseudo solution be disabled?
0.29/0.37	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.37	c constraints/disableenfops = c TRUE
0.29/0.37	c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.29/0.37	c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.37	c constraints/agelimit = c 1
0.29/0.37	c # should binary conflicts be preferred?
0.29/0.37	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.37	c conflict/preferbinary = c TRUE
0.29/0.37	c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.29/0.37	c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37	c conflict/interconss = c 0
0.29/0.37	c -----------------------------------------------------------------------------------------------
0.29/0.37	c start solving problem
0.29/0.37	c 
0.39/0.44	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.39/0.44	c   0.2s|     1 |     0 |    44 |  14M|   0 |  44 | 550 |  12k|  12k| 550 |  12k|   0 |   0 |   0 | 2.200000e+01 |      --      |    Inf 
0.69/0.76	c   0.5s|     1 |     0 |   167 |  14M|   0 |  40 | 550 |  12k|  12k| 550 |  12k|   3 |   0 |   0 | 2.200000e+01 |      --      |    Inf 
1.19/1.20	c   1.0s|     1 |     0 |   357 |  14M|   0 |  34 | 550 |  12k|  12k| 550 |  12k|  11 |   0 |   0 | 2.200000e+01 |      --      |    Inf 
1.79/1.82	c   1.6s|     1 |     0 |   690 |  14M|   0 |  18 | 550 |  12k|  12k| 550 |  12k|  20 |   0 |   0 | 2.200000e+01 |      --      |    Inf 
2.59/2.70	c   2.4s|     1 |     0 |   971 |  15M|   0 |  27 | 550 |  12k|  12k| 550 |  12k|  26 |   0 |   0 | 2.200000e+01 |      --      |    Inf 
3.89/3.93	c   3.7s|     1 |     0 |  1188 |  15M|   0 |  10 | 550 |  12k|  12k| 550 |  12k|  31 |   0 |   0 | 2.200000e+01 |      --      |    Inf 
4.28/4.31	c   4.0s|     1 |     2 |  1188 |  15M|   0 |  10 | 550 |  12k|  12k| 550 |  12k|  31 |   0 |  10 | 2.200000e+01 |      --      |    Inf 
4.28/4.37	c * 4.1s|   340 |     0 |  1188 |  15M| 339 |   - | 550 |  12k|  11k|   0 |   0 |  31 |   0 |  10 | 2.200000e+01 | 2.200000e+01 |   0.00%
4.28/4.37	c 
4.28/4.37	c SCIP Status        : problem is solved [optimal solution found]
4.28/4.37	c Solving Time (sec) : 4.08
4.28/4.37	c Solving Nodes      : 340
4.28/4.37	c Primal Bound       : +2.20000000000000e+01 (1 solutions)
4.28/4.37	c Dual Bound         : +2.20000000000000e+01
4.28/4.37	c Gap                : 0.00 %
4.28/4.38	c NODE         340
4.28/4.38	c DUAL BOUND   22
4.28/4.38	c PRIMAL BOUND 22
4.28/4.38	c GAP          0
4.28/4.38	s SATISFIABLE
4.28/4.38	v -x550 -x549 -x548 -x547 -x546 -x545 -x544 -x543 -x542 -x541 -x540 -x539 x538 -x537 -x536 -x535 -x534 -x533 -x532 -x531 -x530 -x529 
4.28/4.38	v -x528 -x527 -x526 -x525 x524 -x523 -x522 -x521 -x520 -x519 -x518 -x517 -x516 -x515 -x514 -x513 -x512 -x511 -x510 -x509 -x508 
4.28/4.38	v -x507 -x506 -x505 -x504 -x503 -x502 -x501 -x500 -x499 -x498 -x497 -x496 -x495 -x494 -x493 -x492 -x491 -x490 -x489 -x488 -x487 
4.28/4.38	v -x486 -x485 -x484 -x483 -x482 -x481 -x480 -x479 -x478 -x477 x476 -x475 -x474 -x473 -x472 -x471 -x470 -x469 -x468 -x467 -x466 
4.28/4.38	v -x465 -x464 -x463 x462 -x461 -x460 -x459 -x458 -x457 -x456 -x455 -x454 -x453 -x452 -x451 -x450 -x449 -x448 -x447 -x446 -x445 
4.28/4.38	v -x444 -x443 -x442 -x441 -x440 -x439 -x438 -x437 -x436 -x435 -x434 -x433 -x432 -x431 -x430 -x429 -x428 x427 -x426 -x425 -x424 
4.28/4.38	v -x423 -x422 -x421 -x420 -x419 -x418 -x417 -x416 -x415 x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 -x406 -x405 -x404 -x403 
4.28/4.38	v -x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 
4.28/4.38	v -x382 -x381 -x380 -x379 x378 -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 x367 -x366 -x365 -x364 -x363 -x362 -x361 
4.28/4.38	v -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 
4.28/4.38	v -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322 -x321 x320 -x319 
4.28/4.38	v -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 
4.28/4.38	v -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 x280 -x279 -x278 
4.28/4.38	v -x277 -x276 -x275 -x274 -x273 -x272 x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 
4.28/4.38	v -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 
4.28/4.38	v -x235 -x234 -x233 -x232 x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 
4.28/4.38	v -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 
4.28/4.38	v -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 x182 -x181 -x180 -x179 -x178 -x177 -x176 x175 -x174 -x173 
4.28/4.38	v -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 
4.28/4.38	v -x151 -x150 -x149 -x148 x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 
4.28/4.38	v -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 
4.28/4.38	v x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 
4.28/4.38	v -x86 x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 
4.28/4.38	v -x61 -x60 -x59 x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 
4.28/4.38	v -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 
4.28/4.38	v -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1 
4.28/4.38	c SCIP Status        : problem is solved [optimal solution found]
4.28/4.38	c Solving Time       :       4.08
4.28/4.38	c Original Problem   :
4.28/4.38	c   Problem name     : HOME/instance-1884868-1245260565.opb
4.28/4.38	c   Variables        : 550 (550 binary, 0 integer, 0 implicit integer, 0 continuous)
4.28/4.38	c   Constraints      : 12397 initial, 12397 maximal
4.28/4.38	c Presolved Problem  :
4.28/4.38	c   Problem name     : t_HOME/instance-1884868-1245260565.opb
4.28/4.38	c   Variables        : 550 (550 binary, 0 integer, 0 implicit integer, 0 continuous)
4.28/4.38	c   Constraints      : 12397 initial, 12397 maximal
4.28/4.38	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
4.28/4.38	c   trivial          :       0.00          0          0          0          0          0          0          0          0
4.28/4.38	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
4.28/4.38	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
4.28/4.38	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
4.28/4.38	c   implics          :       0.00          0          0          0          0          0          0          0          0
4.28/4.38	c   probing          :       0.00          0          0          0          0          0          0          0          0
4.28/4.38	c   logicor          :       0.04          0          0          0          0          0          0          0          0
4.28/4.38	c   root node        :          -          0          -          -          0          -          -          -          -
4.28/4.38	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
4.28/4.38	c   integral         :          0          0          0          1          0          0          0          0          0          2
4.28/4.38	c   logicor          :      12397          5        114          0          1          0        211          0          0          0
4.28/4.38	c   countsols        :          0          0          0          0          1          0          0          0          0          0
4.28/4.38	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
4.28/4.38	c   integral         :       0.37       0.00       0.00       0.37       0.00
4.28/4.38	c   logicor          :       0.02       0.01       0.01       0.00       0.00
4.28/4.38	c   countsols        :       0.00       0.00       0.00       0.00       0.00
4.28/4.38	c Propagators        :       Time      Calls    Cutoffs    DomReds
4.28/4.38	c   rootredcost      :       0.00          0          0          0
4.28/4.38	c   pseudoobj        :       0.00        381          0          0
4.28/4.38	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
4.28/4.38	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
4.28/4.38	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
4.28/4.38	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
4.28/4.38	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
4.28/4.38	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
4.28/4.38	c   applied globally :          -          -          -          0        0.0          -          -          -
4.28/4.38	c   applied locally  :          -          -          -          0        0.0          -          -          -
4.28/4.38	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
4.28/4.38	c   cut pool         :       0.00          4          -          -          1          -    (maximal pool size: 160)
4.28/4.38	c   redcost          :       0.00          5          0          0          0          0
4.28/4.38	c   impliedbounds    :       0.00          5          0          0          0          0
4.28/4.38	c   intobj           :       0.00          0          0          0          0          0
4.28/4.38	c   gomory           :       0.97          5          0          0       1916          0
4.28/4.38	c   strongcg         :       0.88          5          0          0       2267          0
4.28/4.38	c   cmir             :       0.00          0          0          0          0          0
4.28/4.38	c   flowcover        :       0.00          0          0          0          0          0
4.28/4.38	c   clique           :       0.01          5          0          0         16          0
4.28/4.38	c   zerohalf         :       0.00          0          0          0          0          0
4.28/4.38	c   mcf              :       0.01          1          0          0          0          0
4.28/4.38	c Pricers            :       Time      Calls       Vars
4.28/4.38	c   problem variables:       0.00          0          0
4.28/4.38	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
4.28/4.38	c   relpscost        :       0.37          1          0          0          0          0          2
4.28/4.38	c   pscost           :       0.00          0          0          0          0          0          0
4.28/4.38	c   inference        :       0.03        338          0          0          0          0        676
4.28/4.38	c   mostinf          :       0.00          0          0          0          0          0          0
4.28/4.38	c   leastinf         :       0.00          0          0          0          0          0          0
4.28/4.38	c   fullstrong       :       0.00          0          0          0          0          0          0
4.28/4.38	c   allfullstrong    :       0.00          0          0          0          0          0          0
4.28/4.38	c   random           :       0.00          0          0          0          0          0          0
4.28/4.38	c Primal Heuristics  :       Time      Calls      Found
4.28/4.38	c   LP solutions     :       0.00          -          0
4.28/4.38	c   pseudo solutions :       0.00          -          1
4.28/4.38	c   simplerounding   :       0.00          0          0
4.28/4.38	c   rounding         :       0.00          0          0
4.28/4.38	c   shifting         :       0.00          0          0
4.28/4.38	c   intshifting      :       0.00          0          0
4.28/4.38	c   oneopt           :       0.00          0          0
4.28/4.38	c   fixandinfer      :       0.00          0          0
4.28/4.38	c   feaspump         :       0.00          0          0
4.28/4.38	c   coefdiving       :       0.00          0          0
4.28/4.38	c   pscostdiving     :       0.00          0          0
4.28/4.38	c   fracdiving       :       0.00          0          0
4.28/4.38	c   veclendiving     :       0.00          0          0
4.28/4.38	c   intdiving        :       0.00          0          0
4.28/4.38	c   actconsdiving    :       0.00          0          0
4.28/4.38	c   objpscostdiving  :       0.00          0          0
4.28/4.38	c   rootsoldiving    :       0.00          0          0
4.28/4.38	c   linesearchdiving :       0.00          0          0
4.28/4.38	c   guideddiving     :       0.00          0          0
4.28/4.38	c   octane           :       0.00          0          0
4.28/4.38	c   rens             :       0.00          0          0
4.28/4.38	c   rins             :       0.00          0          0
4.28/4.38	c   localbranching   :       0.00          0          0
4.28/4.38	c   mutation         :       0.00          0          0
4.28/4.38	c   crossover        :       0.00          0          0
4.28/4.38	c   dins             :       0.00          0          0
4.28/4.38	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
4.28/4.38	c   primal LP        :       0.01          0          0       0.00       0.00
4.28/4.38	c   dual LP          :       1.52          6       1188     198.00     781.58
4.28/4.38	c   barrier LP       :       0.00          0          0       0.00          -
4.28/4.38	c   diving/probing LP:       0.00          0          0       0.00          -
4.28/4.38	c   strong branching :       0.37         10        192      19.20     518.92
4.28/4.38	c     (at root node) :          -         10        192      19.20          -
4.28/4.38	c   conflict analysis:       0.00          0          0       0.00          -
4.28/4.38	c B&B Tree           :
4.28/4.38	c   number of runs   :          1
4.28/4.38	c   nodes            :        340
4.28/4.38	c   nodes (total)    :        340
4.28/4.38	c   nodes left       :          0
4.28/4.38	c   max depth        :        339
4.28/4.38	c   max depth (total):        339
4.28/4.38	c   backtracks       :          0 (0.0%)
4.28/4.38	c   delayed cutoffs  :          0
4.28/4.38	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
4.28/4.38	c   avg switch length:       2.00
4.28/4.38	c   switching time   :       0.01
4.28/4.38	c Solution           :
4.28/4.38	c   Solutions found  :          1 (1 improvements)
4.28/4.38	c   Primal Bound     : +2.20000000000000e+01   (in run 1, after 340 nodes, 4.07 seconds, depth 339, found by <relaxation>)
4.28/4.38	c   Dual Bound       : +2.20000000000000e+01
4.28/4.38	c   Gap              :       0.00 %
4.28/4.38	c   Root Dual Bound  : +2.20000000000000e+01
4.39/4.42	c Time complete: 4.41.

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-1884868-1245260565/watcher-1884868-1245260565 -o /tmp/evaluation-result-1884868-1245260565/solver-1884868-1245260565 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1884868-1245260565.opb 

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.99 0.97 0.91 3/64 12712
/proc/meminfo: memFree=1836264/2055920 swapFree=4181884/4192956
[pid=12712] ppid=12710 vsize=5812 CPUtime=0
/proc/12712/stat : 12712 (pbscip.linux.x8) R 12710 12712 11599 0 -1 4194304 518 0 0 0 0 0 0 0 18 0 1 0 193653341 5951488 502 1992294400 4194304 9342243 548682068736 18446744073709551615 8223232 0 0 4096 0 0 0 0 17 1 0 0
/proc/12712/statm: 1453 508 337 1256 0 192 0

[startup+0.024599 s]
/proc/loadavg: 0.99 0.97 0.91 3/64 12712
/proc/meminfo: memFree=1836264/2055920 swapFree=4181884/4192956
[pid=12712] ppid=12710 vsize=11088 CPUtime=0.01
/proc/12712/stat : 12712 (pbscip.linux.x8) R 12710 12712 11599 0 -1 4194304 1735 0 0 0 1 0 0 0 18 0 1 0 193653341 11354112 1719 1992294400 4194304 9342243 548682068736 18446744073709551615 8247753 0 0 4096 0 0 0 0 17 1 0 0
/proc/12712/statm: 2772 1719 376 1256 0 1511 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 11088

[startup+0.101608 s]
/proc/loadavg: 0.99 0.97 0.91 3/64 12712
/proc/meminfo: memFree=1836264/2055920 swapFree=4181884/4192956
[pid=12712] ppid=12710 vsize=13912 CPUtime=0.09
/proc/12712/stat : 12712 (pbscip.linux.x8) R 12710 12712 11599 0 -1 4194304 2451 0 0 0 8 1 0 0 18 0 1 0 193653341 14245888 2435 1992294400 4194304 9342243 548682068736 18446744073709551615 8235731 0 0 4096 0 0 0 0 17 1 0 0
/proc/12712/statm: 3478 2435 376 1256 0 2217 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 13912

[startup+0.30163 s]
/proc/loadavg: 0.99 0.97 0.91 3/64 12712
/proc/meminfo: memFree=1836264/2055920 swapFree=4181884/4192956
[pid=12712] ppid=12710 vsize=31572 CPUtime=0.29
/proc/12712/stat : 12712 (pbscip.linux.x8) R 12710 12712 11599 0 -1 4194304 6999 0 0 0 26 3 0 0 19 0 1 0 193653341 32329728 6629 1992294400 4194304 9342243 548682068736 18446744073709551615 5858006 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12712/statm: 7893 6638 463 1256 0 6632 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 31572

[startup+0.701673 s]
/proc/loadavg: 0.99 0.97 0.91 3/64 12712
/proc/meminfo: memFree=1836264/2055920 swapFree=4181884/4192956
[pid=12712] ppid=12710 vsize=49316 CPUtime=0.69
/proc/12712/stat : 12712 (pbscip.linux.x8) R 12710 12712 11599 0 -1 4194304 10826 0 0 0 62 7 0 0 18 0 1 0 193653341 50499584 10347 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12712/statm: 12329 10347 629 1256 0 11068 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 49316

[startup+1.50176 s]
/proc/loadavg: 0.99 0.97 0.91 2/65 12713
/proc/meminfo: memFree=1793120/2055920 swapFree=4181884/4192956
[pid=12712] ppid=12710 vsize=54372 CPUtime=1.49
/proc/12712/stat : 12712 (pbscip.linux.x8) R 12710 12712 11599 0 -1 4194304 12335 0 0 0 141 8 0 0 25 0 1 0 193653341 55676928 11855 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12712/statm: 13593 11855 634 1256 0 12332 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 54372

[startup+3.10194 s]
/proc/loadavg: 0.99 0.97 0.91 2/65 12713
/proc/meminfo: memFree=1790496/2055920 swapFree=4181884/4192956
[pid=12712] ppid=12710 vsize=56452 CPUtime=3.09
/proc/12712/stat : 12712 (pbscip.linux.x8) R 12710 12712 11599 0 -1 4194304 12848 0 0 0 300 9 0 0 25 0 1 0 193653341 57806848 12011 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12712/statm: 14113 12011 634 1256 0 12852 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 56452

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

[startup+3.90203 s]
/proc/loadavg: 0.99 0.97 0.91 2/65 12713
/proc/meminfo: memFree=1790432/2055920 swapFree=4181884/4192956
[pid=12712] ppid=12710 vsize=58184 CPUtime=3.89
/proc/12712/stat : 12712 (pbscip.linux.x8) R 12710 12712 11599 0 -1 4194304 13232 0 0 0 379 10 0 0 25 0 1 0 193653341 59580416 12395 1992294400 4194304 9342243 548682068736 18446744073709551615 6970108 0 0 4096 16384 0 0 0 17 0 0 0
/proc/12712/statm: 14546 12395 634 1256 0 13285 0
Current children cumulated CPU time (s) 3.89
Current children cumulated vsize (KiB) 58184

[startup+4.30208 s]
/proc/loadavg: 0.99 0.97 0.91 2/65 12713
/proc/meminfo: memFree=1787040/2055920 swapFree=4181884/4192956
[pid=12712] ppid=12710 vsize=66752 CPUtime=4.28
/proc/12712/stat : 12712 (pbscip.linux.x8) R 12710 12712 11599 0 -1 4194304 16104 0 0 0 417 11 0 0 25 0 1 0 193653341 68354048 12833 1992294400 4194304 9342243 548682068736 18446744073709551615 5874747 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12712/statm: 16688 12833 639 1256 0 15427 0
Current children cumulated CPU time (s) 4.28
Current children cumulated vsize (KiB) 66752

[startup+4.40608 s]
/proc/loadavg: 0.99 0.97 0.91 2/65 12713
/proc/meminfo: memFree=1787040/2055920 swapFree=4181884/4192956
[pid=12712] ppid=12710 vsize=58672 CPUtime=4.39
/proc/12712/stat : 12712 (pbscip.linux.x8) R 12710 12712 11599 0 -1 4194304 16261 0 0 0 427 12 0 0 17 0 1 0 193653341 60080128 12723 1992294400 4194304 9342243 548682068736 18446744073709551615 5855084 0 0 4096 0 0 0 0 17 1 0 0
/proc/12712/statm: 14668 12723 663 1256 0 13407 0
Current children cumulated CPU time (s) 4.39
Current children cumulated vsize (KiB) 58672

Child status: 0
Real time (s): 4.42929
CPU time (s): 4.41833
CPU user time (s): 4.28735
CPU system time (s): 0.13098
CPU usage (%): 99.7526
Max. virtual memory (cumulated for all children) (KiB): 66852

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 4.28735
system time used= 0.13098
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 16267
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= 10
involuntary context switches= 16

runsolver used 0.007998 second user time and 0.021996 second system time

The end

Launcher Data 

Begin job on node42 at 2009-06-17 19:42:45
IDJOB=1884868
IDBENCH=72000
IDSOLVER=684
FILE ID=node42/1884868-1245260565
PBS_JOBID= 9372411
Free space on /tmp= 66148 MiB

SOLVER NAME= SCIPclp SCIP 1.1.0.7 with CLP 1.8.2
BENCH NAME= PB09/normalized-PB09/PURE-SAT/SAT09/CRAFTED/sgi/satsgi-n22himBHm25-p0-q229.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t TIMEOUT -m MEMLIMIT -f BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-1884868-1245260565/watcher-1884868-1245260565 -o /tmp/evaluation-result-1884868-1245260565/solver-1884868-1245260565 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1884868-1245260565.opb

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

MD5SUM BENCH= a7f6d091d2a72c2403551174062eb6f8
RANDOM SEED=30642386

node42.alineos.net Linux 2.6.9-22.EL.rootsmp #1 SMP Mon Oct 3 08:59:52 CEST 2005

/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.214
cache size	: 2048 KB
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 pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5914.62
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.214
cache size	: 2048 KB
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 pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5586.94
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2055920 kB
MemFree:       1836680 kB
Buffers:         33916 kB
Cached:         103592 kB
SwapCached:       5156 kB
Active:          75468 kB
Inactive:        70204 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1836680 kB
SwapTotal:     4192956 kB
SwapFree:      4181884 kB
Dirty:           12372 kB
Writeback:           0 kB
Mapped:          14356 kB
Slab:            59588 kB
Committed_AS:   203660 kB
PageTables:       1392 kB
VmallocTotal: 536870911 kB
VmallocUsed:    264952 kB
VmallocChunk: 536605679 kB
HugePages_Total:     0
HugePages_Free:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 66136 MiB
End job on node42 at 2009-06-17 19:42:50