Average Error: 0.0 → 0.0
Time: 2.6s
Precision: 64
\[x + \left(y - x\right) \cdot z\]
↓
\[x + \left(y - x\right) \cdot z\]
x + \left(y - x\right) \cdot z
↓
x + \left(y - x\right) \cdot z
double f(double x, double y, double z) {
        double r220763 = x;
        double r220764 = y;
        double r220765 = r220764 - r220763;
        double r220766 = z;
        double r220767 = r220765 * r220766;
        double r220768 = r220763 + r220767;
        return r220768;
}
↓
double f(double x, double y, double z) {
        double r220769 = x;
        double r220770 = y;
        double r220771 = r220770 - r220769;
        double r220772 = z;
        double r220773 = r220771 * r220772;
        double r220774 = r220769 + r220773;
        return r220774;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + \left(y - x\right) \cdot z\]

  2. Final simplification0.0

    \[\leadsto x + \left(y - x\right) \cdot z\]

Reproduce

herbie shell --seed 2019353 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, B"
  :precision binary64
  (+ x (* (- y x) z)))