Average Error: 0.0 → 0.0
Time: 1.4s
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 r153996 = x;
        double r153997 = y;
        double r153998 = r153996 * r153997;
        double r153999 = r153998 + r153996;
        double r154000 = r153999 + r153997;
        return r154000;
}
↓
double f(double x, double y) {
        double r154001 = x;
        double r154002 = y;
        double r154003 = r154001 * r154002;
        double r154004 = r154003 + r154001;
        double r154005 = r154004 + r154002;
        return r154005;
}

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