Average Error: 0.0 → 0.0
Time: 366.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 r90676 = x;
        double r90677 = y;
        double r90678 = r90677 + r90677;
        double r90679 = r90676 * r90678;
        return r90679;
}
↓
double f(double x, double y) {
        double r90680 = x;
        double r90681 = y;
        double r90682 = r90681 + r90681;
        double r90683 = r90680 * r90682;
        return r90683;
}

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