Hitting formulas, introduced by Iwama, are an unusual class of propositional CNF formulas. Not only is their satisfiability decidable in polynomial time, but even models can be counted closed form. This stands stark contrast with other polynomial-time classes, which usually have algorithms based on backtracking and resolution for model counting remains hard, like 2-SAT Horn-SAT. However, those ...