Average Error: 0.0 → 0.0
Time: 356.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 r107895 = x;
        double r107896 = y;
        double r107897 = r107896 + r107896;
        double r107898 = r107895 * r107897;
        return r107898;
}
↓
double f(double x, double y) {
        double r107899 = x;
        double r107900 = y;
        double r107901 = r107900 + r107900;
        double r107902 = r107899 * r107901;
        return r107902;
}

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