Step 1: Understanding the problem.
We are given a set \( U = \{1, 2, 3, 4, 5\} \), and we need to find the probability that a subset \( S \) chosen from its non-empty subsets does not contain two consecutive elements.
Step 2: Count the valid subsets.
The valid subsets are those where no two consecutive elements are chosen from \( U \). The number of such subsets can be found by considering the binary representation of selecting elements. The valid subsets are:
\( \{1\}, \{2\}, \{3\}, \{4\}, \{5\}, \{1, 3\}, \{1, 4\}, \{1, 5\}, \{2, 4\}, \{2, 5\}, \{1, 3, 5\} \). Thus, there are 10 valid subsets.
Step 3: Total number of non-empty subsets.
The total number of non-empty subsets of \( U \) is \( 2^5 - 1 = 31 \), as each element can either be included or not, except the empty set.
Step 4: Conclusion.
The probability that \( S \) does not have two consecutive elements is \( \frac{10}{31} \), so the correct answer is (B) 10/31.