Average Error: 0.0 → 0.0
Time: 455.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 r115998 = x;
        double r115999 = y;
        double r116000 = r115999 + r115999;
        double r116001 = r115998 * r116000;
        return r116001;
}
↓
double f(double x, double y) {
        double r116002 = x;
        double r116003 = y;
        double r116004 = r116003 + r116003;
        double r116005 = r116002 * r116004;
        return r116005;
}

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