Average Error: 0.0 → 0.0
Time: 16.4s
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 r175294 = x;
        double r175295 = y;
        double r175296 = r175295 - r175294;
        double r175297 = z;
        double r175298 = r175296 * r175297;
        double r175299 = r175294 + r175298;
        return r175299;
}
↓
double f(double x, double y, double z) {
        double r175300 = x;
        double r175301 = y;
        double r175302 = r175301 - r175300;
        double r175303 = z;
        double r175304 = r175302 * r175303;
        double r175305 = r175300 + r175304;
        return r175305;
}

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