Average Error: 0.0 → 0.0
Time: 392.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 r129242 = x;
        double r129243 = y;
        double r129244 = r129243 + r129243;
        double r129245 = r129242 * r129244;
        return r129245;
}
↓
double f(double x, double y) {
        double r129246 = x;
        double r129247 = y;
        double r129248 = r129247 + r129247;
        double r129249 = r129246 * r129248;
        return r129249;
}

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