Average Error: 0.0 → 0.0
Time: 604.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 r74206 = x;
        double r74207 = y;
        double r74208 = r74207 + r74207;
        double r74209 = r74206 * r74208;
        return r74209;
}
↓
double f(double x, double y) {
        double r74210 = x;
        double r74211 = y;
        double r74212 = r74211 + r74211;
        double r74213 = r74210 * r74212;
        return r74213;
}

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