Average Error: 0.0 → 0.0
Time: 936.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 r6402473 = x;
        double r6402474 = y;
        double r6402475 = r6402474 + r6402474;
        double r6402476 = r6402473 * r6402475;
        return r6402476;
}
↓
double f(double x, double y) {
        double r6402477 = x;
        double r6402478 = y;
        double r6402479 = r6402478 + r6402478;
        double r6402480 = r6402477 * r6402479;
        return r6402480;
}

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