-- Boolean SAT problems are widespread in current demanding applications, most notably model checking for both hardware and software. It has long been known that the clause-to-variable ratio describes the likely behavior of randomly generated boolean formulae. This paper empirically investigates how the grouping of variables in these formulae further affects their satisfiability.