Average Error: 0.0 → 0.0
Time: 883.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 r80840 = x;
        double r80841 = y;
        double r80842 = r80841 + r80841;
        double r80843 = r80840 * r80842;
        return r80843;
}
↓
double f(double x, double y) {
        double r80844 = x;
        double r80845 = y;
        double r80846 = r80845 + r80845;
        double r80847 = r80844 * r80846;
        return r80847;
}

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