Average Error: 0.0 → 0.0
Time: 1.6s
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 r133354 = x;
        double r133355 = y;
        double r133356 = r133354 * r133355;
        double r133357 = r133356 + r133354;
        double r133358 = r133357 + r133355;
        return r133358;
}
↓
double f(double x, double y) {
        double r133359 = x;
        double r133360 = y;
        double r133361 = r133359 * r133360;
        double r133362 = r133361 + r133359;
        double r133363 = r133362 + r133360;
        return r133363;
}

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