Average Error: 0.0 → 0.0
Time: 512.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 r116033 = x;
        double r116034 = y;
        double r116035 = r116034 + r116034;
        double r116036 = r116033 * r116035;
        return r116036;
}
↓
double f(double x, double y) {
        double r116037 = x;
        double r116038 = y;
        double r116039 = r116038 + r116038;
        double r116040 = r116037 * r116039;
        return r116040;
}

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