I wanted to test this claim with SAT problems. Why SAT? Because solving SAT problems require applying very few rules consistently. The principle stays the same even if you have millions of variables or just a couple. So if you know how to reason properly any SAT instances is solvable given enough time. Also, it's easy to generate completely random SAT problems that make it less likely for LLM to solve the problem based on pure pattern recognition. Therefore, I think it is a good problem type to test whether LLMs can generalize basic rules beyond their training data.
What is SEMrush?
，更多细节参见服务器推荐
（三）在当地有常住户口和固定住所；
«Все, что сейчас делает Украина, происходит потому, что мы отправляем им деньги и оружие. Без этих денег и оружия, как только мы "выдернем кабель", Украина сможет сопротивляться не более, скажем, 12 недель», — сказал он.