Average Error: 0.0 → 0.0
Time: 5.3s
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 r153983 = x;
        double r153984 = y;
        double r153985 = r153983 * r153984;
        double r153986 = r153985 + r153983;
        double r153987 = r153986 + r153984;
        return r153987;
}
↓
double f(double x, double y) {
        double r153988 = x;
        double r153989 = y;
        double r153990 = r153988 * r153989;
        double r153991 = r153990 + r153988;
        double r153992 = r153991 + r153989;
        return r153992;
}

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