Average Error: 0.0 → 0.0
Time: 367.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 r35705 = x;
        double r35706 = y;
        double r35707 = r35706 + r35706;
        double r35708 = r35705 * r35707;
        return r35708;
}
↓
double f(double x, double y) {
        double r35709 = x;
        double r35710 = y;
        double r35711 = r35710 + r35710;
        double r35712 = r35709 * r35711;
        return r35712;
}

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