Average Error: 0.0 → 0.0
Time: 666.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 r74183 = x;
        double r74184 = y;
        double r74185 = r74184 + r74184;
        double r74186 = r74183 * r74185;
        return r74186;
}
↓
double f(double x, double y) {
        double r74187 = x;
        double r74188 = y;
        double r74189 = r74188 + r74188;
        double r74190 = r74187 * r74189;
        return r74190;
}

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