Average Error: 0.0 → 0.0
Time: 732.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 r66849 = x;
        double r66850 = y;
        double r66851 = r66850 + r66850;
        double r66852 = r66849 * r66851;
        return r66852;
}
↓
double f(double x, double y) {
        double r66853 = x;
        double r66854 = y;
        double r66855 = r66854 + r66854;
        double r66856 = r66853 * r66855;
        return r66856;
}

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