Average Error: 0.0 → 0.0
Time: 339.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 r118896 = x;
        double r118897 = y;
        double r118898 = r118897 + r118897;
        double r118899 = r118896 * r118898;
        return r118899;
}
↓
double f(double x, double y) {
        double r118900 = x;
        double r118901 = y;
        double r118902 = r118901 + r118901;
        double r118903 = r118900 * r118902;
        return r118903;
}

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