Average Error: 0.0 → 0.0
Time: 1.0m
Precision: 64
\[\left(x \cdot y + x\right) + y\]
↓
\[\left(y \cdot x + x\right) + y\]
\left(x \cdot y + x\right) + y
↓
\left(y \cdot x + x\right) + y
double f(double x, double y) {
        double r5251515 = x;
        double r5251516 = y;
        double r5251517 = r5251515 * r5251516;
        double r5251518 = r5251517 + r5251515;
        double r5251519 = r5251518 + r5251516;
        return r5251519;
}
↓
double f(double x, double y) {
        double r5251520 = y;
        double r5251521 = x;
        double r5251522 = r5251520 * r5251521;
        double r5251523 = r5251522 + r5251521;
        double r5251524 = r5251523 + r5251520;
        return r5251524;
}

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

Reproduce

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