Average Error: 0.0 → 0.0
Time: 726.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 r7521357 = x;
        double r7521358 = y;
        double r7521359 = r7521358 + r7521358;
        double r7521360 = r7521357 * r7521359;
        return r7521360;
}
↓
double f(double x, double y) {
        double r7521361 = x;
        double r7521362 = y;
        double r7521363 = r7521362 + r7521362;
        double r7521364 = r7521361 * r7521363;
        return r7521364;
}

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