Average Error: 0.0 → 0.0
Time: 2.9s
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 r148359 = x;
        double r148360 = y;
        double r148361 = r148359 * r148360;
        double r148362 = r148361 + r148359;
        double r148363 = r148362 + r148360;
        return r148363;
}
↓
double f(double x, double y) {
        double r148364 = x;
        double r148365 = y;
        double r148366 = r148364 * r148365;
        double r148367 = r148366 + r148364;
        double r148368 = r148367 + r148365;
        return r148368;
}

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