Average Error: 0.0 → 0.0
Time: 5.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 r102052 = x;
        double r102053 = y;
        double r102054 = r102052 * r102053;
        double r102055 = r102054 + r102052;
        double r102056 = r102055 + r102053;
        return r102056;
}
↓
double f(double x, double y) {
        double r102057 = x;
        double r102058 = y;
        double r102059 = r102057 * r102058;
        double r102060 = r102059 + r102057;
        double r102061 = r102060 + r102058;
        return r102061;
}

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))