Average Error: 0 → 0
Time: 352.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 r99934 = x;
        double r99935 = y;
        double r99936 = r99935 + r99935;
        double r99937 = r99934 * r99936;
        return r99937;
}
↓
double f(double x, double y) {
        double r99938 = x;
        double r99939 = y;
        double r99940 = r99939 + r99939;
        double r99941 = r99938 * r99940;
        return r99941;
}

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