Average Error: 0.0 → 0.0
Time: 4.9s
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 r102978 = x;
        double r102979 = y;
        double r102980 = r102978 * r102979;
        double r102981 = r102980 + r102978;
        double r102982 = r102981 + r102979;
        return r102982;
}
↓
double f(double x, double y) {
        double r102983 = x;
        double r102984 = y;
        double r102985 = r102983 * r102984;
        double r102986 = r102985 + r102983;
        double r102987 = r102986 + r102984;
        return r102987;
}

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