Average Error: 0 → 0
Time: 354.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 r106367 = x;
        double r106368 = y;
        double r106369 = r106368 + r106368;
        double r106370 = r106367 * r106369;
        return r106370;
}
↓
double f(double x, double y) {
        double r106371 = x;
        double r106372 = y;
        double r106373 = r106372 + r106372;
        double r106374 = r106371 * r106373;
        return r106374;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2020047 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))