Average Error: 0.0 → 0.0
Time: 384.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 r99164 = x;
        double r99165 = y;
        double r99166 = r99165 + r99165;
        double r99167 = r99164 * r99166;
        return r99167;
}
↓
double f(double x, double y) {
        double r99168 = x;
        double r99169 = y;
        double r99170 = r99169 + r99169;
        double r99171 = r99168 * r99170;
        return r99171;
}

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