Average Error: 0.0 → 0.0
Time: 535.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 r109902 = x;
        double r109903 = y;
        double r109904 = r109903 + r109903;
        double r109905 = r109902 * r109904;
        return r109905;
}
↓
double f(double x, double y) {
        double r109906 = x;
        double r109907 = y;
        double r109908 = r109907 + r109907;
        double r109909 = r109906 * r109908;
        return r109909;
}

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