Average Error: 0.0 → 0.0
Time: 3.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 r88119 = x;
        double r88120 = y;
        double r88121 = r88119 * r88120;
        double r88122 = r88121 + r88119;
        double r88123 = r88122 + r88120;
        return r88123;
}
↓
double f(double x, double y) {
        double r88124 = x;
        double r88125 = y;
        double r88126 = r88124 * r88125;
        double r88127 = r88126 + r88124;
        double r88128 = r88127 + r88125;
        return r88128;
}

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