Average Error: 0.0 → 0.0
Time: 638.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 r91298 = x;
        double r91299 = y;
        double r91300 = r91298 * r91299;
        double r91301 = r91300 + r91298;
        double r91302 = r91301 + r91299;
        return r91302;
}
↓
double f(double x, double y) {
        double r91303 = x;
        double r91304 = y;
        double r91305 = r91303 * r91304;
        double r91306 = r91305 + r91303;
        double r91307 = r91306 + r91304;
        return r91307;
}

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