Average Error: 0.0 → 0.0
Time: 1.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 r90680 = x;
        double r90681 = y;
        double r90682 = r90680 * r90681;
        double r90683 = r90682 + r90680;
        double r90684 = r90683 + r90681;
        return r90684;
}
↓
double f(double x, double y) {
        double r90685 = x;
        double r90686 = y;
        double r90687 = r90685 * r90686;
        double r90688 = r90687 + r90685;
        double r90689 = r90688 + r90686;
        return r90689;
}

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