Average Error: 0.0 → 0.0
Time: 19.8s
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 r163727 = x;
        double r163728 = y;
        double r163729 = r163728 - r163727;
        double r163730 = z;
        double r163731 = r163729 * r163730;
        double r163732 = r163727 + r163731;
        return r163732;
}
↓
double f(double x, double y, double z) {
        double r163733 = x;
        double r163734 = y;
        double r163735 = r163734 - r163733;
        double r163736 = z;
        double r163737 = r163735 * r163736;
        double r163738 = r163733 + r163737;
        return r163738;
}

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