\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 r4216559 = d1;
double r4216560 = 3.0;
double r4216561 = /* ERROR: no posit support in C */;
double r4216562 = r4216559 * r4216561;
double r4216563 = d2;
double r4216564 = r4216559 * r4216563;
double r4216565 = r4216562 + r4216564;
double r4216566 = d3;
double r4216567 = r4216559 * r4216566;
double r4216568 = r4216565 + r4216567;
return r4216568;
}
double f(double d1, double d2, double d3) {
double r4216569 = 3.0;
double r4216570 = /* ERROR: no posit support in C */;
double r4216571 = /*Error: no posit support in C */;
double r4216572 = d3;
double r4216573 = 1.0;
double r4216574 = /* ERROR: no posit support in C */;
double r4216575 = /*Error: no posit support in C */;
double r4216576 = d2;
double r4216577 = /*Error: no posit support in C */;
double r4216578 = /*Error: no posit support in C */;
double r4216579 = d1;
double r4216580 = r4216578 * r4216579;
return r4216580;
}



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