Average Error: 0.0 → 0.0
Time: 599.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 r75730 = x;
        double r75731 = y;
        double r75732 = r75731 + r75731;
        double r75733 = r75730 * r75732;
        return r75733;
}
↓
double f(double x, double y) {
        double r75734 = x;
        double r75735 = y;
        double r75736 = r75735 + r75735;
        double r75737 = r75734 * r75736;
        return r75737;
}

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