Average Error: 0.0 → 0.0
Time: 780.0ms
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 r76917 = x;
        double r76918 = y;
        double r76919 = r76917 * r76918;
        double r76920 = r76919 + r76917;
        double r76921 = r76920 + r76918;
        return r76921;
}
↓
double f(double x, double y) {
        double r76922 = x;
        double r76923 = y;
        double r76924 = r76922 * r76923;
        double r76925 = r76924 + r76922;
        double r76926 = r76925 + r76923;
        return r76926;
}

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