Average Error: 0.0 → 0.0
Time: 1.6s
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 r121772 = x;
        double r121773 = y;
        double r121774 = r121772 * r121773;
        double r121775 = r121774 + r121772;
        double r121776 = r121775 + r121773;
        return r121776;
}
↓
double f(double x, double y) {
        double r121777 = x;
        double r121778 = y;
        double r121779 = r121777 * r121778;
        double r121780 = r121779 + r121777;
        double r121781 = r121780 + r121778;
        return r121781;
}

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