Average Error: 0.0 → 0.0
Time: 2.0s
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 r131624 = x;
        double r131625 = y;
        double r131626 = r131624 * r131625;
        double r131627 = r131626 + r131624;
        double r131628 = r131627 + r131625;
        return r131628;
}
↓
double f(double x, double y) {
        double r131629 = x;
        double r131630 = y;
        double r131631 = r131629 * r131630;
        double r131632 = r131631 + r131629;
        double r131633 = r131632 + r131630;
        return r131633;
}

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