Average Error: 0.0 → 0.0
Time: 688.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 r101924 = x;
        double r101925 = y;
        double r101926 = r101925 + r101925;
        double r101927 = r101924 * r101926;
        return r101927;
}
↓
double f(double x, double y) {
        double r101928 = x;
        double r101929 = y;
        double r101930 = r101929 + r101929;
        double r101931 = r101928 * r101930;
        return r101931;
}

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