The propositional model counting problem #SAT asks to compute the number of satisfying assignments for a given propositional formula. Recently, three #SAT proof systems \(\textsf{kcps}\) (knowledge compilation proof system), \(\textsf{MICE}\) (model counting induction by claim extension), and \(\textsf{CPOG}\) (certified partitioned-operation graphs) have been introduced with the aim to model #SAT solving and enable proof logging for solvers. A fourth system, \(\textsf{CLIP}\) (circuit linear introduction proposition), is a very powerful proof system of theoretical interest. Prior to this paper, it was only known that \(\textsf{CLIP}\) simulates the three other systems. All the remaining relations between the systems have been unclear and very few proof complexity results are known. We completely determine the simulation order of the four systems, establishing that \(\textsf{CPOG}\) simulates both \(\textsf{MICE}\) and \(\textsf{kcps}\) , while \(\textsf{MICE}\) and \(\textsf{kcps}\) are exponentially incomparable. This implies that \(\textsf{CPOG}\) is strictly stronger than the other two systems.
