Average Error: 0.0 → 0.0
Time: 2.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 r120482 = x;
        double r120483 = y;
        double r120484 = r120482 * r120483;
        double r120485 = r120484 + r120482;
        double r120486 = r120485 + r120483;
        return r120486;
}
↓
double f(double x, double y) {
        double r120487 = x;
        double r120488 = y;
        double r120489 = r120487 * r120488;
        double r120490 = r120489 + r120487;
        double r120491 = r120490 + r120488;
        return r120491;
}

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