Average Error: 0.0 → 0.0
Time: 20.5s
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 r6110391 = x;
        double r6110392 = y;
        double r6110393 = r6110391 * r6110392;
        double r6110394 = r6110393 + r6110391;
        double r6110395 = r6110394 + r6110392;
        return r6110395;
}
↓
double f(double x, double y) {
        double r6110396 = y;
        double r6110397 = x;
        double r6110398 = r6110397 * r6110396;
        double r6110399 = r6110397 + r6110398;
        double r6110400 = r6110396 + r6110399;
        return r6110400;
}

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