Average Error: 0.0 → 0.0
Time: 9.3s
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 r4515747 = x;
        double r4515748 = y;
        double r4515749 = r4515747 * r4515748;
        double r4515750 = r4515749 + r4515747;
        double r4515751 = r4515750 + r4515748;
        return r4515751;
}
↓
double f(double x, double y) {
        double r4515752 = y;
        double r4515753 = x;
        double r4515754 = r4515753 * r4515752;
        double r4515755 = r4515753 + r4515754;
        double r4515756 = r4515752 + r4515755;
        return r4515756;
}

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))