Average Error: 0.0 → 0.0
Time: 2.2s
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 r217552 = x;
        double r217553 = y;
        double r217554 = r217553 - r217552;
        double r217555 = z;
        double r217556 = r217554 * r217555;
        double r217557 = r217552 + r217556;
        return r217557;
}
↓
double f(double x, double y, double z) {
        double r217558 = x;
        double r217559 = y;
        double r217560 = r217559 - r217558;
        double r217561 = z;
        double r217562 = r217560 * r217561;
        double r217563 = r217558 + r217562;
        return r217563;
}

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