Average Error: 0.0 → 0.0
Time: 18.0s
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 r4242740 = x;
        double r4242741 = y;
        double r4242742 = r4242740 * r4242741;
        double r4242743 = r4242742 + r4242740;
        double r4242744 = r4242743 + r4242741;
        return r4242744;
}
↓
double f(double x, double y) {
        double r4242745 = y;
        double r4242746 = x;
        double r4242747 = r4242746 * r4242745;
        double r4242748 = r4242746 + r4242747;
        double r4242749 = r4242745 + r4242748;
        return r4242749;
}

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