Average Error: 0.0 → 0.0
Time: 3.2s
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 r152416 = x;
        double r152417 = y;
        double r152418 = r152416 * r152417;
        double r152419 = r152418 + r152416;
        double r152420 = r152419 + r152417;
        return r152420;
}
↓
double f(double x, double y) {
        double r152421 = x;
        double r152422 = y;
        double r152423 = r152421 * r152422;
        double r152424 = r152423 + r152421;
        double r152425 = r152424 + r152422;
        return r152425;
}

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