Average Error: 0.0 → 0.0
Time: 343.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 r98617 = x;
        double r98618 = y;
        double r98619 = r98618 + r98618;
        double r98620 = r98617 * r98619;
        return r98620;
}
↓
double f(double x, double y) {
        double r98621 = x;
        double r98622 = y;
        double r98623 = r98622 + r98622;
        double r98624 = r98621 * r98623;
        return r98624;
}

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