Average Error: 0.0 → 0.0
Time: 17.0s
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 r114252 = x;
        double r114253 = y;
        double r114254 = r114253 - r114252;
        double r114255 = z;
        double r114256 = r114254 * r114255;
        double r114257 = r114252 + r114256;
        return r114257;
}
↓
double f(double x, double y, double z) {
        double r114258 = x;
        double r114259 = y;
        double r114260 = r114259 - r114258;
        double r114261 = z;
        double r114262 = r114260 * r114261;
        double r114263 = r114258 + r114262;
        return r114263;
}

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