Average Error: 0 → 0
Time: 387.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 r116908 = x;
        double r116909 = y;
        double r116910 = r116909 + r116909;
        double r116911 = r116908 * r116910;
        return r116911;
}
↓
double f(double x, double y) {
        double r116912 = x;
        double r116913 = y;
        double r116914 = r116913 + r116913;
        double r116915 = r116912 * r116914;
        return r116915;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2020047 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))