Average Error: 0.0 → 0.0
Time: 15.3s
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 r127176 = x;
        double r127177 = y;
        double r127178 = r127177 - r127176;
        double r127179 = z;
        double r127180 = r127178 * r127179;
        double r127181 = r127176 + r127180;
        return r127181;
}
↓
double f(double x, double y, double z) {
        double r127182 = x;
        double r127183 = y;
        double r127184 = r127183 - r127182;
        double r127185 = z;
        double r127186 = r127184 * r127185;
        double r127187 = r127182 + r127186;
        return r127187;
}

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)))