Average Error: 0.0 → 0.0
Time: 2.8s
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 r92819 = x;
        double r92820 = y;
        double r92821 = r92819 * r92820;
        double r92822 = r92821 + r92819;
        double r92823 = r92822 + r92820;
        return r92823;
}
↓
double f(double x, double y) {
        double r92824 = x;
        double r92825 = y;
        double r92826 = r92824 * r92825;
        double r92827 = r92826 + r92824;
        double r92828 = r92827 + r92825;
        return r92828;
}

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