Average Error: 0 → 0
Time: 395.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 r120928 = x;
        double r120929 = y;
        double r120930 = r120929 + r120929;
        double r120931 = r120928 * r120930;
        return r120931;
}
↓
double f(double x, double y) {
        double r120932 = x;
        double r120933 = y;
        double r120934 = r120933 + r120933;
        double r120935 = r120932 * r120934;
        return r120935;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2020047 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))