Average Error: 0.0 → 0.0
Time: 1.2s
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 r87908 = x;
        double r87909 = y;
        double r87910 = r87909 + r87909;
        double r87911 = r87908 * r87910;
        return r87911;
}
↓
double f(double x, double y) {
        double r87912 = x;
        double r87913 = y;
        double r87914 = r87913 + r87913;
        double r87915 = r87912 * r87914;
        return r87915;
}

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