Average Error: 0.0 → 0.0
Time: 15.6s
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 r4821725 = x;
        double r4821726 = y;
        double r4821727 = r4821725 * r4821726;
        double r4821728 = r4821727 + r4821725;
        double r4821729 = r4821728 + r4821726;
        return r4821729;
}
↓
double f(double x, double y) {
        double r4821730 = y;
        double r4821731 = x;
        double r4821732 = r4821731 * r4821730;
        double r4821733 = r4821731 + r4821732;
        double r4821734 = r4821730 + r4821733;
        return r4821734;
}

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