Average Error: 0.0 → 0.0
Time: 637.0ms
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 r100903 = x;
        double r100904 = y;
        double r100905 = r100903 * r100904;
        double r100906 = r100905 + r100903;
        double r100907 = r100906 + r100904;
        return r100907;
}
↓
double f(double x, double y) {
        double r100908 = x;
        double r100909 = y;
        double r100910 = r100908 * r100909;
        double r100911 = r100910 + r100908;
        double r100912 = r100911 + r100909;
        return r100912;
}

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