Average Error: 0.0 → 0.0
Time: 894.0ms
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 r86010 = x;
        double r86011 = y;
        double r86012 = r86010 * r86011;
        double r86013 = r86012 + r86010;
        double r86014 = r86013 + r86011;
        return r86014;
}
↓
double f(double x, double y) {
        double r86015 = x;
        double r86016 = y;
        double r86017 = r86015 * r86016;
        double r86018 = r86017 + r86015;
        double r86019 = r86018 + r86016;
        return r86019;
}

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 2019325 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  :precision binary64
  (+ (+ (* x y) x) y))