You will be shown an excerpt from a computer science scientific research paper, followed by a question about the paper. Please answer the question. Do not include any text in your response other than the answer.

Context: We argue that the extent to which reasoning algorithms break the problem into sub-problem should be dependent on the scale and power of the LMs. If smaller LMs are used, then one may need to break the problem into sub-problems even further (e.g., further decomposing the one-to-many comparisons in the selection module). And as LMs become larger and stronger in the future, one could rely on them to solve problems even with a coarser-grained decomposition of the problem.

Question: How can you come to the intuition that shorter rules have smaller sub goals?
If smaller LMs are utilised, then one may need to split the issue into sub-problems even more (e.g., further decomposing the one-to-many comparisons in the selection module) (e.g., further decomposing the one-to-many comparisons in the selection module)