Average Error: 0.0 → 0.0
Time: 11.9s
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 r2231592 = x;
        double r2231593 = y;
        double r2231594 = r2231592 * r2231593;
        double r2231595 = r2231594 + r2231592;
        double r2231596 = r2231595 + r2231593;
        return r2231596;
}
↓
double f(double x, double y) {
        double r2231597 = y;
        double r2231598 = x;
        double r2231599 = r2231598 * r2231597;
        double r2231600 = r2231598 + r2231599;
        double r2231601 = r2231597 + r2231600;
        return r2231601;
}

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