Average Error: 0.0 → 0.0
Time: 17.8s
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 r135463 = x;
        double r135464 = y;
        double r135465 = r135464 - r135463;
        double r135466 = z;
        double r135467 = r135465 * r135466;
        double r135468 = r135463 + r135467;
        return r135468;
}
↓
double f(double x, double y, double z) {
        double r135469 = x;
        double r135470 = y;
        double r135471 = r135470 - r135469;
        double r135472 = z;
        double r135473 = r135471 * r135472;
        double r135474 = r135469 + r135473;
        return r135474;
}

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