Average Error: 0.0 → 0.0
Time: 13.0s
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 r105420 = x;
        double r105421 = y;
        double r105422 = r105420 * r105421;
        double r105423 = r105422 + r105420;
        double r105424 = r105423 + r105421;
        return r105424;
}
↓
double f(double x, double y) {
        double r105425 = x;
        double r105426 = y;
        double r105427 = r105425 * r105426;
        double r105428 = r105427 + r105425;
        double r105429 = r105428 + r105426;
        return r105429;
}

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