Average Error: 0.0 → 0.0
Time: 339.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 r105772 = x;
        double r105773 = y;
        double r105774 = r105773 + r105773;
        double r105775 = r105772 * r105774;
        return r105775;
}
↓
double f(double x, double y) {
        double r105776 = x;
        double r105777 = y;
        double r105778 = r105777 + r105777;
        double r105779 = r105776 * r105778;
        return r105779;
}

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