Average Error: 0.0 → 0.0
Time: 658.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 r124123 = x;
        double r124124 = y;
        double r124125 = r124123 * r124124;
        double r124126 = r124125 + r124123;
        double r124127 = r124126 + r124124;
        return r124127;
}
↓
double f(double x, double y) {
        double r124128 = x;
        double r124129 = y;
        double r124130 = r124128 * r124129;
        double r124131 = r124130 + r124128;
        double r124132 = r124131 + r124129;
        return r124132;
}

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