Average Error: 0.0 → 0.0
Time: 916.0ms
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 r86869 = x;
        double r86870 = y;
        double r86871 = r86869 * r86870;
        double r86872 = r86871 + r86869;
        double r86873 = r86872 + r86870;
        return r86873;
}
↓
double f(double x, double y) {
        double r86874 = x;
        double r86875 = y;
        double r86876 = r86874 * r86875;
        double r86877 = r86876 + r86874;
        double r86878 = r86877 + r86875;
        return r86878;
}

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