Average Error: 0.0 → 0.0
Time: 368.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 r21252 = x;
        double r21253 = y;
        double r21254 = r21253 + r21253;
        double r21255 = r21252 * r21254;
        return r21255;
}
↓
double f(double x, double y) {
        double r21256 = x;
        double r21257 = y;
        double r21258 = r21257 + r21257;
        double r21259 = r21256 * r21258;
        return r21259;
}

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