Average Error: 0.0 → 0.0
Time: 18.4s
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 r178500 = x;
        double r178501 = y;
        double r178502 = r178501 - r178500;
        double r178503 = z;
        double r178504 = r178502 * r178503;
        double r178505 = r178500 + r178504;
        return r178505;
}
↓
double f(double x, double y, double z) {
        double r178506 = x;
        double r178507 = y;
        double r178508 = r178507 - r178506;
        double r178509 = z;
        double r178510 = r178508 * r178509;
        double r178511 = r178506 + r178510;
        return r178511;
}

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