Average Error: 0.0 → 0.0
Time: 13.0s
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 r93115 = x;
        double r93116 = y;
        double r93117 = r93115 * r93116;
        double r93118 = r93117 + r93115;
        double r93119 = r93118 + r93116;
        return r93119;
}
↓
double f(double x, double y) {
        double r93120 = x;
        double r93121 = y;
        double r93122 = r93120 * r93121;
        double r93123 = r93122 + r93120;
        double r93124 = r93123 + r93121;
        return r93124;
}

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