Average Error: 0.0 → 0.0
Time: 2.5s
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 r161855 = x;
        double r161856 = y;
        double r161857 = r161855 * r161856;
        double r161858 = r161857 + r161855;
        double r161859 = r161858 + r161856;
        return r161859;
}
↓
double f(double x, double y) {
        double r161860 = x;
        double r161861 = y;
        double r161862 = r161860 * r161861;
        double r161863 = r161862 + r161860;
        double r161864 = r161863 + r161861;
        return r161864;
}

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