Average Error: 0.0 → 0.0
Time: 652.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 r93677 = x;
        double r93678 = y;
        double r93679 = r93677 * r93678;
        double r93680 = r93679 + r93677;
        double r93681 = r93680 + r93678;
        return r93681;
}
↓
double f(double x, double y) {
        double r93682 = x;
        double r93683 = y;
        double r93684 = r93682 * r93683;
        double r93685 = r93684 + r93682;
        double r93686 = r93685 + r93683;
        return r93686;
}

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))