Average Error: 0.0 → 0.0
Time: 390.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 r100527 = x;
        double r100528 = y;
        double r100529 = r100528 + r100528;
        double r100530 = r100527 * r100529;
        return r100530;
}
↓
double f(double x, double y) {
        double r100531 = x;
        double r100532 = y;
        double r100533 = r100532 + r100532;
        double r100534 = r100531 * r100533;
        return r100534;
}

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