Average Error: 0.3 → 0.2
Time: 5.9s
Precision: 64
\[\frac{\left(d1 \cdot d2\right)}{\left(d1 \cdot d3\right)}\]
↓
\[\left(\mathsf{qma}\left(\left(\left(d1 \cdot d2\right)\right), d1, d3\right)\right)\]
\frac{\left(d1 \cdot d2\right)}{\left(d1 \cdot d3\right)}
↓
\left(\mathsf{qma}\left(\left(\left(d1 \cdot d2\right)\right), d1, d3\right)\right)
double f(double d1, double d2, double d3) {
        double r3981984 = d1;
        double r3981985 = d2;
        double r3981986 = r3981984 * r3981985;
        double r3981987 = d3;
        double r3981988 = r3981984 * r3981987;
        double r3981989 = r3981986 + r3981988;
        return r3981989;
}
↓
double f(double d1, double d2, double d3) {
        double r3981990 = d1;
        double r3981991 = d2;
        double r3981992 = r3981990 * r3981991;
        double r3981993 = /*Error: no posit support in C */;
        double r3981994 = d3;
        double r3981995 = /*Error: no posit support in C */;
        double r3981996 = /*Error: no posit support in C */;
        return r3981996;
}

Error

Bits error versus d1

Bits error versus d2

Bits error versus d3

Derivation

  1. Initial program 0.3

    \[\frac{\left(d1 \cdot d2\right)}{\left(d1 \cdot d3\right)}\]
  2. Using strategy rm

  3. Applied introduce-quire0.3

    \[\leadsto \frac{\color{blue}{\left(\left(\left(d1 \cdot d2\right)\right)\right)}}{\left(d1 \cdot d3\right)}\]

  4. Applied insert-quire-fdp-add0.2

    \[\leadsto \color{blue}{\left(\mathsf{qma}\left(\left(\left(d1 \cdot d2\right)\right), d1, d3\right)\right)}\]

  5. Final simplification0.2

    \[\leadsto \left(\mathsf{qma}\left(\left(\left(d1 \cdot d2\right)\right), d1, d3\right)\right)\]

Reproduce

herbie shell --seed 2019163 
(FPCore (d1 d2 d3)
  :name "FastMath dist"
  (+.p16 (*.p16 d1 d2) (*.p16 d1 d3)))