Average Error: 0.0 → 0.0
Time: 3.4s
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 r168517 = x;
        double r168518 = y;
        double r168519 = r168518 - r168517;
        double r168520 = z;
        double r168521 = r168519 * r168520;
        double r168522 = r168517 + r168521;
        return r168522;
}
↓
double f(double x, double y, double z) {
        double r168523 = x;
        double r168524 = y;
        double r168525 = r168524 - r168523;
        double r168526 = z;
        double r168527 = r168525 * r168526;
        double r168528 = r168523 + r168527;
        return r168528;
}

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)))