Average Error: 0.0 → 0.0
Time: 8.0s
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 r436754 = x;
        double r436755 = y;
        double r436756 = r436755 - r436754;
        double r436757 = z;
        double r436758 = r436756 * r436757;
        double r436759 = r436754 + r436758;
        return r436759;
}
↓
double f(double x, double y, double z) {
        double r436760 = x;
        double r436761 = y;
        double r436762 = r436761 - r436760;
        double r436763 = z;
        double r436764 = r436762 * r436763;
        double r436765 = r436760 + r436764;
        return r436765;
}

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