Average Error: 0.0 → 0.0
Time: 348.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 r138629 = x;
        double r138630 = y;
        double r138631 = r138630 + r138630;
        double r138632 = r138629 * r138631;
        return r138632;
}
↓
double f(double x, double y) {
        double r138633 = x;
        double r138634 = y;
        double r138635 = r138634 + r138634;
        double r138636 = r138633 * r138635;
        return r138636;
}

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