Average Error: 0.5 → 0.3
Time: 7.6s
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 r1035490 = d1;
        double r1035491 = 3.0;
        double r1035492 = /* ERROR: no posit support in C */;
        double r1035493 = r1035490 * r1035492;
        double r1035494 = d2;
        double r1035495 = r1035490 * r1035494;
        double r1035496 = r1035493 + r1035495;
        double r1035497 = d3;
        double r1035498 = r1035490 * r1035497;
        double r1035499 = r1035496 + r1035498;
        return r1035499;
}

double f(double d1, double d2, double d3) {
        double r1035500 = 3.0;
        double r1035501 = d2;
        double r1035502 = r1035500 + r1035501;
        double r1035503 = d3;
        double r1035504 = r1035502 + r1035503;
        double r1035505 = d1;
        double r1035506 = r1035504 * r1035505;
        return r1035506;
}

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 2019124 +o rules:numerics
(FPCore (d1 d2 d3)
  :name "FastMath test3"
  (+.p16 (+.p16 (*.p16 d1 (real->posit16 3)) (*.p16 d1 d2)) (*.p16 d1 d3)))