Average Error: 0.0 → 0.0
Time: 5.2s
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 r846 = x;
        double r847 = y;
        double r848 = r847 - r846;
        double r849 = z;
        double r850 = r848 * r849;
        double r851 = r846 + r850;
        return r851;
}
↓
double f(double x, double y, double z) {
        double r852 = x;
        double r853 = y;
        double r854 = r853 - r852;
        double r855 = z;
        double r856 = r854 * r855;
        double r857 = r852 + r856;
        return r857;
}

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 2020025 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, B"
  :precision binary64
  (+ x (* (- y x) z)))