Average Error: 0.0 → 0.0
Time: 7.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 r226027 = x;
        double r226028 = y;
        double r226029 = r226028 - r226027;
        double r226030 = z;
        double r226031 = r226029 * r226030;
        double r226032 = r226027 + r226031;
        return r226032;
}
↓
double f(double x, double y, double z) {
        double r226033 = x;
        double r226034 = y;
        double r226035 = r226034 - r226033;
        double r226036 = z;
        double r226037 = r226035 * r226036;
        double r226038 = r226033 + r226037;
        return r226038;
}

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