Average Error: 0.0 → 0.0
Time: 419.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 r110514 = x;
        double r110515 = y;
        double r110516 = r110515 + r110515;
        double r110517 = r110514 * r110516;
        return r110517;
}
↓
double f(double x, double y) {
        double r110518 = x;
        double r110519 = y;
        double r110520 = r110519 + r110519;
        double r110521 = r110518 * r110520;
        return r110521;
}

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