| Solver Name | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|
| SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solver | OPT | 2 | 0.102984 | 0.103687 |
| Name | normalized-PB06/OPT-SMALLINT/submitted-PB06/manquiho/ logic_synthesis/normalized-m100_100_90_90.r.opb |
| MD5SUM | 07065ce8a7e505dddebe786445026dbe |
| Bench Category | OPT-SMALLINT (optimisation, small integers) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 0.072988 |
| Has Objective Function | YES |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | 2 |
| Optimality of the best value was proved | YES |
| Number of variables | 100 |
| Total number of constraints | 100 |
| Number of constraints which are clauses | 100 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 90 |
| Maximum length of a constraint | 90 |
| Number of terms in the objective function | 100 |
| Biggest coefficient in the objective function | 1 |
| Number of bits for the biggest coefficient in the objective function | 1 |
| Sum of the numbers in the objective function | 100 |
| Number of bits of the sum of numbers in the objective function | 7 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 100 |
| Number of bits of the biggest sum of numbers | 7 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2666191-1276591020.opb>
0.01/0.02 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.01/0.02 c problem read
0.01/0.02 c presolving settings loaded
0.01/0.03 o 100
0.01/0.03 c feasible solution found by trivial heuristic, objective value 1.000000e+02
0.01/0.03 c presolving:
0.01/0.04 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 100 upgd conss, 0 impls, 0 clqs
0.01/0.04 c presolving (2 rounds):
0.01/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.04 c 0 implications, 0 cliques
0.01/0.04 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.01/0.04 c 100 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.01
0.01/0.04 c - non default parameters ----------------------------------------------------------------------
0.01/0.04 c # SCIP version 1.2.1.2
0.01/0.04 c
0.01/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c conflict/interconss = 0
0.01/0.04 c
0.01/0.04 c # should binary conflicts be preferred?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c conflict/preferbinary = TRUE
0.01/0.04 c
0.01/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c constraints/agelimit = 1
0.01/0.04 c
0.01/0.04 c # should enforcement of pseudo solution be disabled?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/disableenfops = TRUE
0.01/0.04 c
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = 10000
0.01/0.04 c
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = 1799.98
0.01/0.04 c
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = 1620
0.01/0.04 c
0.01/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c lp/solvefreq = 0
0.01/0.04 c
0.01/0.04 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.01/0.04 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.04 c lp/pricing = a
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # priority of node selection rule <dfs> in standard mode
0.01/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.04 c nodeselection/dfs/stdpriority = 1000000
0.01/0.04 c
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving
0.01/0.05 c
0.01/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.07 c t 0.0s| 1 | 0 | 178 | - |1264k| 0 | 61 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 1.092214e+00 | 1.000000e+02 |9055.71%
0.01/0.07 o 61
0.01/0.07 c r 0.0s| 1 | 0 | 178 | - |1267k| 0 | 61 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 1.092214e+00 | 6.100000e+01 |5484.99%
0.01/0.07 o 60
0.01/0.07 c R 0.0s| 1 | 0 | 178 | - |1269k| 0 | 61 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 1.092214e+00 | 6.000000e+01 |5393.43%
0.01/0.07 o 59
0.01/0.07 c s 0.0s| 1 | 0 | 178 | - |1272k| 0 | 61 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 1.092214e+00 | 5.900000e+01 |5301.87%
0.01/0.09 o 2
0.01/0.09 c z 0.1s| 1 | 0 | 178 | - |1275k| 0 | - | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 1.092214e+00 | 2.000000e+00 | 83.11%
0.01/0.09 c 0.1s| 1 | 0 | 178 | - |1275k| 0 | - | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.01/0.09 c
0.01/0.09 c SCIP Status : problem is solved [optimal solution found]
0.01/0.09 c Solving Time (sec) : 0.05
0.01/0.09 c Solving Nodes : 1
0.01/0.09 c Primal Bound : +2.00000000000000e+00 (7 solutions)
0.01/0.09 c Dual Bound : +2.00000000000000e+00
0.01/0.09 c Gap : 0.00 %
0.01/0.09 s OPTIMUM FOUND
0.01/0.09 v x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75
0.01/0.09 v -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50
0.01/0.09 v -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25
0.01/0.09 v -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 x3 -x2 -x1
0.01/0.09 c SCIP Status : problem is solved [optimal solution found]
0.01/0.09 c Solving Time : 0.05
0.01/0.09 c Original Problem :
0.01/0.09 c Problem name : HOME/instance-2666191-1276591020.opb
0.01/0.09 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.09 c Constraints : 100 initial, 100 maximal
0.01/0.09 c Presolved Problem :
0.01/0.09 c Problem name : t_HOME/instance-2666191-1276591020.opb
0.01/0.09 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.09 c Constraints : 100 initial, 100 maximal
0.01/0.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.01/0.09 c trivial : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c implics : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c probing : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c logicor : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c root node : - 0 - - 0 - - - -
0.01/0.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.01/0.09 c integral : 0 0 0 0 0 0 0 0 0 0
0.01/0.09 c logicor : 100 1 18 0 0 0 0 0 0 0
0.01/0.09 c countsols : 0 0 0 0 0 0 0 0 0 0
0.01/0.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.01/0.09 c integral : 0.00 0.00 0.00 0.00 0.00
0.01/0.09 c logicor : 0.00 0.00 0.00 0.00 0.00
0.01/0.09 c countsols : 0.00 0.00 0.00 0.00 0.00
0.01/0.09 c Propagators : Time Calls Cutoffs DomReds
0.01/0.09 c vbounds : 0.00 2 0 0
0.01/0.09 c rootredcost : 0.00 0 0 0
0.01/0.09 c pseudoobj : 0.00 2 0 0
0.01/0.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.01/0.09 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.01/0.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.01/0.09 c applied globally : - - - 0 0.0 - - -
0.01/0.09 c applied locally : - - - 0 0.0 - - -
0.01/0.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.01/0.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.01/0.09 c redcost : 0.00 1 0 0 0 0
0.01/0.09 c impliedbounds : 0.00 1 0 0 0 0
0.01/0.09 c intobj : 0.00 0 0 0 0 0
0.01/0.09 c cgmip : 0.00 0 0 0 0 0
0.01/0.09 c gomory : 0.00 1 0 0 0 0
0.01/0.09 c strongcg : 0.00 1 0 0 0 0
0.01/0.09 c cmir : 0.01 1 0 0 0 0
0.01/0.09 c flowcover : 0.01 1 0 0 0 0
0.01/0.09 c clique : 0.00 1 0 0 0 0
0.01/0.09 c zerohalf : 0.00 0 0 0 0 0
0.01/0.09 c mcf : 0.00 1 0 0 0 0
0.01/0.09 c rapidlearning : 0.00 0 0 0 0 0
0.01/0.09 c Pricers : Time Calls Vars
0.01/0.09 c problem variables: 0.00 0 0
0.01/0.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.01/0.09 c pscost : 0.00 0 0 0 0 0 0
0.01/0.09 c inference : 0.00 0 0 0 0 0 0
0.01/0.09 c mostinf : 0.00 0 0 0 0 0 0
0.01/0.09 c leastinf : 0.00 0 0 0 0 0 0
0.01/0.09 c fullstrong : 0.00 0 0 0 0 0 0
0.01/0.09 c allfullstrong : 0.00 0 0 0 0 0 0
0.01/0.09 c random : 0.00 0 0 0 0 0 0
0.01/0.09 c relpscost : 0.00 0 0 0 0 0 0
0.01/0.09 c Primal Heuristics : Time Calls Found
0.01/0.09 c LP solutions : 0.00 - 0
0.01/0.09 c pseudo solutions : 0.00 - 0
0.01/0.09 c oneopt : 0.00 0 0
0.01/0.09 c feaspump : 0.00 0 0
0.01/0.09 c rens : 0.00 0 0
0.01/0.09 c crossover : 0.00 0 0
0.01/0.09 c trivial : 0.00 2 3
0.01/0.09 c simplerounding : 0.00 1 1
0.01/0.09 c zirounding : 0.00 1 1
0.01/0.09 c rounding : 0.00 1 1
0.01/0.09 c shifting : 0.00 1 1
0.01/0.09 c intshifting : 0.00 0 0
0.01/0.09 c twoopt : 0.00 0 0
0.01/0.09 c fixandinfer : 0.00 0 0
0.01/0.09 c coefdiving : 0.00 0 0
0.01/0.09 c pscostdiving : 0.00 0 0
0.01/0.09 c fracdiving : 0.00 0 0
0.01/0.09 c veclendiving : 0.00 0 0
0.01/0.09 c intdiving : 0.00 0 0
0.01/0.09 c actconsdiving : 0.00 0 0
0.01/0.09 c objpscostdiving : 0.00 0 0
0.01/0.09 c rootsoldiving : 0.00 0 0
0.01/0.09 c linesearchdiving : 0.00 0 0
0.01/0.09 c guideddiving : 0.00 0 0
0.01/0.09 c octane : 0.00 0 0
0.01/0.09 c rins : 0.00 0 0
0.01/0.09 c localbranching : 0.00 0 0
0.01/0.09 c mutation : 0.00 0 0
0.01/0.09 c dins : 0.00 0 0
0.01/0.09 c undercover : 0.00 0 0
0.01/0.09 c nlp : 0.00 0 0
0.01/0.09 c trysol : 0.00 0 0
0.01/0.09 c LP : Time Calls Iterations Iter/call Iter/sec
0.01/0.09 c primal LP : 0.00 0 0 0.00 -
0.01/0.09 c dual LP : 0.02 1 178 178.00 8900.00
0.01/0.09 c lex dual LP : 0.00 0 0 0.00 -
0.01/0.09 c barrier LP : 0.00 0 0 0.00 -
0.01/0.09 c diving/probing LP: 0.00 0 0 0.00 -
0.01/0.09 c strong branching : 0.00 0 0 0.00 -
0.01/0.09 c (at root node) : - 0 0 0.00 -
0.01/0.09 c conflict analysis: 0.00 0 0 0.00 -
0.01/0.09 c B&B Tree :
0.01/0.09 c number of runs : 1
0.01/0.09 c nodes : 1
0.01/0.09 c nodes (total) : 1
0.01/0.09 c nodes left : 0
0.01/0.09 c max depth : 0
0.01/0.09 c max depth (total): 0
0.01/0.09 c backtracks : 0 (0.0%)
0.01/0.09 c delayed cutoffs : 0
0.01/0.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.01/0.09 c avg switch length: 2.00
0.01/0.09 c switching time : 0.00
0.01/0.09 c Solution :
0.01/0.09 c Solutions found : 7 (5 improvements)
0.01/0.09 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.01/0.09 c Primal Bound : +2.00000000000000e+00 (in run 1, after 1 nodes, 0.05 seconds, depth 0, found by <zirounding>)
0.01/0.09 c Dual Bound : +2.00000000000000e+00
0.01/0.09 c Gap : 0.00 %
0.01/0.09 c Root Dual Bound : +2.00000000000000e+00
0.01/0.09 c Root Iterations : 178
0.09/0.10 c Time complete: 0.09.
OK 2
runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2666191-1276591020/watcher-2666191-1276591020 -o /tmp/evaluation-result-2666191-1276591020/solver-2666191-1276591020 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2666191-1276591020.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: 3.34 2.85 2.10 2/106 2799 /proc/meminfo: memFree=1628596/2059040 swapFree=4192956/4192956 [pid=2799] ppid=2797 vsize=9288 CPUtime=0 /proc/2799/stat : 2799 (pbscip.linux.x8) R 2797 2799 2300 0 -1 4202496 1149 0 0 0 0 0 0 0 25 0 1 0 395552 9510912 1070 1992294400 4194304 9819077 140733357177296 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0 /proc/2799/statm: 2322 1081 371 1374 0 943 0 [startup+0.0207291 s] /proc/loadavg: 3.34 2.85 2.10 2/106 2799 /proc/meminfo: memFree=1628596/2059040 swapFree=4192956/4192956 [pid=2799] ppid=2797 vsize=10848 CPUtime=0.01 /proc/2799/stat : 2799 (pbscip.linux.x8) R 2797 2799 2300 0 -1 4202496 1634 0 0 0 1 0 0 0 25 0 1 0 395552 11108352 1555 1992294400 4194304 9819077 140733357177296 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0 /proc/2799/statm: 2712 1555 388 1374 0 1333 0 Current children cumulated CPU time (s) 0.01 Current children cumulated vsize (KiB) 10848 [startup+0.100737 s] /proc/loadavg: 3.34 2.85 2.10 2/106 2799 /proc/meminfo: memFree=1628596/2059040 swapFree=4192956/4192956 [pid=2799] ppid=2797 vsize=11912 CPUtime=0.09 /proc/2799/stat : 2799 (pbscip.linux.x8) R 2797 2799 2300 0 -1 4202496 4339 0 0 0 8 1 0 0 25 0 1 0 395552 12197888 2131 1992294400 4194304 9819077 140733357177296 18446744073709551615 4333573 0 0 4096 0 0 0 0 17 1 0 0 0 /proc/2799/statm: 2978 2131 671 1374 0 1599 0 Current children cumulated CPU time (s) 0.09 Current children cumulated vsize (KiB) 11912 Solver just ended. Dumping a history of the last processes samples Child status: 0 Real time (s): 0.103687 CPU time (s): 0.102984 CPU user time (s): 0.084987 CPU system time (s): 0.017997 CPU usage (%): 99.322 Max. virtual memory (cumulated for all children) (KiB): 11912 getrusage(RUSAGE_CHILDREN,...) data: user time used= 0.084987 system time used= 0.017997 maximum resident set size= 0 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 4348 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= 2 involuntary context switches= 1 runsolver used 0.005999 second user time and 0.008998 second system time The end
Begin job on node089 at 2010-06-15 10:37:01 IDJOB=2666191 IDBENCH=2847 IDSOLVER=1168 FILE ID=node089/2666191-1276591020 PBS_JOBID= 11173545 Free space on /tmp= 62532 MiB SOLVER NAME= SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solver BENCH NAME= PB06/final/normalized-PB06/OPT-SMALLINT/submitted-PB06/manquiho/logic_synthesis/normalized-m100_100_90_90.r.opb COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.clp -f BENCHNAME -t TIMEOUT -m MEMLIMIT RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2666191-1276591020/watcher-2666191-1276591020 -o /tmp/evaluation-result-2666191-1276591020/solver-2666191-1276591020 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2666191-1276591020.opb -t 1800 -m 1800 TIME LIMIT= 1800 seconds MEMORY LIMIT= 1800 MiB MAX NB THREAD= 0 MD5SUM BENCH= 07065ce8a7e505dddebe786445026dbe RANDOM SEED=1788828510 node089.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.244 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.48 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.244 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 : 5999.47 clflush size : 64 cache_alignment : 128 address sizes : 36 bits physical, 48 bits virtual power management: /proc/meminfo: MemTotal: 2059040 kB MemFree: 1629000 kB Buffers: 18776 kB Cached: 305112 kB SwapCached: 0 kB Active: 128684 kB Inactive: 254476 kB HighTotal: 0 kB HighFree: 0 kB LowTotal: 2059040 kB LowFree: 1629000 kB SwapTotal: 4192956 kB SwapFree: 4192956 kB Dirty: 6544 kB Writeback: 0 kB AnonPages: 59284 kB Mapped: 15624 kB Slab: 25164 kB PageTables: 4008 kB NFS_Unstable: 0 kB Bounce: 0 kB CommitLimit: 5222476 kB Committed_AS: 181684 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= 62528 MiB End job on node089 at 2010-06-15 10:37:01