Average Error: 0.0 → 0.0
Time: 12.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 r7260237 = x;
        double r7260238 = y;
        double r7260239 = r7260237 * r7260238;
        double r7260240 = r7260239 + r7260237;
        double r7260241 = r7260240 + r7260238;
        return r7260241;
}
↓
double f(double x, double y) {
        double r7260242 = y;
        double r7260243 = x;
        double r7260244 = r7260243 * r7260242;
        double r7260245 = r7260243 + r7260244;
        double r7260246 = r7260242 + r7260245;
        return r7260246;
}

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