Average Error: 0.0 → 0.0
Time: 6.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 r65797 = x;
        double r65798 = y;
        double r65799 = r65797 * r65798;
        double r65800 = r65799 + r65797;
        double r65801 = r65800 + r65798;
        return r65801;
}
↓
double f(double x, double y) {
        double r65802 = y;
        double r65803 = x;
        double r65804 = r65803 * r65802;
        double r65805 = r65803 + r65804;
        double r65806 = r65802 + r65805;
        return r65806;
}

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