Average Error: 0.0 → 0.0
Time: 414.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 r95055 = x;
        double r95056 = y;
        double r95057 = r95056 + r95056;
        double r95058 = r95055 * r95057;
        return r95058;
}
↓
double f(double x, double y) {
        double r95059 = x;
        double r95060 = y;
        double r95061 = r95060 + r95060;
        double r95062 = r95059 * r95061;
        return r95062;
}

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