Trace number 1884838

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 5.73013 5.73119

General information on the benchmark

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

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-1884838-1245260543/watcher-1884838-1245260543 -o /tmp/evaluation-result-1884838-1245260543/solver-1884838-1245260543 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1884838-1245260543.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: 1.00 1.00 0.93 3/64 24177
/proc/meminfo: memFree=1797096/2055920 swapFree=4192044/4192956
[pid=24177] ppid=24175 vsize=5816 CPUtime=0
/proc/24177/stat : 24177 (pbscip.linux.x8) R 24175 24177 23374 0 -1 4194304 536 0 0 0 0 0 0 0 18 0 1 0 78763068 5955584 520 1992294400 4194304 9342243 548682068736 18446744073709551615 8206432 0 0 4096 0 0 0 0 17 1 0 0
/proc/24177/statm: 1454 524 351 1256 0 193 0

[startup+0.0362629 s]
/proc/loadavg: 1.00 1.00 0.93 3/64 24177
/proc/meminfo: memFree=1797096/2055920 swapFree=4192044/4192956
[pid=24177] ppid=24175 vsize=11464 CPUtime=0.02
/proc/24177/stat : 24177 (pbscip.linux.x8) R 24175 24177 23374 0 -1 4194304 1850 0 0 0 2 0 0 0 18 0 1 0 78763068 11739136 1834 1992294400 4194304 9342243 548682068736 18446744073709551615 7635775 0 0 4096 0 0 0 0 17 1 0 0
/proc/24177/statm: 2866 1834 376 1256 0 1605 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 11464

[startup+0.101268 s]
/proc/loadavg: 1.00 1.00 0.93 3/64 24177
/proc/meminfo: memFree=1797096/2055920 swapFree=4192044/4192956
[pid=24177] ppid=24175 vsize=13908 CPUtime=0.09
/proc/24177/stat : 24177 (pbscip.linux.x8) R 24175 24177 23374 0 -1 4194304 2450 0 0 0 9 0 0 0 18 0 1 0 78763068 14241792 2434 1992294400 4194304 9342243 548682068736 18446744073709551615 7635775 0 0 4096 0 0 0 0 17 1 0 0
/proc/24177/statm: 3477 2434 376 1256 0 2216 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 13908

[startup+0.301286 s]
/proc/loadavg: 1.00 1.00 0.93 3/64 24177
/proc/meminfo: memFree=1797096/2055920 swapFree=4192044/4192956
[pid=24177] ppid=24175 vsize=30540 CPUtime=0.29
/proc/24177/stat : 24177 (pbscip.linux.x8) R 24175 24177 23374 0 -1 4194304 6779 0 0 0 26 3 0 0 19 0 1 0 78763068 31272960 6409 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/24177/statm: 7635 6409 462 1256 0 6374 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 30540

[startup+0.70132 s]
/proc/loadavg: 1.00 1.00 0.93 3/64 24177
/proc/meminfo: memFree=1797096/2055920 swapFree=4192044/4192956
[pid=24177] ppid=24175 vsize=52312 CPUtime=0.69
/proc/24177/stat : 24177 (pbscip.linux.x8) R 24175 24177 23374 0 -1 4194304 11464 0 0 0 62 7 0 0 18 0 1 0 78763068 53567488 10990 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/24177/statm: 13078 10990 616 1256 0 11817 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 52312

[startup+1.50239 s]
/proc/loadavg: 1.00 1.00 0.93 2/65 24178
/proc/meminfo: memFree=1753632/2055920 swapFree=4192044/4192956
[pid=24177] ppid=24175 vsize=53648 CPUtime=1.49
/proc/24177/stat : 24177 (pbscip.linux.x8) R 24175 24177 23374 0 -1 4194304 12256 0 0 0 140 9 0 0 25 0 1 0 78763068 54935552 11782 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/24177/statm: 13412 11782 634 1256 0 12151 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 53648

