Average Error: 0.0 → 0.0
Time: 435.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 r109841 = x;
        double r109842 = y;
        double r109843 = r109842 + r109842;
        double r109844 = r109841 * r109843;
        return r109844;
}
↓
double f(double x, double y) {
        double r109845 = x;
        double r109846 = y;
        double r109847 = r109846 + r109846;
        double r109848 = r109845 * r109847;
        return r109848;
}

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