Average Error: 0.0 → 0.0
Time: 5.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 r61195 = x;
        double r61196 = y;
        double r61197 = r61195 * r61196;
        double r61198 = r61197 + r61195;
        double r61199 = r61198 + r61196;
        return r61199;
}
↓
double f(double x, double y) {
        double r61200 = x;
        double r61201 = y;
        double r61202 = r61200 * r61201;
        double r61203 = r61202 + r61200;
        double r61204 = r61203 + r61201;
        return r61204;
}

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