Average Error: 0.0 → 0.0
Time: 9.1s
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 r175085 = x;
        double r175086 = y;
        double r175087 = r175086 - r175085;
        double r175088 = z;
        double r175089 = r175087 * r175088;
        double r175090 = r175085 + r175089;
        return r175090;
}
↓
double f(double x, double y, double z) {
        double r175091 = x;
        double r175092 = y;
        double r175093 = r175092 - r175091;
        double r175094 = z;
        double r175095 = r175093 * r175094;
        double r175096 = r175091 + r175095;
        return r175096;
}

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