Average Error: 0.0 → 0.0
Time: 726.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 r80084 = x;
        double r80085 = y;
        double r80086 = r80085 + r80085;
        double r80087 = r80084 * r80086;
        return r80087;
}
↓
double f(double x, double y) {
        double r80088 = x;
        double r80089 = y;
        double r80090 = r80089 + r80089;
        double r80091 = r80088 * r80090;
        return r80091;
}

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