Average Error: 0.0 → 0.0
Time: 8.4s
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 r74503 = x;
        double r74504 = y;
        double r74505 = r74503 * r74504;
        double r74506 = r74505 + r74503;
        double r74507 = r74506 + r74504;
        return r74507;
}
↓
double f(double x, double y) {
        double r74508 = x;
        double r74509 = y;
        double r74510 = r74508 * r74509;
        double r74511 = r74510 + r74508;
        double r74512 = r74511 + r74509;
        return r74512;
}

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