Average Error: 0.0 → 0.0
Time: 16.2s
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 r5571907 = x;
        double r5571908 = y;
        double r5571909 = r5571907 * r5571908;
        double r5571910 = r5571909 + r5571907;
        double r5571911 = r5571910 + r5571908;
        return r5571911;
}
↓
double f(double x, double y) {
        double r5571912 = y;
        double r5571913 = x;
        double r5571914 = r5571913 * r5571912;
        double r5571915 = r5571913 + r5571914;
        double r5571916 = r5571912 + r5571915;
        return r5571916;
}

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