Average Error: 0.0 → 0.0
Time: 16.1s
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 r155348 = x;
        double r155349 = y;
        double r155350 = r155349 - r155348;
        double r155351 = z;
        double r155352 = r155350 * r155351;
        double r155353 = r155348 + r155352;
        return r155353;
}
↓
double f(double x, double y, double z) {
        double r155354 = x;
        double r155355 = y;
        double r155356 = r155355 - r155354;
        double r155357 = z;
        double r155358 = r155356 * r155357;
        double r155359 = r155354 + r155358;
        return r155359;
}

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