Average Error: 0.0 → 0.0
Time: 3.5s
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 r200748 = x;
        double r200749 = y;
        double r200750 = r200749 - r200748;
        double r200751 = z;
        double r200752 = r200750 * r200751;
        double r200753 = r200748 + r200752;
        return r200753;
}
↓
double f(double x, double y, double z) {
        double r200754 = x;
        double r200755 = y;
        double r200756 = r200755 - r200754;
        double r200757 = z;
        double r200758 = r200756 * r200757;
        double r200759 = r200754 + r200758;
        return r200759;
}

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