\frac{\left(\frac{\left(d1 \cdot \left(3\right)\right)}{\left(d1 \cdot d2\right)}\right)}{\left(d1 \cdot d3\right)}\left(\left(\mathsf{qma}\left(\left(\mathsf{qma}\left(\left(\left(3\right)\right), d3, \left(1.0\right)\right)\right), d2, \left(1.0\right)\right)\right)\right) \cdot d1double f(double d1, double d2, double d3) {
double r3513598 = d1;
double r3513599 = 3.0;
double r3513600 = /* ERROR: no posit support in C */;
double r3513601 = r3513598 * r3513600;
double r3513602 = d2;
double r3513603 = r3513598 * r3513602;
double r3513604 = r3513601 + r3513603;
double r3513605 = d3;
double r3513606 = r3513598 * r3513605;
double r3513607 = r3513604 + r3513606;
return r3513607;
}
double f(double d1, double d2, double d3) {
double r3513608 = 3.0;
double r3513609 = /* ERROR: no posit support in C */;
double r3513610 = /*Error: no posit support in C */;
double r3513611 = d3;
double r3513612 = 1.0;
double r3513613 = /* ERROR: no posit support in C */;
double r3513614 = /*Error: no posit support in C */;
double r3513615 = d2;
double r3513616 = /*Error: no posit support in C */;
double r3513617 = /*Error: no posit support in C */;
double r3513618 = d1;
double r3513619 = r3513617 * r3513618;
return r3513619;
}



Bits error versus d1



Bits error versus d2



Bits error versus d3
Initial program 0.5
Simplified0.3
rmApplied introduce-quire0.3
Applied insert-quire-add0.3
Applied insert-quire-add0.2
Final simplification0.2
herbie shell --seed 2019164 +o rules:numerics
(FPCore (d1 d2 d3)
:name "FastMath test3"
(+.p16 (+.p16 (*.p16 d1 (real->posit16 3)) (*.p16 d1 d2)) (*.p16 d1 d3)))