Average Error: 0.0 → 0.0
Time: 12.6s
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 r86365 = x;
        double r86366 = y;
        double r86367 = r86365 * r86366;
        double r86368 = r86367 + r86365;
        double r86369 = r86368 + r86366;
        return r86369;
}
↓
double f(double x, double y) {
        double r86370 = x;
        double r86371 = y;
        double r86372 = r86370 * r86371;
        double r86373 = r86372 + r86370;
        double r86374 = r86373 + r86371;
        return r86374;
}

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