Average Error: 0.0 → 0.0
Time: 3.4s
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 r91614 = x;
        double r91615 = y;
        double r91616 = r91614 * r91615;
        double r91617 = r91616 + r91614;
        double r91618 = r91617 + r91615;
        return r91618;
}
↓
double f(double x, double y) {
        double r91619 = x;
        double r91620 = y;
        double r91621 = r91619 * r91620;
        double r91622 = r91621 + r91619;
        double r91623 = r91622 + r91620;
        return r91623;
}

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