Average Error: 0.0 → 0.0
Time: 764.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 r94374 = x;
        double r94375 = y;
        double r94376 = r94375 + r94375;
        double r94377 = r94374 * r94376;
        return r94377;
}
↓
double f(double x, double y) {
        double r94378 = x;
        double r94379 = y;
        double r94380 = r94379 + r94379;
        double r94381 = r94378 * r94380;
        return r94381;
}

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