Average Error: 0.0 → 0.0
Time: 7.4s
Precision: 64
\[\left(x \cdot y + x\right) + y\]
↓
\[y + \left(x + x \cdot y\right)\]
\left(x \cdot y + x\right) + y
↓
y + \left(x + x \cdot y\right)
double f(double x, double y) {
        double r81650 = x;
        double r81651 = y;
        double r81652 = r81650 * r81651;
        double r81653 = r81652 + r81650;
        double r81654 = r81653 + r81651;
        return r81654;
}
↓
double f(double x, double y) {
        double r81655 = y;
        double r81656 = x;
        double r81657 = r81656 * r81655;
        double r81658 = r81656 + r81657;
        double r81659 = r81655 + r81658;
        return r81659;
}

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 y + \left(x + x \cdot y\right)\]

Reproduce

herbie shell --seed 2019195 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  (+ (+ (* x y) x) y))