Average Error: 0.0 → 0.0
Time: 386.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 r94476 = x;
        double r94477 = y;
        double r94478 = r94477 + r94477;
        double r94479 = r94476 * r94478;
        return r94479;
}
↓
double f(double x, double y) {
        double r94480 = x;
        double r94481 = y;
        double r94482 = r94481 + r94481;
        double r94483 = r94480 * r94482;
        return r94483;
}

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