Average Error: 0.0 → 0.0
Time: 331.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 r136177 = x;
        double r136178 = y;
        double r136179 = r136178 + r136178;
        double r136180 = r136177 * r136179;
        return r136180;
}
↓
double f(double x, double y) {
        double r136181 = x;
        double r136182 = y;
        double r136183 = r136182 + r136182;
        double r136184 = r136181 * r136183;
        return r136184;
}

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