Average Error: 0.0 → 0.0
Time: 3.5s
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 r129991 = x;
        double r129992 = y;
        double r129993 = r129991 * r129992;
        double r129994 = r129993 + r129991;
        double r129995 = r129994 + r129992;
        return r129995;
}
↓
double f(double x, double y) {
        double r129996 = x;
        double r129997 = y;
        double r129998 = r129996 * r129997;
        double r129999 = r129998 + r129996;
        double r130000 = r129999 + r129997;
        return r130000;
}

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