Average Error: 0.0 → 0.0
Time: 3.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 r177237 = x;
        double r177238 = y;
        double r177239 = r177238 - r177237;
        double r177240 = z;
        double r177241 = r177239 * r177240;
        double r177242 = r177237 + r177241;
        return r177242;
}
↓
double f(double x, double y, double z) {
        double r177243 = x;
        double r177244 = y;
        double r177245 = r177244 - r177243;
        double r177246 = z;
        double r177247 = r177245 * r177246;
        double r177248 = r177243 + r177247;
        return r177248;
}

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