Average Error: 0.0 → 0.0
Time: 652.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 r131478 = x;
        double r131479 = y;
        double r131480 = r131478 * r131479;
        double r131481 = r131480 + r131478;
        double r131482 = r131481 + r131479;
        return r131482;
}
↓
double f(double x, double y) {
        double r131483 = x;
        double r131484 = y;
        double r131485 = r131483 * r131484;
        double r131486 = r131485 + r131483;
        double r131487 = r131486 + r131484;
        return r131487;
}

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