Average Error: 0.0 → 0.0
Time: 476.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 r191885 = x;
        double r191886 = y;
        double r191887 = r191886 + r191886;
        double r191888 = r191885 * r191887;
        return r191888;
}
↓
double f(double x, double y) {
        double r191889 = x;
        double r191890 = y;
        double r191891 = r191890 + r191890;
        double r191892 = r191889 * r191891;
        return r191892;
}

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