Average Error: 0.0 → 0.0
Time: 357.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 r119885 = x;
        double r119886 = y;
        double r119887 = r119886 + r119886;
        double r119888 = r119885 * r119887;
        return r119888;
}
↓
double f(double x, double y) {
        double r119889 = x;
        double r119890 = y;
        double r119891 = r119890 + r119890;
        double r119892 = r119889 * r119891;
        return r119892;
}

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