Average Error: 0.0 → 0.0
Time: 7.9s
Precision: 64
\[\left(x \cdot y + x\right) + y\]
↓
\[\left(x \cdot y + x\right) + y\]
\left(x \cdot y + x\right) + y
↓
\left(x \cdot y + x\right) + y
double f(double x, double y) {
        double r87804 = x;
        double r87805 = y;
        double r87806 = r87804 * r87805;
        double r87807 = r87806 + r87804;
        double r87808 = r87807 + r87805;
        return r87808;
}
↓
double f(double x, double y) {
        double r87809 = x;
        double r87810 = y;
        double r87811 = r87809 * r87810;
        double r87812 = r87811 + r87809;
        double r87813 = r87812 + r87810;
        return r87813;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x \cdot y + x\right) + y\]

  2. Final simplification0.0

    \[\leadsto \left(x \cdot y + x\right) + y\]

Reproduce

herbie shell --seed 2019323 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  :precision binary64
  (+ (+ (* x y) x) y))