Average Error: 0.0 → 0.0
Time: 703.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 r12898 = x;
        double r12899 = y;
        double r12900 = r12899 + r12899;
        double r12901 = r12898 * r12900;
        return r12901;
}
↓
double f(double x, double y) {
        double r12902 = x;
        double r12903 = y;
        double r12904 = r12903 + r12903;
        double r12905 = r12902 * r12904;
        return r12905;
}

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