Average Error: 0.0 → 0.0
Time: 740.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 r61238 = x;
        double r61239 = y;
        double r61240 = r61239 + r61239;
        double r61241 = r61238 * r61240;
        return r61241;
}
↓
double f(double x, double y) {
        double r61242 = x;
        double r61243 = y;
        double r61244 = r61243 + r61243;
        double r61245 = r61242 * r61244;
        return r61245;
}

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