Average Error: 0.0 → 0.0
Time: 11.0s
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 r162080 = x;
        double r162081 = y;
        double r162082 = r162081 - r162080;
        double r162083 = z;
        double r162084 = r162082 * r162083;
        double r162085 = r162080 + r162084;
        return r162085;
}
↓
double f(double x, double y, double z) {
        double r162086 = x;
        double r162087 = y;
        double r162088 = r162087 - r162086;
        double r162089 = z;
        double r162090 = r162088 * r162089;
        double r162091 = r162086 + r162090;
        return r162091;
}

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