Average Error: 0.0 → 0.0
Time: 1.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 r111770 = x;
        double r111771 = y;
        double r111772 = r111770 * r111771;
        double r111773 = r111772 + r111770;
        double r111774 = r111773 + r111771;
        return r111774;
}
↓
double f(double x, double y) {
        double r111775 = x;
        double r111776 = y;
        double r111777 = r111775 * r111776;
        double r111778 = r111777 + r111775;
        double r111779 = r111778 + r111776;
        return r111779;
}

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