Average Error: 0.0 → 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 r110868 = x;
        double r110869 = y;
        double r110870 = r110869 + r110869;
        double r110871 = r110868 * r110870;
        return r110871;
}
↓
double f(double x, double y) {
        double r110872 = x;
        double r110873 = y;
        double r110874 = r110873 + r110873;
        double r110875 = r110872 * r110874;
        return r110875;
}

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