Average Error: 0.0 → 0.0
Time: 7.7s
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 r7384730 = x;
        double r7384731 = y;
        double r7384732 = r7384730 * r7384731;
        double r7384733 = r7384732 + r7384730;
        double r7384734 = r7384733 + r7384731;
        return r7384734;
}
↓
double f(double x, double y) {
        double r7384735 = x;
        double r7384736 = y;
        double r7384737 = r7384735 * r7384736;
        double r7384738 = r7384737 + r7384735;
        double r7384739 = r7384738 + r7384736;
        return r7384739;
}

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