Average Error: 0.0 → 0.0
Time: 1.6s
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 r281545 = x;
        double r281546 = y;
        double r281547 = r281546 - r281545;
        double r281548 = z;
        double r281549 = r281547 * r281548;
        double r281550 = r281545 + r281549;
        return r281550;
}
↓
double f(double x, double y, double z) {
        double r281551 = x;
        double r281552 = y;
        double r281553 = r281552 - r281551;
        double r281554 = z;
        double r281555 = r281553 * r281554;
        double r281556 = r281551 + r281555;
        return r281556;
}

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