Average Error: 0.0 → 0.0
Time: 1.3s
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 r5502241 = x;
        double r5502242 = y;
        double r5502243 = r5502242 + r5502242;
        double r5502244 = r5502241 * r5502243;
        return r5502244;
}
↓
double f(double x, double y) {
        double r5502245 = x;
        double r5502246 = y;
        double r5502247 = r5502246 + r5502246;
        double r5502248 = r5502245 * r5502247;
        return r5502248;
}

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 2019170 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  (* x (+ y y)))