Average Error: 0.0 → 0.0
Time: 9.7s
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 r111988 = x;
        double r111989 = y;
        double r111990 = r111988 * r111989;
        double r111991 = r111990 + r111988;
        double r111992 = r111991 + r111989;
        return r111992;
}
↓
double f(double x, double y) {
        double r111993 = x;
        double r111994 = y;
        double r111995 = r111993 * r111994;
        double r111996 = r111995 + r111993;
        double r111997 = r111996 + r111994;
        return r111997;
}

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