Average Error: 0.0 → 0.0
Time: 2.2s
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 r102659 = x;
        double r102660 = y;
        double r102661 = r102659 * r102660;
        double r102662 = r102661 + r102659;
        double r102663 = r102662 + r102660;
        return r102663;
}
↓
double f(double x, double y) {
        double r102664 = x;
        double r102665 = y;
        double r102666 = r102664 * r102665;
        double r102667 = r102666 + r102664;
        double r102668 = r102667 + r102665;
        return r102668;
}

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