Trace number 2666665

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 NameAnswerobjective functionCPU timeWall clock time
SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverOPT-6 2.46462 2.46502

General information on the benchmark

Namenormalized-PB07/OPT-SMALLINT-NLC/submittedPB07/
manquinho/mis/normalized-mis_50_25_4.opb
MD5SUM86191362e647705fbaa0ee217c43491b
Bench CategoryOPT-SMALLINT-NLC (optimisation, small integers, non linear constraints)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark-6
Best CPU time to get the best result obtained on this benchmark0.05399
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function -6
Optimality of the best value was proved YES
Number of variables50
Total number of constraints50
Number of constraints which are clauses0
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints50
Minimum length of a constraint25
Maximum length of a constraint37
Number of terms in the objective function 50
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 50
Number of bits of the sum of numbers in the objective function 6
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 50
Number of bits of the biggest sum of numbers6
Number of products (including duplicates)1466
Sum of products size (including duplicates)2932
Number of different products733
Sum of products size1466

Quality of the solution as a function of time


Download the above graph as a PDF file / as an EPS file

Solver Data

0.00/0.00	c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2666665-1276660135.opb>
0.00/0.02	c original problem has 783 variables (783 bin, 0 int, 0 impl, 0 cont) and 783 constraints
0.00/0.02	c problem read
0.00/0.02	c presolving settings loaded
0.00/0.03	o 0
0.00/0.03	c feasible solution found by trivial heuristic, objective value  0.000000e+00
0.00/0.03	c presolving:
0.19/0.22	c (round 1) 733 del vars, 50 del conss, 733 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2932 impls, 0 clqs
0.19/0.24	c presolving (2 rounds):
0.19/0.24	c  733 deleted vars, 50 deleted constraints, 733 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.24	c  4398 implications, 0 cliques
0.19/0.24	c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 733 constraints
0.19/0.24	c     733 constraints of type <logicor>
0.19/0.24	c transformed objective value is always integral (scale: 1)
0.19/0.24	c Presolving Time: 0.11
0.19/0.24	c - non default parameters ----------------------------------------------------------------------
0.19/0.24	c # SCIP version 1.2.1.2
0.19/0.24	c 
0.19/0.24	c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.19/0.24	c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.24	c conflict/interconss = 0
0.19/0.24	c 
0.19/0.24	c # should binary conflicts be preferred?
0.19/0.24	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.24	c conflict/preferbinary = TRUE
0.19/0.24	c 
0.19/0.24	c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.19/0.24	c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.24	c constraints/agelimit = 1
0.19/0.24	c 
0.19/0.24	c # should enforcement of pseudo solution be disabled?
0.19/0.24	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.24	c constraints/disableenfops = TRUE
0.19/0.24	c 
0.19/0.24	c # frequency for displaying node information lines
0.19/0.24	c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.24	c display/freq = 10000
0.19/0.24	c 
0.19/0.24	c # maximal time in seconds to run
0.19/0.24	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.24	c limits/time = 1799.99
0.19/0.24	c 
0.19/0.24	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.24	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.24	c limits/memory = 1620
0.19/0.24	c 
0.19/0.24	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.19/0.24	c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.24	c lp/solvefreq = 0
0.19/0.24	c 
0.19/0.24	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.19/0.24	c # [type: char, range: {lafpsqd}, default: l]
0.19/0.24	c lp/pricing = a
0.19/0.24	c 
0.19/0.24	c # should presolving try to simplify inequalities
0.19/0.24	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.24	c constraints/linear/simplifyinequalities = TRUE
0.19/0.24	c 
0.19/0.24	c # should presolving try to simplify knapsacks
0.19/0.24	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.24	c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.24	c 
0.19/0.24	c # priority of node selection rule <dfs> in standard mode
0.19/0.24	c # [type: int, range: [-536870912,536870911], default: 0]
0.19/0.24	c nodeselection/dfs/stdpriority = 1000000
0.19/0.24	c 
0.19/0.24	c -----------------------------------------------------------------------------------------------
0.19/0.24	c start solving
0.19/0.24	c 
0.19/0.25	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.19/0.25	c t 0.1s|     1 |     0 |    51 |     - |2177k|   0 |  50 |  50 | 733 |  50 | 733 |   0 |   0 |   0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.19/0.25	o -1
0.19/0.25	c R 0.1s|     1 |     0 |    51 |     - |2178k|   0 |  50 |  50 | 733 |  50 | 733 |   0 |   0 |   0 |-2.500000e+01 |-1.000000e+00 |  96.00%
0.19/0.25	o -2
0.19/0.25	c s 0.1s|     1 |     0 |    51 |     - |2178k|   0 |  50 |  50 | 733 |  50 | 733 |   0 |   0 |   0 |-2.500000e+01 |-2.000000e+00 |  92.00%
0.19/0.28	c   0.1s|     1 |     0 |   110 |     - |2185k|   0 |  35 |  50 | 733 |  50 | 738 |   5 |   0 |   0 |-1.750000e+01 |-2.000000e+00 |  88.57%
0.19/0.28	o -5
0.19/0.28	c b 0.1s|     1 |     0 |   110 |     - |2186k|   0 |  35 |  50 | 733 |  50 | 738 |   5 |   0 |   0 |-1.750000e+01 |-5.000000e+00 |  71.43%
0.29/0.31	c   0.2s|     1 |     0 |   146 |     - |2191k|   0 |  30 |  50 | 733 |  50 | 744 |  11 |   0 |   0 |-1.500000e+01 |-5.000000e+00 |  66.67%
0.29/0.35	c   0.2s|     1 |     0 |   217 |     - |2197k|   0 |  24 |  50 | 733 |  50 | 748 |  15 |   0 |   0 |-1.200000e+01 |-5.000000e+00 |  58.33%
0.29/0.39	c   0.2s|     1 |     0 |   252 |     - |2201k|   0 |  22 |  50 | 733 |  50 | 753 |  20 |   0 |   0 |-1.100000e+01 |-5.000000e+00 |  54.55%
0.40/0.43	c   0.3s|     1 |     0 |   294 |     - |2206k|   0 |  25 |  50 | 733 |  50 | 760 |  27 |   0 |   0 |-1.000000e+01 |-5.000000e+00 |  50.00%
0.40/0.48	c   0.3s|     1 |     0 |   314 |     - |2236k|   0 |  28 |  50 | 733 |  50 | 766 |  33 |   0 |   0 |-9.500000e+00 |-5.000000e+00 |  47.37%
0.49/0.55	c   0.4s|     1 |     0 |   373 |     - |2345k|   0 |  34 |  50 | 733 |  50 | 775 |  42 |   0 |   0 |-9.155556e+00 |-5.000000e+00 |  45.39%
0.59/0.64	c   0.5s|     1 |     0 |   413 |     - |2711k|   0 |  33 |  50 | 733 |  50 | 784 |  51 |   0 |   0 |-8.729167e+00 |-5.000000e+00 |  42.72%
0.69/0.73	c   0.6s|     1 |     0 |   450 |     - |3005k|   0 |  31 |  50 | 733 |  50 | 791 |  58 |   0 |   0 |-8.389972e+00 |-5.000000e+00 |  40.41%
0.79/0.83	c   0.7s|     1 |     0 |   514 |     - |3157k|   0 |  32 |  50 | 733 |  50 | 799 |  66 |   0 |   0 |-7.955102e+00 |-5.000000e+00 |  37.15%
0.89/0.91	c   0.8s|     1 |     0 |   543 |     - |3448k|   0 |  35 |  50 | 733 |  50 | 113 |  72 |   0 |   0 |-7.894553e+00 |-5.000000e+00 |  36.67%
0.89/0.92	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.89/0.92	c   0.8s|     1 |     0 |   581 |     - |3539k|   0 |  35 |  50 | 733 |  50 | 119 |  78 |   0 |   0 |-7.000000e+00 |-5.000000e+00 |  28.57%
0.89/0.94	c   0.8s|     1 |     0 |   610 |     - |3624k|   0 |  41 |  50 | 733 |  50 | 131 |  90 |   0 |   0 |-7.000000e+00 |-5.000000e+00 |  28.57%
0.89/0.95	c   0.8s|     1 |     0 |   637 |     - |3705k|   0 |  42 |  50 | 733 |  50 | 138 |  97 |   0 |   0 |-7.000000e+00 |-5.000000e+00 |  28.57%
0.89/0.97	c   0.8s|     1 |     0 |   667 |     - |3747k|   0 |  38 |  50 | 733 |  50 | 144 | 103 |   0 |   0 |-7.000000e+00 |-5.000000e+00 |  28.57%
0.89/0.99	c   0.8s|     1 |     0 |   757 |     - |3765k|   0 |  42 |  50 | 733 |  50 | 150 | 109 |   0 |   0 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.00/1.02	c   0.8s|     1 |     0 |   828 |     - |3779k|   0 |  38 |  50 | 733 |  50 | 119 | 116 |   0 |   0 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.39/1.48	c   1.3s|     1 |     0 |   842 |     - |3777k|   0 |  36 |  50 | 733 |  50 | 119 | 116 |   0 |  38 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.39/1.49	c   1.3s|     1 |     0 |   878 |     - |3842k|   0 |  43 |  50 | 733 |  50 | 125 | 122 |   0 |  38 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.49/1.59	c   1.4s|     1 |     0 |   920 |     - |3838k|   0 |  36 |  50 | 733 |  50 | 125 | 122 |   0 |  47 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.59/1.60	c   1.4s|     1 |     0 |   978 |     - |3897k|   0 |  38 |  50 | 733 |  50 | 134 | 131 |   0 |  47 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.59/1.64	c   1.4s|     1 |     2 |   978 |     - |3898k|   0 |  38 |  50 | 733 |  50 | 134 | 131 |   0 |  49 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.59/1.64	c (run 1, node 1) restarting after 7 global fixings of integer variables
1.59/1.64	c 
1.59/1.64	c (restart) converted 38 cuts from the global cut pool into linear constraints
1.59/1.64	c 
1.59/1.64	c presolving:
1.59/1.65	c (round 1) 7 del vars, 220 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 38 upgd conss, 4398 impls, 35 clqs
1.59/1.66	c (round 2) 7 del vars, 220 del conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 38 upgd conss, 4398 impls, 35 clqs
1.59/1.66	c (round 3) 7 del vars, 220 del conss, 0 chg bounds, 0 chg sides, 7 chg coeffs, 38 upgd conss, 4398 impls, 35 clqs
1.59/1.66	c (round 4) 7 del vars, 220 del conss, 0 chg bounds, 0 chg sides, 8 chg coeffs, 38 upgd conss, 4398 impls, 35 clqs
1.59/1.66	c presolving (5 rounds):
1.59/1.66	c  7 deleted vars, 220 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 8 changed coefficients
1.59/1.66	c  4398 implications, 35 cliques
1.59/1.66	c presolved problem has 43 variables (43 bin, 0 int, 0 impl, 0 cont) and 551 constraints
1.59/1.66	c       3 constraints of type <knapsack>
1.59/1.66	c      35 constraints of type <setppc>
1.59/1.66	c     513 constraints of type <logicor>
1.59/1.66	c transformed objective value is always integral (scale: 1)
1.59/1.66	c Presolving Time: 0.13
1.59/1.67	c 
1.59/1.67	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.59/1.67	c   1.5s|     1 |     0 |  1075 |     - |2097k|   0 |  27 |  43 | 551 |  43 | 551 |   0 |   0 |  49 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.69/1.75	c   1.6s|     1 |     0 |  1098 |     - |2452k|   0 |  35 |  43 | 551 |  43 | 557 |   6 |   0 |  49 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.89/1.96	c   1.8s|     1 |     0 |  1120 |     - |2448k|   0 |  31 |  43 | 551 |  43 | 557 |   6 |   0 |  77 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.99/2.07	c   1.9s|     1 |     0 |  1130 |     - |2445k|   0 |  32 |  43 | 551 |  43 | 557 |   6 |   0 |  89 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.99/2.08	c   1.9s|     1 |     0 |  1130 |     - |2444k|   0 |   - |  43 | 551 |  43 | 557 |   6 |   0 |  92 |-7.000000e+00 |-5.000000e+00 |  28.57%
1.99/2.08	c (run 2, node 1) restarting after 9 global fixings of integer variables
1.99/2.08	c 
1.99/2.08	c (restart) converted 6 cuts from the global cut pool into linear constraints
1.99/2.09	c 
1.99/2.09	c presolving:
1.99/2.10	c (round 1) 9 del vars, 227 del conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 6 upgd conss, 4398 impls, 40 clqs
2.10/2.10	c (round 2) 9 del vars, 227 del conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 6 upgd conss, 4398 impls, 40 clqs
2.10/2.10	c (round 3) 9 del vars, 227 del conss, 0 chg bounds, 0 chg sides, 5 chg coeffs, 6 upgd conss, 4398 impls, 40 clqs
2.10/2.10	c presolving (4 rounds):
2.10/2.10	c  9 deleted vars, 227 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 5 changed coefficients
2.10/2.10	c  4398 implications, 40 cliques
2.10/2.10	c presolved problem has 34 variables (34 bin, 0 int, 0 impl, 0 cont) and 330 constraints
2.10/2.10	c       4 constraints of type <knapsack>
2.10/2.10	c      39 constraints of type <setppc>
2.10/2.10	c     287 constraints of type <logicor>
2.10/2.10	c transformed objective value is always integral (scale: 1)
2.10/2.10	c Presolving Time: 0.14
2.10/2.11	c 
2.10/2.11	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
2.10/2.11	c   1.9s|     1 |     0 |  1220 |     - |1957k|   0 |  31 |  34 | 330 |  34 | 330 |   0 |   0 |  92 |-7.000000e+00 |-5.000000e+00 |  28.57%
2.10/2.17	c   1.9s|     1 |     0 |  1267 |     - |2338k|   0 |  30 |  34 | 330 |  34 | 337 |   7 |   0 |  92 |-7.000000e+00 |-5.000000e+00 |  28.57%
2.20/2.28	c   2.1s|     1 |     0 |  1288 |     - |2334k|   0 |  23 |  34 | 330 |  34 | 337 |   7 |   0 | 113 |-6.923077e+00 |-5.000000e+00 |  27.78%
2.29/2.31	c   2.1s|     1 |     0 |  1288 |     - |2330k|   0 |   - |  34 | 330 |  34 | 337 |   7 |   0 | 124 |-6.923077e+00 |-5.000000e+00 |  27.78%
2.29/2.31	c (run 3, node 1) restarting after 8 global fixings of integer variables
2.29/2.31	c 
2.29/2.31	c (restart) converted 7 cuts from the global cut pool into linear constraints
2.29/2.31	c 
2.29/2.31	c presolving:
2.29/2.32	c (round 1) 8 del vars, 139 del conss, 0 chg bounds, 1 chg sides, 9 chg coeffs, 7 upgd conss, 4398 impls, 36 clqs
2.29/2.32	c (round 2) 8 del vars, 142 del conss, 0 chg bounds, 2 chg sides, 20 chg coeffs, 7 upgd conss, 4398 impls, 36 clqs
2.29/2.32	c (round 3) 8 del vars, 142 del conss, 0 chg bounds, 2 chg sides, 23 chg coeffs, 7 upgd conss, 4398 impls, 36 clqs
2.29/2.32	c (round 4) 8 del vars, 142 del conss, 0 chg bounds, 2 chg sides, 26 chg coeffs, 7 upgd conss, 4398 impls, 36 clqs
2.29/2.33	c (round 5) 8 del vars, 142 del conss, 0 chg bounds, 2 chg sides, 27 chg coeffs, 7 upgd conss, 4398 impls, 36 clqs
2.29/2.33	c presolving (6 rounds):
2.29/2.33	c  8 deleted vars, 142 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 27 changed coefficients
2.29/2.33	c  4398 implications, 36 cliques
2.29/2.33	c presolved problem has 26 variables (26 bin, 0 int, 0 impl, 0 cont) and 197 constraints
2.29/2.33	c       5 constraints of type <knapsack>
2.29/2.33	c      34 constraints of type <setppc>
2.29/2.33	c     158 constraints of type <logicor>
2.29/2.33	c transformed objective value is always integral (scale: 1)
2.29/2.33	c Presolving Time: 0.15
2.29/2.33	c 
2.29/2.33	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
2.29/2.33	c   2.1s|     1 |     0 |  1355 |     - |1867k|   0 |  20 |  26 | 197 |  26 | 197 |   0 |   0 | 124 |-6.826680e+00 |-5.000000e+00 |  26.76%
2.29/2.36	c   2.1s|     1 |     0 |  1365 |     - |1886k|   0 |  20 |  26 | 197 |  26 | 201 |   4 |   0 | 124 |-6.000000e+00 |-5.000000e+00 |  16.67%
2.29/2.39	c   2.1s|     1 |     0 |  1387 |     - |1882k|   0 |   8 |  26 | 196 |  26 | 201 |   4 |   0 | 143 |-6.000000e+00 |-5.000000e+00 |  16.67%
2.29/2.39	c   2.1s|     1 |     2 |  1387 |     - |1883k|   0 |   8 |  26 | 196 |  26 | 201 |   4 |   0 | 146 |-6.000000e+00 |-5.000000e+00 |  16.67%
2.29/2.39	c (run 4, node 1) restarting after 5 global fixings of integer variables
2.29/2.39	c 
2.29/2.39	c (restart) converted 2 cuts from the global cut pool into linear constraints
2.29/2.39	c 
2.29/2.40	c presolving:
2.39/2.40	c (round 1) 5 del vars, 73 del conss, 0 chg bounds, 1 chg sides, 10 chg coeffs, 2 upgd conss, 4398 impls, 26 clqs
2.39/2.41	c (round 2) 5 del vars, 76 del conss, 0 chg bounds, 3 chg sides, 21 chg coeffs, 2 upgd conss, 4398 impls, 28 clqs
2.39/2.41	c (round 3) 5 del vars, 77 del conss, 0 chg bounds, 5 chg sides, 30 chg coeffs, 2 upgd conss, 4398 impls, 28 clqs
2.39/2.41	c (round 4) 5 del vars, 77 del conss, 0 chg bounds, 5 chg sides, 31 chg coeffs, 2 upgd conss, 4398 impls, 28 clqs
2.39/2.41	c presolving (5 rounds):
2.39/2.41	c  5 deleted vars, 77 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 31 changed coefficients
2.39/2.41	c  4398 implications, 28 cliques
2.39/2.41	c presolved problem has 21 variables (21 bin, 0 int, 0 impl, 0 cont) and 126 constraints
2.39/2.41	c       6 constraints of type <knapsack>
2.39/2.41	c      29 constraints of type <setppc>
2.39/2.41	c      91 constraints of type <logicor>
2.39/2.41	c transformed objective value is always integral (scale: 1)
2.39/2.41	c Presolving Time: 0.16
2.39/2.41	c 
2.39/2.42	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
2.39/2.42	c   2.2s|     1 |     0 |  1449 |     - |1820k|   0 |  15 |  21 | 126 |  21 | 126 |   0 |   0 | 146 |-6.000000e+00 |-5.000000e+00 |  16.67%
2.39/2.43	c   2.2s|     1 |     0 |  1458 |     - |1834k|   0 |  16 |  21 | 126 |  21 | 129 |   3 |   0 | 146 |-6.000000e+00 |-5.000000e+00 |  16.67%
2.39/2.45	c   2.2s|     1 |     2 |  1458 |     - |1835k|   0 |  16 |  21 | 126 |  21 | 129 |   3 |   0 | 162 |-6.000000e+00 |-5.000000e+00 |  16.67%
2.39/2.45	o -6
2.39/2.45	c * 2.2s|     4 |     0 |  1458 |   0.0 |1837k|   3 |   - |  21 | 126 |   0 |   0 |   3 |   0 | 162 |-6.000000e+00 |-6.000000e+00 |   0.00%
2.39/2.45	c 
2.39/2.45	c SCIP Status        : problem is solved [optimal solution found]
2.39/2.45	c Solving Time (sec) : 2.19
2.39/2.45	c Solving Nodes      : 4 (total of 8 nodes in 5 runs)
2.39/2.45	c Primal Bound       : -6.00000000000000e+00 (14 solutions)
2.39/2.45	c Dual Bound         : -6.00000000000000e+00
2.39/2.45	c Gap                : 0.00 %
2.39/2.45	s OPTIMUM FOUND
2.39/2.45	v x50 -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 -x24 
2.39/2.45	v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1 
2.39/2.45	c SCIP Status        : problem is solved [optimal solution found]
2.39/2.45	c Solving Time       :       2.19
2.39/2.45	c Original Problem   :
2.39/2.45	c   Problem name     : HOME/instance-2666665-1276660135.opb
2.39/2.45	c   Variables        : 783 (783 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.45	c   Constraints      : 783 initial, 783 maximal
2.39/2.45	c Presolved Problem  :
2.39/2.45	c   Problem name     : t_HOME/instance-2666665-1276660135.opb
2.39/2.45	c   Variables        : 21 (21 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.45	c   Constraints      : 126 initial, 126 maximal
2.39/2.45	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
2.39/2.45	c   trivial          :       0.00         29          0          0          0          0          0          0          0
2.39/2.45	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
2.39/2.45	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
2.39/2.45	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
2.39/2.45	c   implics          :       0.00          0          0          0          0          0          0          0          0
2.39/2.45	c   probing          :       0.01          0          0          0          0          0          0          0          0
2.39/2.45	c   knapsack         :       0.03          0          0          0          0          0          0          7         71
2.39/2.45	c   setppc           :       0.00          0          0          0          0          0         24          0          0
2.39/2.45	c   linear           :       0.00        733          0          0        733          0         50          0          0
2.39/2.45	c   logicor          :       0.01          0          0          0          0          0        642          0          0
2.39/2.45	c   root node        :          -         29          -          -         29          -          -          -          -
2.39/2.45	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
2.39/2.45	c   integral         :          0          0          0         11          0          0         29          0          0          6
2.39/2.45	c   knapsack         :          6          4         15          0          0          0          0          0          0          0
2.39/2.45	c   setppc           :         29          4         14          0          0          0         14          0          0          0
2.39/2.45	c   logicor          :         91         23        109          0          1          0          1          1          0          0
2.39/2.45	c   countsols        :          0          0          0          0          1          0          0          0          0          0
2.39/2.45	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
2.39/2.45	c   integral         :       1.04       0.00       0.00       1.04       0.00
2.39/2.45	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
2.39/2.45	c   setppc           :       0.00       0.00       0.00       0.00       0.00
2.39/2.45	c   logicor          :       0.01       0.00       0.01       0.00       0.00
2.39/2.45	c   countsols        :       0.00       0.00       0.00       0.00       0.00
2.39/2.45	c Propagators        :       Time      Calls    Cutoffs    DomReds
2.39/2.45	c   vbounds          :       0.00          6          0          0
2.39/2.45	c   rootredcost      :       0.00          0          0          0
2.39/2.45	c   pseudoobj        :       0.00         37          0          3
2.39/2.45	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
2.39/2.45	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
2.39/2.45	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
2.39/2.45	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
2.39/2.45	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
2.39/2.45	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
2.39/2.45	c   applied globally :          -          -          -          0        0.0          -          -          -
2.39/2.45	c   applied locally  :          -          -          -          0        0.0          -          -          -
2.39/2.45	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
2.39/2.45	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 17)
2.39/2.45	c   redcost          :       0.00         23          0          0          0          0
2.39/2.45	c   impliedbounds    :       0.00         23          0          0          2          0
2.39/2.45	c   intobj           :       0.00          0          0          0          0          0
2.39/2.45	c   cgmip            :       0.00          0          0          0          0          0
2.39/2.45	c   gomory           :       0.38         23          0          0       4712          0
2.39/2.45	c   strongcg         :       0.31         23          0          0       5573          0
2.39/2.45	c   cmir             :       0.01         14          0          0          0          0
2.39/2.45	c   flowcover        :       0.07         14          0          0          0          0
2.39/2.45	c   clique           :       0.00         23          0          0        187          0
2.39/2.45	c   zerohalf         :       0.00          0          0          0          0          0
2.39/2.45	c   mcf              :       0.00          5          0          0          0          0
2.39/2.45	c   rapidlearning    :       0.00          0          0          0          0          0
2.39/2.45	c Pricers            :       Time      Calls       Vars
2.39/2.45	c   problem variables:       0.00          0          0
2.39/2.45	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
2.39/2.45	c   relpscost        :       1.04         11          0         29          0          0          6
2.39/2.45	c   pscost           :       0.00          0          0          0          0          0          0
2.39/2.45	c   inference        :       0.00          2          0          0          0          0          4
2.39/2.45	c   mostinf          :       0.00          0          0          0          0          0          0
2.39/2.45	c   leastinf         :       0.00          0          0          0          0          0          0
2.39/2.45	c   fullstrong       :       0.00          0          0          0          0          0          0
2.39/2.45	c   allfullstrong    :       0.00          0          0          0          0          0          0
2.39/2.45	c   random           :       0.00          0          0          0          0          0          0
2.39/2.45	c Primal Heuristics  :       Time      Calls      Found
2.39/2.45	c   LP solutions     :       0.00          -          0
2.39/2.45	c   pseudo solutions :       0.00          -          1
2.39/2.45	c   crossover        :       0.00          0          0
2.39/2.45	c   oneopt           :       0.00          2          1
2.39/2.45	c   trivial          :       0.00          2          2
2.39/2.45	c   simplerounding   :       0.01         34          5
2.39/2.45	c   zirounding       :       0.00          2          2
2.39/2.45	c   rounding         :       0.01         34          1
2.39/2.45	c   shifting         :       0.00         34          2
2.39/2.45	c   intshifting      :       0.00          0          0
2.39/2.45	c   twoopt           :       0.00          0          0
2.39/2.45	c   fixandinfer      :       0.00          0          0
2.39/2.45	c   feaspump         :       0.00          0          0
2.39/2.45	c   coefdiving       :       0.00          0          0
2.39/2.45	c   pscostdiving     :       0.00          0          0
2.39/2.45	c   fracdiving       :       0.00          0          0
2.39/2.45	c   veclendiving     :       0.00          0          0
2.39/2.45	c   intdiving        :       0.00          0          0
2.39/2.45	c   actconsdiving    :       0.00          0          0
2.39/2.45	c   objpscostdiving  :       0.00          0          0
2.39/2.45	c   rootsoldiving    :       0.00          0          0
2.39/2.45	c   linesearchdiving :       0.00          0          0
2.39/2.45	c   guideddiving     :       0.00          0          0
2.39/2.45	c   octane           :       0.00          0          0
2.39/2.45	c   rens             :       0.00          0          0
2.39/2.45	c   rins             :       0.00          0          0
2.39/2.45	c   localbranching   :       0.00          0          0
2.39/2.45	c   mutation         :       0.00          0          0
2.39/2.45	c   dins             :       0.00          0          0
2.39/2.45	c   undercover       :       0.00          0          0
2.39/2.45	c   nlp              :       0.00          0          0
2.39/2.45	c   trysol           :       0.00          0          0
2.39/2.45	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
2.39/2.45	c   primal LP        :       0.00          0          0       0.00          -
2.39/2.45	c   dual LP          :       0.16         34       1458      42.88    9112.50
2.39/2.45	c   lex dual LP      :       0.00          0          0       0.00          -
2.39/2.45	c   barrier LP       :       0.00          0          0       0.00          -
2.39/2.45	c   diving/probing LP:       0.00          0          0       0.00          -
2.39/2.45	c   strong branching :       1.04        162      11006      67.94   10582.69
2.39/2.45	c     (at root node) :          -        162      11006      67.94          -
2.39/2.45	c   conflict analysis:       0.00          0          0       0.00          -
2.39/2.45	c B&B Tree           :
2.39/2.45	c   number of runs   :          5
2.39/2.45	c   nodes            :          4
2.39/2.45	c   nodes (total)    :          8
2.39/2.45	c   nodes left       :          0
2.39/2.45	c   max depth        :          3
2.39/2.45	c   max depth (total):          3
2.39/2.45	c   backtracks       :          0 (0.0%)
2.39/2.45	c   delayed cutoffs  :          0
2.39/2.45	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
2.39/2.45	c   avg switch length:       2.00
2.39/2.45	c   switching time   :       0.00
2.39/2.45	c Solution           :
2.39/2.45	c   Solutions found  :         14 (5 improvements)
2.39/2.45	c   First Solution   : +0.00000000000000e+00   (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
2.39/2.45	c   Primal Bound     : -6.00000000000000e+00   (in run 5, after 4 nodes, 2.19 seconds, depth 3, found by <relaxation>)
2.39/2.45	c   Dual Bound       : -6.00000000000000e+00
2.39/2.45	c   Gap              :       0.00 %
2.39/2.45	c   Root Dual Bound  : -6.00000000000000e+00
2.39/2.45	c   Root Iterations  :       1458
2.39/2.46	c Time complete: 2.45.

Verifier Data

OK	-6

Watcher Data

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2666665-1276660135/watcher-2666665-1276660135 -o /tmp/evaluation-result-2666665-1276660135/solver-2666665-1276660135 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2666665-1276660135.opb -t 1800 -m 1800 

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 0.86 0.96 0.99 3/106 14870
/proc/meminfo: memFree=1698740/2059040 swapFree=4192956/4192956
[pid=14870] ppid=14868 vsize=7724 CPUtime=0
/proc/14870/stat : 14870 (pbscip.linux.x8) R 14868 14870 14619 0 -1 4202496 1036 0 0 0 0 0 0 0 20 0 1 0 7305521 7909376 955 1992294400 4194304 8223781 140734022855744 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/14870/statm: 1931 965 348 984 0 944 0

[startup+0.0164729 s]
/proc/loadavg: 0.86 0.96 0.99 3/106 14870
/proc/meminfo: memFree=1698740/2059040 swapFree=4192956/4192956
[pid=14870] ppid=14868 vsize=9812 CPUtime=0
/proc/14870/stat : 14870 (pbscip.linux.x8) R 14868 14870 14619 0 -1 4202496 1748 0 0 0 0 0 0 0 20 0 1 0 7305521 10047488 1667 1992294400 4194304 8223781 140734022855744 18446744073709551615 4207135 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/14870/statm: 2453 1670 366 984 0 1466 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 9812

[startup+0.101466 s]
/proc/loadavg: 0.86 0.96 0.99 3/106 14870
/proc/meminfo: memFree=1698740/2059040 swapFree=4192956/4192956
[pid=14870] ppid=14868 vsize=13820 CPUtime=0.09
/proc/14870/stat : 14870 (pbscip.linux.x8) R 14868 14870 14619 0 -1 4202496 3106 0 0 0 5 4 0 0 20 0 1 0 7305521 14151680 2404 1992294400 4194304 8223781 140734022855744 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/14870/statm: 3455 2404 432 984 0 2468 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 13820

[startup+0.301488 s]
/proc/loadavg: 0.86 0.96 0.99 3/106 14870
/proc/meminfo: memFree=1698740/2059040 swapFree=4192956/4192956
[pid=14870] ppid=14868 vsize=16836 CPUtime=0.29
/proc/14870/stat : 14870 (pbscip.linux.x8) R 14868 14870 14619 0 -1 4202496 4795 0 0 0 17 12 0 0 20 0 1 0 7305521 17240064 3316 1992294400 4194304 8223781 140734022855744 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/14870/statm: 4209 3316 559 984 0 3222 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 16836

[startup+0.70153 s]
/proc/loadavg: 0.86 0.96 0.99 3/106 14870
/proc/meminfo: memFree=1698740/2059040 swapFree=4192956/4192956
[pid=14870] ppid=14868 vsize=21500 CPUtime=0.69
/proc/14870/stat : 14870 (pbscip.linux.x8) R 14868 14870 14619 0 -1 4202496 5964 0 0 0 55 14 0 0 21 0 1 0 7305521 22016000 4483 1992294400 4194304 8223781 140734022855744 18446744073709551615 6060007 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/14870/statm: 5375 4483 562 984 0 4388 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 21500

[startup+1.50162 s]
/proc/loadavg: 0.86 0.96 0.99 2/107 14871
/proc/meminfo: memFree=1681992/2059040 swapFree=4192956/4192956
[pid=14870] ppid=14868 vsize=22304 CPUtime=1.49
/proc/14870/stat : 14870 (pbscip.linux.x8) R 14868 14870 14619 0 -1 4202496 6703 0 0 0 133 16 0 0 23 0 1 0 7305521 22839296 4705 1992294400 4194304 8223781 140734022855744 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/14870/statm: 5576 4705 570 984 0 4589 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 22304

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

[startup+1.90166 s]
/proc/loadavg: 0.86 0.96 0.99 2/107 14871
/proc/meminfo: memFree=1681992/2059040 swapFree=4192956/4192956
[pid=14870] ppid=14868 vsize=22364 CPUtime=1.89
/proc/14870/stat : 14870 (pbscip.linux.x8) R 14868 14870 14619 0 -1 4202496 9570 0 0 0 170 19 0 0 25 0 1 0 7305521 22900736 4745 1992294400 4194304 8223781 140734022855744 18446744073709551615 7253477 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/14870/statm: 5591 4745 591 984 0 4604 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 22364

[startup+2.3017 s]
/proc/loadavg: 0.86 0.96 0.99 2/107 14871
/proc/meminfo: memFree=1681744/2059040 swapFree=4192956/4192956
[pid=14870] ppid=14868 vsize=22700 CPUtime=2.29
/proc/14870/stat : 14870 (pbscip.linux.x8) R 14868 14870 14619 0 -1 4202496 12478 0 0 0 208 21 0 0 25 0 1 0 7305521 23244800 4826 1992294400 4194304 8223781 140734022855744 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/14870/statm: 5675 4826 592 984 0 4688 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 22700

[startup+2.40171 s]
/proc/loadavg: 0.86 0.96 0.99 2/107 14871
/proc/meminfo: memFree=1681744/2059040 swapFree=4192956/4192956
[pid=14870] ppid=14868 vsize=25984 CPUtime=2.39
/proc/14870/stat : 14870 (pbscip.linux.x8) R 14868 14870 14619 0 -1 4202496 16836 0 0 0 216 23 0 0 25 0 1 0 7305521 26607616 5329 1992294400 4194304 8223781 140734022855744 18446744073709551615 7253477 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/14870/statm: 6496 5342 592 984 0 5509 0
Current children cumulated CPU time (s) 2.39
Current children cumulated vsize (KiB) 25984

Child status: 0
Real time (s): 2.46502
CPU time (s): 2.46462
CPU user time (s): 2.21666
CPU system time (s): 0.247962
CPU usage (%): 99.9841
Max. virtual memory (cumulated for all children) (KiB): 25984

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.21666
system time used= 0.247962
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 20404
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= 4
involuntary context switches= 33

runsolver used 0.009998 second user time and 0.025996 second system time

The end

Launcher Data

Begin job on node047 at 2010-06-16 05:48:55
IDJOB=2666665
IDBENCH=48178
IDSOLVER=1169
FILE ID=node047/2666665-1276660135
PBS_JOBID= 11172486
Free space on /tmp= 62540 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB07/normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/manquinho/mis/normalized-mis_50_25_4.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2666665-1276660135/watcher-2666665-1276660135 -o /tmp/evaluation-result-2666665-1276660135/solver-2666665-1276660135 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2666665-1276660135.opb -t 1800 -m 1800

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

MD5SUM BENCH= 86191362e647705fbaa0ee217c43491b
RANDOM SEED=439354760

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1699144 kB
Buffers:         81364 kB
Cached:         152324 kB
SwapCached:          0 kB
Active:         131040 kB
Inactive:       161872 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1699144 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            4800 kB
Writeback:           0 kB
AnonPages:       59184 kB
Mapped:          15360 kB
Slab:            45184 kB
PageTables:       4004 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181680 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= 62536 MiB
End job on node047 at 2010-06-16 05:48:58