Average Error: 0.0 → 0.0
Time: 1.7s
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 r199685 = x;
        double r199686 = y;
        double r199687 = r199686 - r199685;
        double r199688 = z;
        double r199689 = r199687 * r199688;
        double r199690 = r199685 + r199689;
        return r199690;
}
↓
double f(double x, double y, double z) {
        double r199691 = x;
        double r199692 = y;
        double r199693 = r199692 - r199691;
        double r199694 = z;
        double r199695 = r199693 * r199694;
        double r199696 = r199691 + r199695;
        return r199696;
}

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