Average Error: 0.0 → 0.0
Time: 752.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 r8175563 = x;
        double r8175564 = y;
        double r8175565 = r8175564 + r8175564;
        double r8175566 = r8175563 * r8175565;
        return r8175566;
}
↓
double f(double x, double y) {
        double r8175567 = x;
        double r8175568 = y;
        double r8175569 = r8175568 + r8175568;
        double r8175570 = r8175567 * r8175569;
        return r8175570;
}

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