Average Error: 0.0 → 0.0
Time: 4.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 r177251 = x;
        double r177252 = y;
        double r177253 = r177252 - r177251;
        double r177254 = z;
        double r177255 = r177253 * r177254;
        double r177256 = r177251 + r177255;
        return r177256;
}
↓
double f(double x, double y, double z) {
        double r177257 = x;
        double r177258 = y;
        double r177259 = r177258 - r177257;
        double r177260 = z;
        double r177261 = r177259 * r177260;
        double r177262 = r177257 + r177261;
        return r177262;
}

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