Average Error: 0.0 → 0.0
Time: 4.4s
Precision: 64
\[\left(x \cdot y + x\right) + y\]
↓
\[\left(x \cdot y + x\right) + y\]
\left(x \cdot y + x\right) + y
↓
\left(x \cdot y + x\right) + y
double f(double x, double y) {
        double r136655 = x;
        double r136656 = y;
        double r136657 = r136655 * r136656;
        double r136658 = r136657 + r136655;
        double r136659 = r136658 + r136656;
        return r136659;
}
↓
double f(double x, double y) {
        double r136660 = x;
        double r136661 = y;
        double r136662 = r136660 * r136661;
        double r136663 = r136662 + r136660;
        double r136664 = r136663 + r136661;
        return r136664;
}

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 \left(x \cdot y + x\right) + y\]

Reproduce

herbie shell --seed 2019347 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  :precision binary64
  (+ (+ (* x y) x) y))