Average Error: 0.0 → 0.0
Time: 830.0ms
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 r208388 = x;
        double r208389 = y;
        double r208390 = r208389 - r208388;
        double r208391 = z;
        double r208392 = r208390 * r208391;
        double r208393 = r208388 + r208392;
        return r208393;
}
↓
double f(double x, double y, double z) {
        double r208394 = x;
        double r208395 = y;
        double r208396 = r208395 - r208394;
        double r208397 = z;
        double r208398 = r208396 * r208397;
        double r208399 = r208394 + r208398;
        return r208399;
}

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