Average Error: 0.0 → 0.0
Time: 9.4s
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 r64891 = x;
        double r64892 = y;
        double r64893 = r64891 * r64892;
        double r64894 = r64893 + r64891;
        double r64895 = r64894 + r64892;
        return r64895;
}
↓
double f(double x, double y) {
        double r64896 = x;
        double r64897 = y;
        double r64898 = r64896 * r64897;
        double r64899 = r64898 + r64896;
        double r64900 = r64899 + r64897;
        return r64900;
}

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