Average Error: 0.0 → 0.0
Time: 7.7s
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 r257595 = x;
        double r257596 = y;
        double r257597 = r257596 - r257595;
        double r257598 = z;
        double r257599 = r257597 * r257598;
        double r257600 = r257595 + r257599;
        return r257600;
}
↓
double f(double x, double y, double z) {
        double r257601 = x;
        double r257602 = y;
        double r257603 = r257602 - r257601;
        double r257604 = z;
        double r257605 = r257603 * r257604;
        double r257606 = r257601 + r257605;
        return r257606;
}

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