Average Error: 0.0 → 0.0
Time: 19.7s
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 r158416 = x;
        double r158417 = y;
        double r158418 = r158417 - r158416;
        double r158419 = z;
        double r158420 = r158418 * r158419;
        double r158421 = r158416 + r158420;
        return r158421;
}
↓
double f(double x, double y, double z) {
        double r158422 = x;
        double r158423 = y;
        double r158424 = r158423 - r158422;
        double r158425 = z;
        double r158426 = r158424 * r158425;
        double r158427 = r158422 + r158426;
        return r158427;
}

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