Average Error: 0.0 → 0.0
Time: 21.5s
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 r122799 = x;
        double r122800 = y;
        double r122801 = r122800 - r122799;
        double r122802 = z;
        double r122803 = r122801 * r122802;
        double r122804 = r122799 + r122803;
        return r122804;
}
↓
double f(double x, double y, double z) {
        double r122805 = x;
        double r122806 = y;
        double r122807 = r122806 - r122805;
        double r122808 = z;
        double r122809 = r122807 * r122808;
        double r122810 = r122805 + r122809;
        return r122810;
}

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