Average Error: 0.0 → 0.0
Time: 6.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 r78221 = x;
        double r78222 = y;
        double r78223 = r78221 * r78222;
        double r78224 = r78223 + r78221;
        double r78225 = r78224 + r78222;
        return r78225;
}
↓
double f(double x, double y) {
        double r78226 = x;
        double r78227 = y;
        double r78228 = r78226 * r78227;
        double r78229 = r78228 + r78226;
        double r78230 = r78229 + r78227;
        return r78230;
}

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