Average Error: 0.0 → 0.0
Time: 356.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 r102759 = x;
        double r102760 = y;
        double r102761 = r102760 + r102760;
        double r102762 = r102759 * r102761;
        return r102762;
}
↓
double f(double x, double y) {
        double r102763 = x;
        double r102764 = y;
        double r102765 = r102764 + r102764;
        double r102766 = r102763 * r102765;
        return r102766;
}

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 2020020 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))