Average Error: 0.0 → 0.0
Time: 1.2s
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 r115599 = x;
        double r115600 = y;
        double r115601 = r115599 * r115600;
        double r115602 = r115601 + r115599;
        double r115603 = r115602 + r115600;
        return r115603;
}
↓
double f(double x, double y) {
        double r115604 = x;
        double r115605 = y;
        double r115606 = r115604 * r115605;
        double r115607 = r115606 + r115604;
        double r115608 = r115607 + r115605;
        return r115608;
}

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