Average Error: 0.0 → 0.0
Time: 446.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 r138475 = x;
        double r138476 = y;
        double r138477 = r138476 + r138476;
        double r138478 = r138475 * r138477;
        return r138478;
}
↓
double f(double x, double y) {
        double r138479 = x;
        double r138480 = y;
        double r138481 = r138480 + r138480;
        double r138482 = r138479 * r138481;
        return r138482;
}

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