Average Error: 0.0 → 0.0
Time: 9.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 r102191 = x;
        double r102192 = y;
        double r102193 = r102191 * r102192;
        double r102194 = r102193 + r102191;
        double r102195 = r102194 + r102192;
        return r102195;
}
↓
double f(double x, double y) {
        double r102196 = x;
        double r102197 = y;
        double r102198 = r102196 * r102197;
        double r102199 = r102198 + r102196;
        double r102200 = r102199 + r102197;
        return r102200;
}

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