Average Error: 0.0 → 0.0
Time: 2.1s
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 r140133 = x;
        double r140134 = y;
        double r140135 = r140134 - r140133;
        double r140136 = z;
        double r140137 = r140135 * r140136;
        double r140138 = r140133 + r140137;
        return r140138;
}
↓
double f(double x, double y, double z) {
        double r140139 = x;
        double r140140 = y;
        double r140141 = r140140 - r140139;
        double r140142 = z;
        double r140143 = r140141 * r140142;
        double r140144 = r140139 + r140143;
        return r140144;
}

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