Average Error: 0.0 → 0.0
Time: 14.6s
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 r97277 = x;
        double r97278 = y;
        double r97279 = r97277 * r97278;
        double r97280 = r97279 + r97277;
        double r97281 = r97280 + r97278;
        return r97281;
}
↓
double f(double x, double y) {
        double r97282 = x;
        double r97283 = y;
        double r97284 = r97282 * r97283;
        double r97285 = r97284 + r97282;
        double r97286 = r97285 + r97283;
        return r97286;
}

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