Average Error: 0.0 → 0.0
Time: 655.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 r88599 = x;
        double r88600 = y;
        double r88601 = r88600 + r88600;
        double r88602 = r88599 * r88601;
        return r88602;
}
↓
double f(double x, double y) {
        double r88603 = x;
        double r88604 = y;
        double r88605 = r88604 + r88604;
        double r88606 = r88603 * r88605;
        return r88606;
}

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