Average Error: 0.0 → 0.0
Time: 4.4s
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 r160677 = x;
        double r160678 = y;
        double r160679 = r160677 * r160678;
        double r160680 = r160679 + r160677;
        double r160681 = r160680 + r160678;
        return r160681;
}
↓
double f(double x, double y) {
        double r160682 = x;
        double r160683 = y;
        double r160684 = r160682 * r160683;
        double r160685 = r160684 + r160682;
        double r160686 = r160685 + r160683;
        return r160686;
}

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