| Solver Name | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 | OPT | 4 | 0.010998 | 0.019315 |
| Name | /OPT-SMALLINT-LIN/leberre/opb-paranoid/misc2010/ datasets/caixa/normalized-1078.cudf.paranoid.opb |
| MD5SUM | d3cb40e64da09a9f9eab8c3d1f771dee |
| Bench Category | OPT-SMALLINT-LIN (optimisation, small integers, linear constraints) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 4 |
| Best CPU time to get the best result obtained on this benchmark | 0 |
| Has Objective Function | YES |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 9 |
| Total number of constraints | 17 |
| Number of constraints which are clauses | 17 |
| 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 | 1 |
| Maximum length of a constraint | 2 |
| Number of terms in the objective function | 4 |
| 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 | 4 |
| Number of bits of the sum of numbers in the objective function | 3 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 4 |
| Number of bits of the biggest sum of numbers | 3 |
| 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 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3453405-1307116290.opb>
0.00/0.00 c original problem has 9 variables (9 bin, 0 int, 0 impl, 0 cont) and 17 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 o 4
0.00/0.00 c feasible solution found by trivial heuristic, objective value 4.000000e+00
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 6 del vars, 10 del conss, 0 add conss, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 24 impls, 0 clqs
0.00/0.00 c (round 2) 8 del vars, 14 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 24 impls, 0 clqs
0.00/0.00 c presolving (3 rounds):
0.00/0.00 c 9 deleted vars, 17 deleted constraints, 0 added constraints, 5 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.00 c 24 implications, 0 cliques
0.00/0.00 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
0.00/0.00 c transformed objective value is always integral (scale: 1)
0.00/0.00 c Presolving Time: 0.00
0.00/0.00 c - non default parameters ----------------------------------------------------------------------
0.00/0.00 c # SCIP version 2.0.1.4
0.00/0.00 c
0.00/0.00 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.00 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.00 c conflict/interconss = 0
0.00/0.00 c
0.00/0.00 c # should binary conflicts be preferred?
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c conflict/preferbinary = TRUE
0.00/0.00 c
0.00/0.00 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.00 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.00 c constraints/agelimit = 1
0.00/0.00 c
0.00/0.00 c # should enforcement of pseudo solution be disabled?
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c constraints/disableenfops = TRUE
0.00/0.00 c
0.00/0.00 c # frequency for displaying node information lines
0.00/0.00 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.00 c display/freq = 10000
0.00/0.00 c
0.00/0.00 c # maximal time in seconds to run
0.00/0.00 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.00 c limits/time = 1800
0.00/0.00 c
0.00/0.00 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.00 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.00 c limits/memory = 13950
0.00/0.00 c
0.00/0.00 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.00 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.00 c lp/solvefreq = 0
0.00/0.00 c
0.00/0.00 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.00/0.00 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.00 c lp/pricing = a
0.00/0.00 c
0.00/0.00 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.00 c # [type: int, range: [1,2], default: 1]
0.00/0.00 c timing/clocktype = 2
0.00/0.00 c
0.00/0.00 c # belongs reading time to solving time?
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c timing/reading = TRUE
0.00/0.00 c
0.00/0.00 c # should presolving try to simplify inequalities
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c constraints/linear/simplifyinequalities = TRUE
0.00/0.00 c
0.00/0.00 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c constraints/indicator/addCouplingCons = TRUE
0.00/0.00 c
0.00/0.00 c # should presolving try to simplify knapsacks
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.00 c
0.00/0.00 c # priority of node selection rule <dfs> in standard mode
0.00/0.00 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.00 c nodeselection/dfs/stdpriority = 1000000
0.00/0.00 c
0.00/0.00 c -----------------------------------------------------------------------------------------------
0.00/0.00 c start solving
0.00/0.00 c
0.00/0.00 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.00 c t 0.0s| 1 | 0 | 0 | - | 132k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 4.000000e+00 | 4.000000e+00 | 0.00%
0.00/0.00 c
0.00/0.00 c SCIP Status : problem is solved [optimal solution found]
0.00/0.00 c Solving Time (sec) : 0.00
0.00/0.00 c Solving Nodes : 1
0.00/0.00 c Primal Bound : +4.00000000000000e+00 (1 solutions)
0.00/0.00 c Dual Bound : +4.00000000000000e+00
0.00/0.00 c Gap : 0.00 %
0.00/0.00 s OPTIMUM FOUND
0.00/0.00 v x5 x4 x3 x2 x1 x9 x8 x7 x6
0.00/0.00 c SCIP Status : problem is solved [optimal solution found]
0.00/0.00 c Total Time : 0.00
0.00/0.00 c solving : 0.00
0.00/0.00 c presolving : 0.00 (included in solving)
0.00/0.00 c reading : 0.00 (included in solving)
0.00/0.00 c Original Problem :
0.00/0.00 c Problem name : HOME/instance-3453405-1307116290.opb
0.00/0.00 c Variables : 9 (9 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.00 c Constraints : 17 initial, 17 maximal
0.00/0.00 c Presolved Problem :
0.00/0.00 c Problem name : t_HOME/instance-3453405-1307116290.opb
0.00/0.00 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.00 c Constraints : 0 initial, 0 maximal
0.00/0.00 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.00 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c linear : 0.00 5 4 0 5 0 17 0 0 0
0.00/0.00 c root node : - 0 - - 0 - - - - -
0.00/0.00 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.00 c integral : 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.00 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.00 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.00 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.00 c pseudoobj : 0 0 0 0
0.00/0.00 c rootredcost : 0 0 0 0
0.00/0.00 c vbounds : 0 0 0 0
0.00/0.00 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.00 c pseudoobj : 0.00 0.00 0.00
0.00/0.00 c rootredcost : 0.00 0.00 0.00
0.00/0.00 c vbounds : 0.00 0.00 0.00
0.00/0.00 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.00 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.00 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.00 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.00 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.00 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
0.00/0.00 c applied globally : - - - 0 0.0 - - -
0.00/0.00 c applied locally : - - - 0 0.0 - - -
0.00/0.00 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.00 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.00 c redcost : 0.00 0 0 0 0 0
0.00/0.00 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.00 c intobj : 0.00 0 0 0 0 0
0.00/0.00 c gomory : 0.00 0 0 0 0 0
0.00/0.00 c cgmip : 0.00 0 0 0 0 0
0.00/0.00 c closecuts : 0.00 0 0 0 0 0
0.00/0.00 c strongcg : 0.00 0 0 0 0 0
0.00/0.00 c cmir : 0.00 0 0 0 0 0
0.00/0.00 c flowcover : 0.00 0 0 0 0 0
0.00/0.00 c clique : 0.00 0 0 0 0 0
0.00/0.00 c zerohalf : 0.00 0 0 0 0 0
0.00/0.00 c mcf : 0.00 0 0 0 0 0
0.00/0.00 c oddcycle : 0.00 0 0 0 0 0
0.00/0.00 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.00 c Pricers : Time Calls Vars
0.00/0.00 c problem variables: 0.00 0 0
0.00/0.00 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.00 c pscost : 0.00 0 0 0 0 0 0
0.00/0.00 c inference : 0.00 0 0 0 0 0 0
0.00/0.00 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.00 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.00 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.00 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.00 c random : 0.00 0 0 0 0 0 0
0.00/0.00 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.00 c Primal Heuristics : Time Calls Found
0.00/0.00 c LP solutions : 0.00 - 0
0.00/0.00 c pseudo solutions : 0.00 - 0
0.00/0.00 c oneopt : 0.00 0 0
0.00/0.00 c trivial : 0.00 1 1
0.00/0.00 c shiftandpropagate: 0.00 0 0
0.00/0.00 c simplerounding : 0.00 0 0
0.00/0.00 c zirounding : 0.00 0 0
0.00/0.00 c rounding : 0.00 0 0
0.00/0.00 c shifting : 0.00 0 0
0.00/0.00 c intshifting : 0.00 0 0
0.00/0.00 c twoopt : 0.00 0 0
0.00/0.00 c fixandinfer : 0.00 0 0
0.00/0.00 c feaspump : 0.00 0 0
0.00/0.00 c clique : 0.00 0 0
0.00/0.00 c coefdiving : 0.00 0 0
0.00/0.00 c pscostdiving : 0.00 0 0
0.00/0.00 c fracdiving : 0.00 0 0
0.00/0.00 c veclendiving : 0.00 0 0
0.00/0.00 c intdiving : 0.00 0 0
0.00/0.00 c actconsdiving : 0.00 0 0
0.00/0.00 c objpscostdiving : 0.00 0 0
0.00/0.00 c rootsoldiving : 0.00 0 0
0.00/0.00 c linesearchdiving : 0.00 0 0
0.00/0.00 c guideddiving : 0.00 0 0
0.00/0.00 c octane : 0.00 0 0
0.00/0.00 c rens : 0.00 0 0
0.00/0.00 c rins : 0.00 0 0
0.00/0.00 c localbranching : 0.00 0 0
0.00/0.00 c mutation : 0.00 0 0
0.00/0.00 c crossover : 0.00 0 0
0.00/0.00 c dins : 0.00 0 0
0.00/0.00 c vbounds : 0.00 0 0
0.00/0.00 c undercover : 0.00 0 0
0.00/0.00 c subnlp : 0.00 0 0
0.00/0.00 c trysol : 0.00 0 0
0.00/0.00 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.00 c primal LP : 0.00 0 0 0.00 -
0.00/0.00 c dual LP : 0.00 0 0 0.00 -
0.00/0.00 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.00 c barrier LP : 0.00 0 0 0.00 -
0.00/0.00 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.00 c strong branching : 0.00 0 0 0.00 -
0.00/0.00 c (at root node) : - 0 0 0.00 -
0.00/0.00 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.00 c B&B Tree :
0.00/0.00 c number of runs : 1
0.00/0.00 c nodes : 1
0.00/0.00 c nodes (total) : 1
0.00/0.00 c nodes left : 0
0.00/0.00 c max depth : 0
0.00/0.00 c max depth (total): 0
0.00/0.00 c backtracks : 0 (0.0%)
0.00/0.00 c delayed cutoffs : 0
0.00/0.00 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.00 c avg switch length: 2.00
0.00/0.00 c switching time : 0.00
0.00/0.00 c Solution :
0.00/0.00 c Solutions found : 1 (1 improvements)
0.00/0.00 c First Solution : +4.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.00 c Primal Bound : +4.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.00 c Dual Bound : +4.00000000000000e+00
0.00/0.00 c Gap : 0.00 %
0.00/0.00 c Root Dual Bound : +4.00000000000000e+00
0.00/0.00 c Root Iterations : 0
0.00/0.01 c Time complete: 0.
OK 4
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL This is runsolver version 3.3.0 (svn: 977) This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3453405-1307116290/watcher-3453405-1307116290 -o /tmp/evaluation-result-3453405-1307116290/solver-3453405-1307116290 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453405-1307116290.opb -t 1800 -m 15500 running on 4 cores: 0,2,4,6 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): 1900 seconds Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB Current StackSize limit: 10240 KiB [startup+0 s] /proc/loadavg: 2.00 2.02 2.00 2/514 7365 /proc/meminfo: memFree=18997880/32950940 swapFree=67111364/67111528 [pid=7365] ppid=7363 vsize=15896 CPUtime=0 cores=0,2,4,6 /proc/7365/stat : 7365 (scip-2.0.1.4.li) R 7363 7365 4622 0 -1 4202496 2727 0 0 0 0 0 0 0 25 0 1 0 901859814 16277504 2680 33554432000 4194304 9128323 140735565741664 18446744073709551615 8009021 0 0 4096 16384 0 0 0 17 2 0 0 0 /proc/7365/statm: 3974 2692 523 1205 0 2765 0 Solver just ended. Dumping a history of the last processes samples Child status: 0 Real time (s): 0.019315 CPU time (s): 0.010998 CPU user time (s): 0.004999 CPU system time (s): 0.005999 CPU usage (%): 56.9403 Max. virtual memory (cumulated for all children) (KiB): 0 getrusage(RUSAGE_CHILDREN,...) data: user time used= 0.004999 system time used= 0.005999 maximum resident set size= 0 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 3073 page faults= 0 swaps= 0 block input operations= 0 block output operations= 0 messages sent= 0 messages received= 0 signals received= 0 voluntary context switches= 3 involuntary context switches= 1 runsolver used 0.002999 second user time and 0.016997 second system time The end
Begin job on node117 at 2011-06-03 17:51:30 IDJOB=3453405 IDBENCH=72137 IDSOLVER=1949 FILE ID=node117/3453405-1307116290 RUNJOBID= node117-1307109834-5829 PBS_JOBID= 13497973 Free space on /tmp= 73612 MiB SOLVER NAME= SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 BENCH NAME= PB10/normalized-PB10/OPT-SMALLINT-LIN/leberre/opb-paranoid/misc2010/datasets/caixa/normalized-1078.cudf.paranoid.opb COMMAND LINE= HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3453405-1307116290/watcher-3453405-1307116290 -o /tmp/evaluation-result-3453405-1307116290/solver-3453405-1307116290 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453405-1307116290.opb -t 1800 -m 15500 TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= d3cb40e64da09a9f9eab8c3d1f771dee RANDOM SEED=1956416398 node117.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 : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.849 cache size : 8192 KB physical id : 0 siblings : 4 core id : 0 cpu cores : 4 apicid : 0 fpu : yes fpu_exception : yes cpuid level : 11 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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm bogomips : 5333.69 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: [8] processor : 1 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.849 cache size : 8192 KB physical id : 1 siblings : 4 core id : 0 cpu cores : 4 apicid : 16 fpu : yes fpu_exception : yes cpuid level : 11 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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm bogomips : 5332.75 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: [8] processor : 2 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.849 cache size : 8192 KB physical id : 0 siblings : 4 core id : 1 cpu cores : 4 apicid : 2 fpu : yes fpu_exception : yes cpuid level : 11 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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm bogomips : 5332.74 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: [8] processor : 3 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.849 cache size : 8192 KB physical id : 1 siblings : 4 core id : 1 cpu cores : 4 apicid : 18 fpu : yes fpu_exception : yes cpuid level : 11 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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm bogomips : 5332.75 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: [8] processor : 4 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.849 cache size : 8192 KB physical id : 0 siblings : 4 core id : 2 cpu cores : 4 apicid : 4 fpu : yes fpu_exception : yes cpuid level : 11 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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm bogomips : 5332.75 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: [8] processor : 5 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.849 cache size : 8192 KB physical id : 1 siblings : 4 core id : 2 cpu cores : 4 apicid : 20 fpu : yes fpu_exception : yes cpuid level : 11 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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm bogomips : 5332.74 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: [8] processor : 6 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.849 cache size : 8192 KB physical id : 0 siblings : 4 core id : 3 cpu cores : 4 apicid : 6 fpu : yes fpu_exception : yes cpuid level : 11 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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm bogomips : 5332.75 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: [8] processor : 7 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.849 cache size : 8192 KB physical id : 1 siblings : 4 core id : 3 cpu cores : 4 apicid : 22 fpu : yes fpu_exception : yes cpuid level : 11 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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm bogomips : 5267.44 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: [8] /proc/meminfo: MemTotal: 32950940 kB MemFree: 18998036 kB Buffers: 366628 kB Cached: 3161808 kB SwapCached: 0 kB Active: 10476864 kB Inactive: 3077964 kB HighTotal: 0 kB HighFree: 0 kB LowTotal: 32950940 kB LowFree: 18998036 kB SwapTotal: 67111528 kB SwapFree: 67111364 kB Dirty: 12068 kB Writeback: 0 kB AnonPages: 10026440 kB Mapped: 44840 kB Slab: 270268 kB PageTables: 58356 kB NFS_Unstable: 0 kB Bounce: 0 kB CommitLimit: 83586996 kB Committed_AS: 149741464 kB VmallocTotal: 34359738367 kB VmallocUsed: 296008 kB VmallocChunk: 34359440975 kB HugePages_Total: 0 HugePages_Free: 0 HugePages_Rsvd: 0 Hugepagesize: 2048 kB Free space on /tmp at the end= 73600 MiB End job on node117 at 2011-06-03 17:51:30