Average Error: 0.0 → 0.0
Time: 2.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 r100795 = x;
        double r100796 = y;
        double r100797 = r100795 * r100796;
        double r100798 = r100797 + r100795;
        double r100799 = r100798 + r100796;
        return r100799;
}
↓
double f(double x, double y) {
        double r100800 = x;
        double r100801 = y;
        double r100802 = r100800 * r100801;
        double r100803 = r100802 + r100800;
        double r100804 = r100803 + r100801;
        return r100804;
}

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