Average Error: 0.0 → 0.0
Time: 2.6s
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 r271985 = x;
        double r271986 = y;
        double r271987 = r271986 - r271985;
        double r271988 = z;
        double r271989 = r271987 * r271988;
        double r271990 = r271985 + r271989;
        return r271990;
}
↓
double f(double x, double y, double z) {
        double r271991 = x;
        double r271992 = y;
        double r271993 = r271992 - r271991;
        double r271994 = z;
        double r271995 = r271993 * r271994;
        double r271996 = r271991 + r271995;
        return r271996;
}

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