Average Error: 0.0 → 0.0
Time: 1.5s
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 r114136 = x;
        double r114137 = y;
        double r114138 = r114136 * r114137;
        double r114139 = r114138 + r114136;
        double r114140 = r114139 + r114137;
        return r114140;
}
↓
double f(double x, double y) {
        double r114141 = x;
        double r114142 = y;
        double r114143 = r114141 * r114142;
        double r114144 = r114143 + r114141;
        double r114145 = r114144 + r114142;
        return r114145;
}

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