Average Error: 0.0 → 0.0
Time: 2.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 r92456 = x;
        double r92457 = y;
        double r92458 = r92456 * r92457;
        double r92459 = r92458 + r92456;
        double r92460 = r92459 + r92457;
        return r92460;
}
↓
double f(double x, double y) {
        double r92461 = x;
        double r92462 = y;
        double r92463 = r92461 * r92462;
        double r92464 = r92463 + r92461;
        double r92465 = r92464 + r92462;
        return r92465;
}

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