Average Error: 0.0 → 0.0
Time: 2.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 r104291 = x;
        double r104292 = y;
        double r104293 = r104291 * r104292;
        double r104294 = r104293 + r104291;
        double r104295 = r104294 + r104292;
        return r104295;
}
↓
double f(double x, double y) {
        double r104296 = x;
        double r104297 = y;
        double r104298 = r104296 * r104297;
        double r104299 = r104298 + r104296;
        double r104300 = r104299 + r104297;
        return r104300;
}

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