Average Error: 0.0 → 0.0
Time: 7.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 r5342541 = x;
        double r5342542 = y;
        double r5342543 = r5342541 * r5342542;
        double r5342544 = r5342543 + r5342541;
        double r5342545 = r5342544 + r5342542;
        return r5342545;
}
↓
double f(double x, double y) {
        double r5342546 = y;
        double r5342547 = x;
        double r5342548 = r5342547 * r5342546;
        double r5342549 = r5342547 + r5342548;
        double r5342550 = r5342546 + r5342549;
        return r5342550;
}

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