Average Error: 0.0 → 0.0
Time: 6.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 r126896 = x;
        double r126897 = y;
        double r126898 = r126896 * r126897;
        double r126899 = r126898 + r126896;
        double r126900 = r126899 + r126897;
        return r126900;
}
↓
double f(double x, double y) {
        double r126901 = x;
        double r126902 = y;
        double r126903 = r126901 * r126902;
        double r126904 = r126903 + r126901;
        double r126905 = r126904 + r126902;
        return r126905;
}

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