Average Error: 0.0 → 0.0
Time: 1.1s
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 r6132815 = x;
        double r6132816 = y;
        double r6132817 = r6132816 + r6132816;
        double r6132818 = r6132815 * r6132817;
        return r6132818;
}
↓
double f(double x, double y) {
        double r6132819 = x;
        double r6132820 = y;
        double r6132821 = r6132820 + r6132820;
        double r6132822 = r6132819 * r6132821;
        return r6132822;
}

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