Average Error: 0.0 → 0.0
Time: 351.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 r113239 = x;
        double r113240 = y;
        double r113241 = r113240 + r113240;
        double r113242 = r113239 * r113241;
        return r113242;
}
↓
double f(double x, double y) {
        double r113243 = x;
        double r113244 = y;
        double r113245 = r113244 + r113244;
        double r113246 = r113243 * r113245;
        return r113246;
}

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