Average Error: 0.0 → 0.0
Time: 2.0s
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 r93079 = x;
        double r93080 = y;
        double r93081 = r93079 * r93080;
        double r93082 = r93081 + r93079;
        double r93083 = r93082 + r93080;
        return r93083;
}
↓
double f(double x, double y) {
        double r93084 = x;
        double r93085 = y;
        double r93086 = r93084 * r93085;
        double r93087 = r93086 + r93084;
        double r93088 = r93087 + r93085;
        return r93088;
}

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