Average Error: 0.0 → 0.0
Time: 7.9s
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 r125692 = x;
        double r125693 = y;
        double r125694 = r125692 * r125693;
        double r125695 = r125694 + r125692;
        double r125696 = r125695 + r125693;
        return r125696;
}
↓
double f(double x, double y) {
        double r125697 = x;
        double r125698 = y;
        double r125699 = r125697 * r125698;
        double r125700 = r125699 + r125697;
        double r125701 = r125700 + r125698;
        return r125701;
}

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