Average Error: 0.0 → 0.0
Time: 20.8s
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 r6085443 = x;
        double r6085444 = y;
        double r6085445 = r6085443 * r6085444;
        double r6085446 = r6085445 + r6085443;
        double r6085447 = r6085446 + r6085444;
        return r6085447;
}
↓
double f(double x, double y) {
        double r6085448 = y;
        double r6085449 = x;
        double r6085450 = r6085449 * r6085448;
        double r6085451 = r6085449 + r6085450;
        double r6085452 = r6085448 + r6085451;
        return r6085452;
}

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))