Average Error: 0.0 → 0.0
Time: 648.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 r88516 = x;
        double r88517 = y;
        double r88518 = r88517 + r88517;
        double r88519 = r88516 * r88518;
        return r88519;
}
↓
double f(double x, double y) {
        double r88520 = x;
        double r88521 = y;
        double r88522 = r88521 + r88521;
        double r88523 = r88520 * r88522;
        return r88523;
}

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