Average Error: 0.0 → 0.0
Time: 394.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 r142286 = x;
        double r142287 = y;
        double r142288 = r142287 + r142287;
        double r142289 = r142286 * r142288;
        return r142289;
}
↓
double f(double x, double y) {
        double r142290 = x;
        double r142291 = y;
        double r142292 = r142291 + r142291;
        double r142293 = r142290 * r142292;
        return r142293;
}

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