Average Error: 0.0 → 0.0
Time: 15.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 r88166 = x;
        double r88167 = y;
        double r88168 = r88166 * r88167;
        double r88169 = r88168 + r88166;
        double r88170 = r88169 + r88167;
        return r88170;
}
↓
double f(double x, double y) {
        double r88171 = x;
        double r88172 = y;
        double r88173 = r88171 * r88172;
        double r88174 = r88173 + r88171;
        double r88175 = r88174 + r88172;
        return r88175;
}

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