Average Error: 0.0 → 0.0
Time: 20.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 r5593754 = x;
        double r5593755 = y;
        double r5593756 = r5593754 * r5593755;
        double r5593757 = r5593756 + r5593754;
        double r5593758 = r5593757 + r5593755;
        return r5593758;
}
↓
double f(double x, double y) {
        double r5593759 = y;
        double r5593760 = x;
        double r5593761 = r5593760 * r5593759;
        double r5593762 = r5593760 + r5593761;
        double r5593763 = r5593759 + r5593762;
        return r5593763;
}

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