Average Error: 0.0 → 0.0
Time: 1.9s
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 r154468 = x;
        double r154469 = y;
        double r154470 = r154468 * r154469;
        double r154471 = r154470 + r154468;
        double r154472 = r154471 + r154469;
        return r154472;
}
↓
double f(double x, double y) {
        double r154473 = x;
        double r154474 = y;
        double r154475 = r154473 * r154474;
        double r154476 = r154475 + r154473;
        double r154477 = r154476 + r154474;
        return r154477;
}

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))