Average Error: 0.0 → 0.0
Time: 490.0ms
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 r82380 = x;
        double r82381 = y;
        double r82382 = r82380 * r82381;
        double r82383 = r82382 + r82380;
        double r82384 = r82383 + r82381;
        return r82384;
}
↓
double f(double x, double y) {
        double r82385 = x;
        double r82386 = y;
        double r82387 = r82385 * r82386;
        double r82388 = r82387 + r82385;
        double r82389 = r82388 + r82386;
        return r82389;
}

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