[startup+3.10153 s]
/proc/loadavg: 1.00 1.00 0.93 2/65 24178
/proc/meminfo: memFree=1751264/2055920 swapFree=4192044/4192956
[pid=24177] ppid=24175 vsize=66692 CPUtime=3.09
/proc/24177/stat : 24177 (pbscip.linux.x8) R 24175 24177 23374 0 -1 4194304 13912 0 0 0 297 12 0 0 25 0 1 0 78763068 68292608 13170 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/24177/statm: 16673 13170 639 1256 0 15412 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 66692

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

[startup+4.70168 s]
/proc/loadavg: 1.00 1.00 0.93 2/65 24178
/proc/meminfo: memFree=1746656/2055920 swapFree=4192044/4192956
[pid=24177] ppid=24175 vsize=66692 CPUtime=4.69
/proc/24177/stat : 24177 (pbscip.linux.x8) R 24175 24177 23374 0 -1 4194304 18287 0 0 0 455 14 0 0 25 0 1 0 78763068 68292608 13177 1992294400 4194304 9342243 548682068736 18446744073709551615 6978074 0 0 4096 16384 0 0 0 17 1 0 0
/proc/24177/statm: 16673 13177 639 1256 0 15412 0
Current children cumulated CPU time (s) 4.69
Current children cumulated vsize (KiB) 66692

[startup+5.50574 s]
/proc/loadavg: 1.00 1.00 0.93 2/65 24178
/proc/meminfo: memFree=1746592/2055920 swapFree=4192044/4192956
[pid=24177] ppid=24175 vsize=66692 CPUtime=5.5
/proc/24177/stat : 24177 (pbscip.linux.x8) R 24175 24177 23374 0 -1 4194304 19305 0 0 0 533 17 0 0 25 0 1 0 78763068 68292608 13188 1992294400 4194304 9342243 548682068736 18446744073709551615 6040633 0 0 4096 16384 0 0 0 17 1 0 0
/proc/24177/statm: 16673 13188 639 1256 0 15412 0
Current children cumulated CPU time (s) 5.5
Current children cumulated vsize (KiB) 66692

[startup+5.70176 s]
/proc/loadavg: 1.00 1.00 0.93 2/65 24178
/proc/meminfo: memFree=1746592/2055920 swapFree=4192044/4192956
[pid=24177] ppid=24175 vsize=58768 CPUtime=5.69
/proc/24177/stat : 24177 (pbscip.linux.x8) R 24175 24177 23374 0 -1 4194304 19584 0 0 0 552 17 0 0 16 0 1 0 78763068 60178432 13131 1992294400 4194304 9342243 548682068736 18446744073709551615 4802948 0 0 4096 0 0 0 0 17 1 0 0
/proc/24177/statm: 14692 13131 663 1256 0 13431 0
Current children cumulated CPU time (s) 5.69
Current children cumulated vsize (KiB) 58768

Child status: 0
Real time (s): 5.73119
CPU time (s): 5.73013
CPU user time (s): 5.54416
CPU system time (s): 0.185971
CPU usage (%): 99.9815
Max. virtual memory (cumulated for all children) (KiB): 66860

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 5.54416
system time used= 0.185971
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 19590
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= 9
involuntary context switches= 8

runsolver used 0.006998 second user time and 0.023996 second system time

The end

Launcher Data 

Begin job on node41 at 2009-06-17 19:42:23
IDJOB=1884838
IDBENCH=71997
IDSOLVER=684
FILE ID=node41/1884838-1245260543
PBS_JOBID= 9372412
Free space on /tmp= 65960 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-n23himBHm26-p0-q248.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-1884838-1245260543/watcher-1884838-1245260543 -o /tmp/evaluation-result-1884838-1245260543/solver-1884838-1245260543 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1884838-1245260543.opb

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

MD5SUM BENCH= 85f698c77076e806c90c98e067b48774
RANDOM SEED=735554546

node41.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.216
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.216
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:       1797512 kB
Buffers:         43692 kB
Cached:         132828 kB
SwapCached:        416 kB
Active:          82488 kB
Inactive:       106936 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1797512 kB
SwapTotal:     4192956 kB
SwapFree:      4192044 kB
Dirty:           12592 kB
Writeback:           0 kB
Mapped:          22048 kB
Slab:            54992 kB
Committed_AS:    83504 kB
PageTables:       1360 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= 65952 MiB
End job on node41 at 2009-06-17 19:42:29