Average Error: 0.0 → 0.0
Time: 4.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 r257243 = x;
        double r257244 = y;
        double r257245 = r257244 - r257243;
        double r257246 = z;
        double r257247 = r257245 * r257246;
        double r257248 = r257243 + r257247;
        return r257248;
}
↓
double f(double x, double y, double z) {
        double r257249 = x;
        double r257250 = y;
        double r257251 = r257250 - r257249;
        double r257252 = z;
        double r257253 = r257251 * r257252;
        double r257254 = r257249 + r257253;
        return r257254;
}

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