Average Error: 0.0 → 0.0
Time: 2.1s
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 r172992 = x;
        double r172993 = y;
        double r172994 = r172992 * r172993;
        double r172995 = r172994 + r172992;
        double r172996 = r172995 + r172993;
        return r172996;
}
↓
double f(double x, double y) {
        double r172997 = x;
        double r172998 = y;
        double r172999 = r172997 * r172998;
        double r173000 = r172999 + r172997;
        double r173001 = r173000 + r172998;
        return r173001;
}

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