Average Error: 0.0 → 0.0
Time: 634.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 r111162 = x;
        double r111163 = y;
        double r111164 = r111162 * r111163;
        double r111165 = r111164 + r111162;
        double r111166 = r111165 + r111163;
        return r111166;
}
↓
double f(double x, double y) {
        double r111167 = x;
        double r111168 = y;
        double r111169 = r111167 * r111168;
        double r111170 = r111169 + r111167;
        double r111171 = r111170 + r111168;
        return r111171;
}

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