Average Error: 0.0 → 0.0
Time: 4.3s
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 r237202 = x;
        double r237203 = y;
        double r237204 = r237203 - r237202;
        double r237205 = z;
        double r237206 = r237204 * r237205;
        double r237207 = r237202 + r237206;
        return r237207;
}
↓
double f(double x, double y, double z) {
        double r237208 = x;
        double r237209 = y;
        double r237210 = r237209 - r237208;
        double r237211 = z;
        double r237212 = r237210 * r237211;
        double r237213 = r237208 + r237212;
        return r237213;
}

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