Average Error: 0.0 → 0.0
Time: 3.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 r122805 = x;
        double r122806 = y;
        double r122807 = r122805 * r122806;
        double r122808 = r122807 + r122805;
        double r122809 = r122808 + r122806;
        return r122809;
}
↓
double f(double x, double y) {
        double r122810 = x;
        double r122811 = y;
        double r122812 = r122810 * r122811;
        double r122813 = r122812 + r122810;
        double r122814 = r122813 + r122811;
        return r122814;
}

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