Average Error: 0.0 → 0.0
Time: 826.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 r67751 = x;
        double r67752 = y;
        double r67753 = r67752 + r67752;
        double r67754 = r67751 * r67753;
        return r67754;
}
↓
double f(double x, double y) {
        double r67755 = x;
        double r67756 = y;
        double r67757 = r67756 + r67756;
        double r67758 = r67755 * r67757;
        return r67758;
}

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)))