Average Error: 0.0 → 0.0
Time: 14.6s
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 r148928 = x;
        double r148929 = y;
        double r148930 = r148929 - r148928;
        double r148931 = z;
        double r148932 = r148930 * r148931;
        double r148933 = r148928 + r148932;
        return r148933;
}
↓
double f(double x, double y, double z) {
        double r148934 = x;
        double r148935 = y;
        double r148936 = r148935 - r148934;
        double r148937 = z;
        double r148938 = r148936 * r148937;
        double r148939 = r148934 + r148938;
        return r148939;
}

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