Average Error: 0.0 → 0.0
Time: 644.0ms
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 r116767 = x;
        double r116768 = y;
        double r116769 = r116767 * r116768;
        double r116770 = r116769 + r116767;
        double r116771 = r116770 + r116768;
        return r116771;
}
↓
double f(double x, double y) {
        double r116772 = x;
        double r116773 = y;
        double r116774 = r116772 * r116773;
        double r116775 = r116774 + r116772;
        double r116776 = r116775 + r116773;
        return r116776;
}

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