Average Error: 0.0 → 0.0
Time: 810.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 r93219 = x;
        double r93220 = y;
        double r93221 = r93220 + r93220;
        double r93222 = r93219 * r93221;
        return r93222;
}
↓
double f(double x, double y) {
        double r93223 = x;
        double r93224 = y;
        double r93225 = r93224 + r93224;
        double r93226 = r93223 * r93225;
        return r93226;
}

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