Average Error: 0.0 → 0.0
Time: 8.5s
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 r66745 = x;
        double r66746 = y;
        double r66747 = r66745 * r66746;
        double r66748 = r66747 + r66745;
        double r66749 = r66748 + r66746;
        return r66749;
}
↓
double f(double x, double y) {
        double r66750 = x;
        double r66751 = y;
        double r66752 = r66750 * r66751;
        double r66753 = r66752 + r66750;
        double r66754 = r66753 + r66751;
        return r66754;
}

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))