Average Error: 0.0 → 0.0
Time: 667.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 r109155 = x;
        double r109156 = y;
        double r109157 = r109155 * r109156;
        double r109158 = r109157 + r109155;
        double r109159 = r109158 + r109156;
        return r109159;
}
↓
double f(double x, double y) {
        double r109160 = x;
        double r109161 = y;
        double r109162 = r109160 * r109161;
        double r109163 = r109162 + r109160;
        double r109164 = r109163 + r109161;
        return r109164;
}

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