Average Error: 0.0 → 0.0
Time: 3.5s
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 r217618 = x;
        double r217619 = y;
        double r217620 = r217619 - r217618;
        double r217621 = z;
        double r217622 = r217620 * r217621;
        double r217623 = r217618 + r217622;
        return r217623;
}
↓
double f(double x, double y, double z) {
        double r217624 = x;
        double r217625 = y;
        double r217626 = r217625 - r217624;
        double r217627 = z;
        double r217628 = r217626 * r217627;
        double r217629 = r217624 + r217628;
        return r217629;
}

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