Average Error: 0.0 → 0.0
Time: 1.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 r116002 = x;
        double r116003 = y;
        double r116004 = r116002 * r116003;
        double r116005 = r116004 + r116002;
        double r116006 = r116005 + r116003;
        return r116006;
}
↓
double f(double x, double y) {
        double r116007 = x;
        double r116008 = y;
        double r116009 = r116007 * r116008;
        double r116010 = r116009 + r116007;
        double r116011 = r116010 + r116008;
        return r116011;
}

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