Average Error: 0.0 → 0.0
Time: 2.2s
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 r6278975 = x;
        double r6278976 = y;
        double r6278977 = r6278976 + r6278976;
        double r6278978 = r6278975 * r6278977;
        return r6278978;
}
↓
double f(double x, double y) {
        double r6278979 = x;
        double r6278980 = y;
        double r6278981 = r6278980 + r6278980;
        double r6278982 = r6278979 * r6278981;
        return r6278982;
}

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)))