Average Error: 0.0 → 0.0
Time: 815.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 r67722 = x;
        double r67723 = y;
        double r67724 = r67723 + r67723;
        double r67725 = r67722 * r67724;
        return r67725;
}
↓
double f(double x, double y) {
        double r67726 = x;
        double r67727 = y;
        double r67728 = r67727 + r67727;
        double r67729 = r67726 * r67728;
        return r67729;
}

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