Average Error: 0.0 → 0.0
Time: 3.4s
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 r110414 = x;
        double r110415 = y;
        double r110416 = r110414 * r110415;
        double r110417 = r110416 + r110414;
        double r110418 = r110417 + r110415;
        return r110418;
}
↓
double f(double x, double y) {
        double r110419 = x;
        double r110420 = y;
        double r110421 = r110419 * r110420;
        double r110422 = r110421 + r110419;
        double r110423 = r110422 + r110420;
        return r110423;
}

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