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 r58457 = x;
        double r58458 = y;
        double r58459 = r58457 * r58458;
        double r58460 = r58459 + r58457;
        double r58461 = r58460 + r58458;
        return r58461;
}
↓
double f(double x, double y) {
        double r58462 = x;
        double r58463 = y;
        double r58464 = r58462 * r58463;
        double r58465 = r58464 + r58462;
        double r58466 = r58465 + r58463;
        return r58466;
}

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