Average Error: 0.0 → 0.0
Time: 1.1s
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 r123981 = x;
        double r123982 = y;
        double r123983 = r123981 * r123982;
        double r123984 = r123983 + r123981;
        double r123985 = r123984 + r123982;
        return r123985;
}
↓
double f(double x, double y) {
        double r123986 = x;
        double r123987 = y;
        double r123988 = r123986 * r123987;
        double r123989 = r123988 + r123986;
        double r123990 = r123989 + r123987;
        return r123990;
}

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