Average Error: 0.0 → 0.0
Time: 3.3s
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 r185540 = x;
        double r185541 = y;
        double r185542 = r185541 - r185540;
        double r185543 = z;
        double r185544 = r185542 * r185543;
        double r185545 = r185540 + r185544;
        return r185545;
}
↓
double f(double x, double y, double z) {
        double r185546 = x;
        double r185547 = y;
        double r185548 = r185547 - r185546;
        double r185549 = z;
        double r185550 = r185548 * r185549;
        double r185551 = r185546 + r185550;
        return r185551;
}

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