Average Error: 0.0 → 0.0
Time: 351.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 r112266 = x;
        double r112267 = y;
        double r112268 = r112267 + r112267;
        double r112269 = r112266 * r112268;
        return r112269;
}
↓
double f(double x, double y) {
        double r112270 = x;
        double r112271 = y;
        double r112272 = r112271 + r112271;
        double r112273 = r112270 * r112272;
        return r112273;
}

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