Average Error: 0 → 0
Time: 365.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 r117769 = x;
        double r117770 = y;
        double r117771 = r117770 + r117770;
        double r117772 = r117769 * r117771;
        return r117772;
}
↓
double f(double x, double y) {
        double r117773 = x;
        double r117774 = y;
        double r117775 = r117774 + r117774;
        double r117776 = r117773 * r117775;
        return r117776;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2020047 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))