Average Error: 0.0 → 0.0
Time: 15.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 r94961 = x;
        double r94962 = y;
        double r94963 = r94961 * r94962;
        double r94964 = r94963 + r94961;
        double r94965 = r94964 + r94962;
        return r94965;
}
↓
double f(double x, double y) {
        double r94966 = x;
        double r94967 = y;
        double r94968 = r94966 * r94967;
        double r94969 = r94968 + r94966;
        double r94970 = r94969 + r94967;
        return r94970;
}

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