Average Error: 0.0 → 0.0
Time: 5.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 r229439 = x;
        double r229440 = y;
        double r229441 = r229440 - r229439;
        double r229442 = z;
        double r229443 = r229441 * r229442;
        double r229444 = r229439 + r229443;
        return r229444;
}
↓
double f(double x, double y, double z) {
        double r229445 = x;
        double r229446 = y;
        double r229447 = r229446 - r229445;
        double r229448 = z;
        double r229449 = r229447 * r229448;
        double r229450 = r229445 + r229449;
        return r229450;
}

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