Average Error: 0.0 → 0.0
Time: 740.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 r85765 = x;
        double r85766 = y;
        double r85767 = r85766 + r85766;
        double r85768 = r85765 * r85767;
        return r85768;
}
↓
double f(double x, double y) {
        double r85769 = x;
        double r85770 = y;
        double r85771 = r85770 + r85770;
        double r85772 = r85769 * r85771;
        return r85772;
}

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