Average Error: 0.0 → 0.0
Time: 4.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 r287171 = x;
        double r287172 = y;
        double r287173 = r287172 - r287171;
        double r287174 = z;
        double r287175 = r287173 * r287174;
        double r287176 = r287171 + r287175;
        return r287176;
}
↓
double f(double x, double y, double z) {
        double r287177 = x;
        double r287178 = y;
        double r287179 = r287178 - r287177;
        double r287180 = z;
        double r287181 = r287179 * r287180;
        double r287182 = r287177 + r287181;
        return r287182;
}

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