Average Error: 0.0 → 0.0
Time: 6.7s
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 r81663 = x;
        double r81664 = y;
        double r81665 = r81663 * r81664;
        double r81666 = r81665 + r81663;
        double r81667 = r81666 + r81664;
        return r81667;
}
↓
double f(double x, double y) {
        double r81668 = x;
        double r81669 = y;
        double r81670 = r81668 * r81669;
        double r81671 = r81670 + r81668;
        double r81672 = r81671 + r81669;
        return r81672;
}

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