Average Error: 0.5 → 0.3
Time: 8.5s
Precision: 64
\[\frac{\left(\frac{\left(d1 \cdot \left(3\right)\right)}{\left(d1 \cdot d2\right)}\right)}{\left(d1 \cdot d3\right)}\]
\[\left(\left(3 + d2\right) + d3\right) \cdot d1\]
\frac{\left(\frac{\left(d1 \cdot \left(3\right)\right)}{\left(d1 \cdot d2\right)}\right)}{\left(d1 \cdot d3\right)}
\left(\left(3 + d2\right) + d3\right) \cdot d1
double f(double d1, double d2, double d3) {
        double r2038086 = d1;
        double r2038087 = 3.0;
        double r2038088 = /* ERROR: no posit support in C */;
        double r2038089 = r2038086 * r2038088;
        double r2038090 = d2;
        double r2038091 = r2038086 * r2038090;
        double r2038092 = r2038089 + r2038091;
        double r2038093 = d3;
        double r2038094 = r2038086 * r2038093;
        double r2038095 = r2038092 + r2038094;
        return r2038095;
}

double f(double d1, double d2, double d3) {
        double r2038096 = 3.0;
        double r2038097 = d2;
        double r2038098 = r2038096 + r2038097;
        double r2038099 = d3;
        double r2038100 = r2038098 + r2038099;
        double r2038101 = d1;
        double r2038102 = r2038100 * r2038101;
        return r2038102;
}

Error

Bits error versus d1

Bits error versus d2

Bits error versus d3

Derivation

  1. Initial program 0.5

    \[\frac{\left(\frac{\left(d1 \cdot \left(3\right)\right)}{\left(d1 \cdot d2\right)}\right)}{\left(d1 \cdot d3\right)}\]
  2. Simplified0.3

    \[\leadsto \color{blue}{\left(\frac{\left(3\right)}{\left(\frac{d2}{d3}\right)}\right) \cdot d1}\]
  3. Using strategy rm
  4. Applied associate-+r+0.3

    \[\leadsto \color{blue}{\left(\frac{\left(\frac{\left(3\right)}{d2}\right)}{d3}\right)} \cdot d1\]
  5. Final simplification0.3

    \[\leadsto \left(\left(3 + d2\right) + d3\right) \cdot d1\]

Reproduce

herbie shell --seed 2019119 +o rules:numerics
(FPCore (d1 d2 d3)
  :name "FastMath test3"
  (+.p16 (+.p16 (*.p16 d1 (real->posit16 3)) (*.p16 d1 d2)) (*.p16 d1 d3)))