Hi,
I am not sure if I can publish this, but it looks like we are quite
consistently outperforming 3.0.x and -fno-unit-at-a-time even with the
parameter reduced to 1000.  Perhaps it can be sane default value given
that we also get better compile times.
Do you have some comparsions to 2.95 and/or ICC?  (I will run 2.95 now)
(tought I am quite surprised that -fno-unit-at-a-time results are so
poor)

Honza

[0]: 2.95
[0]: 3.0.4
[1]: -O3 -fno-unit-at-a-time
[2]: -O3 --param large-function-insns=1000
[3]: -O3 --param large-function-insns=3000
[4]: -O3

                     |     [0]      |     [1]      |     [2]      |     [3]      |     [4]      |     [5]     |
---------------------+--------------+--------------+--------------+--------------+--------------+-------------+
      STRATCOMP1-ALL |  2.45 (0.00) | 24.92 (0.02) |  4.68 (0.00) |  2.58 (0.03) |  2.58 (0.03) | 2.58 (0.02) |
   STRATCOMP-770.2-Q |  0.49 (0.00) |  0.57 (0.00) |  1.22 (0.04) |  0.45 (0.00) |  0.45 (0.01) | 0.45 (0.00) |
               2QBF1 | 10.92 (0.04) | 13.96 (0.07) | 28.68 (0.03) | 10.44 (0.11) | 10.29 (0.10) | 9.33 (0.03) |
          PRIMEIMPL2 |  7.52 (0.02) |  8.75 (0.00) | 43.60 (0.05) |  6.19 (0.02) |  5.99 (0.01) | 6.00 (0.02) |
       3COL-SIMPLEX1 |  4.68 (0.00) |  4.97 (0.00) | 11.13 (0.26) |  4.34 (0.01) |  4.35 (0.02) | 4.34 (0.01) |
        3COL-RANDOM1 |  6.66 (0.05) |  8.15 (0.04) | 38.14 (0.16) |  6.10 (0.26) |  5.91 (0.04) | 5.86 (0.27) |
          HP-RANDOM1 |  4.93 (0.04) |  5.72 (0.03) | 18.44 (0.01) |  4.63 (0.07) |  4.64 (0.15) | 4.44 (0.05) |
       HAMCYCLE-FREE |  0.80 (0.00) |  1.12 (0.00) |  4.96 (0.00) |  0.75 (0.00) |  0.73 (0.01) | 0.72 (0.00) |
             DECOMP2 |  8.44 (0.01) |  9.59 (0.02) | 33.91 (0.06) |  7.71 (0.01) |  7.48 (0.04) | 7.87 (0.01) |
        BW-P5-nopush |  4.45 (0.01) |  4.85 (0.01) | 12.90 (0.04) |  4.27 (0.03) |  4.20 (0.02) | 4.19 (0.02) |
       BW-P5-pushbin |  3.79 (0.01) |  4.05 (0.03) | 12.61 (0.02) |  3.41 (0.01) |  3.38 (0.01) | 3.40 (0.01) |
     BW-P5-nopushbin |  1.21 (0.00) |  1.31 (0.01) |  4.07 (0.02) |  1.09 (0.00) |  1.09 (0.00) | 1.09 (0.00) |
        HANOI-Towers |  2.05 (0.02) |  2.19 (0.03) |  6.21 (0.03) |  1.88 (0.01) |  1.81 (0.01) | 1.82 (0.03) |
              RAMSEY |  5.34 (0.03) |  5.69 (0.00) | 16.69 (0.05) |  4.60 (0.02) |  4.65 (0.02) | 4.58 (0.05) |
             CRISTAL |  5.30 (0.08) |  5.91 (0.09) | 12.67 (0.03) |  4.65 (0.01) |  4.68 (0.05) | 4.75 (0.12) |
           21-QUEENS |  6.35 (0.00) |  7.31 (0.00) | 40.15 (0.15) |  5.09 (0.01) |  4.98 (0.01) | 4.86 (0.02) |
   MSTDir[V=13,A=40] | 12.58 (0.00) | 14.46 (0.00) | 41.77 (0.02) |  9.07 (0.02) |  8.60 (0.03) | 8.60 (0.05) |
   MSTDir[V=15,A=40] | 12.62 (0.00) | 14.49 (0.01) | 41.44 (0.01) |  9.00 (0.02) |  8.59 (0.04) | 8.53 (0.03) |
 MSTUndir[V=13,A=40] |  6.47 (0.00) |  7.57 (0.00) | 25.48 (0.02) |  4.88 (0.01) |  4.66 (0.00) | 4.61 (0.03) |
         TIMETABLING |  7.08 (0.14) |  7.37 (0.02) | 18.21 (0.20) |  5.87 (0.08) |  6.02 (0.10) | 5.90 (0.04) |
---------------------+--------------+--------------+--------------+--------------+--------------+-------------+

STRATCOMP1-ALL:
STRATCOMP, random instance, |companies| = 60, |products| = 180,
all sets

STRATCOMP-770.2-Q:
STRATCOMP, random instance, |companies| = |products| = 770,
first model, with query

2QBF1:
2QBF, 1000 all-quantified, 20 existentially-quantified variables
10000 clauses, 5CNF

PRIMEIMPL2:
Prime Implicants with 180 variables and 774 clauses (all models [246])

3COL-SIMPLEX1:
3COL simplex graph, |edges| = 1980, |nodes| = 1035, one model

3COL-RANDOM1:
3COL random graph, |edges| = 1100, |nodes| = 500, one model

HP-RANDOM1:
Hamiltonian Path on a random graph, |edges| = 700, |nodes| = 85, one model
generated with Stanford Graph Base random_graph(85,700,0,0,0,0,0,1,1,33)
undirected graph, represented as a directed one

HAMCYCLE-FREE:
Hamiltonian Cycle with a free guess.
n = 60, one model

DECOMP2:
query decomposition (k=3), one model

BW-P5-nopush:
blocksworld problem P5 with Axel's C-translation without push

BW-P5-pushbin:
blocksworld problem P5 with Axel's pushed and binarised C-translation

BW-P5-nopushbin:
blocksworld problem P5 with Axel's binarised C-translation without push

HANOI-Towers:
"Towers of Hanoi" with 3 stacks, 4 disks, and 15 steps.

RAMSEY:
"Ramsey(3,6) != 17"

CRISTAL:
"Deductive database use as done by Christoph Koch in CERN"

21-QUEENS:
"N-Queens with 21 queens"

MSTDir[V=13,A=40]:
min spanning tree [prim], directed graph with 13 vertices and 40 arcs

MSTDir[V=15,A=40]:
min spanning tree [prim], directed graph with 15 vertices and 40 arcs

MSTUndir[V=13,A=40]:
min spanning tree [prim], undirected graph with 13 vertices and 40 arcs

TIMETABLING:
A timetable problem of the first year of the faculty of Science
of University of Calabria for 1 class, one model

