Average Error: 0.0 → 0.0
Time: 340.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 r101012 = x;
        double r101013 = y;
        double r101014 = r101013 + r101013;
        double r101015 = r101012 * r101014;
        return r101015;
}
↓
double f(double x, double y) {
        double r101016 = x;
        double r101017 = y;
        double r101018 = r101017 + r101017;
        double r101019 = r101016 * r101018;
        return r101019;
}

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