Average Error: 0.0 → 0.0
Time: 2.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 r120853 = x;
        double r120854 = y;
        double r120855 = r120853 * r120854;
        double r120856 = r120855 + r120853;
        double r120857 = r120856 + r120854;
        return r120857;
}
↓
double f(double x, double y) {
        double r120858 = x;
        double r120859 = y;
        double r120860 = r120858 * r120859;
        double r120861 = r120860 + r120858;
        double r120862 = r120861 + r120859;
        return r120862;
}

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