Average Error: 0.0 → 0.0
Time: 2.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 r196393 = x;
        double r196394 = y;
        double r196395 = r196394 - r196393;
        double r196396 = z;
        double r196397 = r196395 * r196396;
        double r196398 = r196393 + r196397;
        return r196398;
}
↓
double f(double x, double y, double z) {
        double r196399 = x;
        double r196400 = y;
        double r196401 = r196400 - r196399;
        double r196402 = z;
        double r196403 = r196401 * r196402;
        double r196404 = r196399 + r196403;
        return r196404;
}

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