Average Error: 0.0 → 0.0
Time: 1.2s
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 r92762 = x;
        double r92763 = y;
        double r92764 = r92763 + r92763;
        double r92765 = r92762 * r92764;
        return r92765;
}
↓
double f(double x, double y) {
        double r92766 = x;
        double r92767 = y;
        double r92768 = r92767 + r92767;
        double r92769 = r92766 * r92768;
        return r92769;
}

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