Average Error: 0.0 → 0.0
Time: 405.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 r81083 = x;
        double r81084 = y;
        double r81085 = r81084 + r81084;
        double r81086 = r81083 * r81085;
        return r81086;
}
↓
double f(double x, double y) {
        double r81087 = x;
        double r81088 = y;
        double r81089 = r81088 + r81088;
        double r81090 = r81087 * r81089;
        return r81090;
}

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