Average Error: 0.0 → 0.0
Time: 397.0ms
Precision: 64
\[x \cdot \left(y + y\right)\]
↓
\[x \cdot \left(y + y\right)\]
x \cdot \left(y + y\right)
↓
x \cdot \left(y + y\right)
double f(double x, double y) {
        double r124768 = x;
        double r124769 = y;
        double r124770 = r124769 + r124769;
        double r124771 = r124768 * r124770;
        return r124771;
}
↓
double f(double x, double y) {
        double r124772 = x;
        double r124773 = y;
        double r124774 = r124773 + r124773;
        double r124775 = r124772 * r124774;
        return r124775;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0.0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2020064 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))