Average Error: 0.0 → 0.0
Time: 6.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 r5029416 = x;
        double r5029417 = y;
        double r5029418 = r5029416 * r5029417;
        double r5029419 = r5029418 + r5029416;
        double r5029420 = r5029419 + r5029417;
        return r5029420;
}
↓
double f(double x, double y) {
        double r5029421 = y;
        double r5029422 = x;
        double r5029423 = r5029422 * r5029421;
        double r5029424 = r5029422 + r5029423;
        double r5029425 = r5029421 + r5029424;
        return r5029425;
}

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