Average Error: 0.0 → 0.0
Time: 784.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 r104360 = x;
        double r104361 = y;
        double r104362 = r104361 + r104361;
        double r104363 = r104360 * r104362;
        return r104363;
}
↓
double f(double x, double y) {
        double r104364 = x;
        double r104365 = y;
        double r104366 = r104365 + r104365;
        double r104367 = r104364 * r104366;
        return r104367;
}

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