Average Error: 0.0 → 0.0
Time: 3.8s
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 r94580 = x;
        double r94581 = y;
        double r94582 = r94580 * r94581;
        double r94583 = r94582 + r94580;
        double r94584 = r94583 + r94581;
        return r94584;
}
↓
double f(double x, double y) {
        double r94585 = x;
        double r94586 = y;
        double r94587 = r94585 * r94586;
        double r94588 = r94587 + r94585;
        double r94589 = r94588 + r94586;
        return r94589;
}

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