Average Error: 0.0 → 0.0
Time: 11.8s
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 r164299 = x;
        double r164300 = y;
        double r164301 = r164300 - r164299;
        double r164302 = z;
        double r164303 = r164301 * r164302;
        double r164304 = r164299 + r164303;
        return r164304;
}
↓
double f(double x, double y, double z) {
        double r164305 = x;
        double r164306 = y;
        double r164307 = r164306 - r164305;
        double r164308 = z;
        double r164309 = r164307 * r164308;
        double r164310 = r164305 + r164309;
        return r164310;
}

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