Average Error: 0.0 → 0.0
Time: 851.0ms
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 r78654 = x;
        double r78655 = y;
        double r78656 = r78654 * r78655;
        double r78657 = r78656 + r78654;
        double r78658 = r78657 + r78655;
        return r78658;
}
↓
double f(double x, double y) {
        double r78659 = x;
        double r78660 = y;
        double r78661 = r78659 * r78660;
        double r78662 = r78661 + r78659;
        double r78663 = r78662 + r78660;
        return r78663;
}

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