Average Error: 0.0 → 0.0
Time: 5.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 r94809 = x;
        double r94810 = y;
        double r94811 = r94809 * r94810;
        double r94812 = r94811 + r94809;
        double r94813 = r94812 + r94810;
        return r94813;
}
↓
double f(double x, double y) {
        double r94814 = x;
        double r94815 = y;
        double r94816 = r94814 * r94815;
        double r94817 = r94816 + r94814;
        double r94818 = r94817 + r94815;
        return r94818;
}

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