An Experimental Comparison of Theorem Provers for CTL

We compare implementations of five theorem provers for Computation Tree Logic (CTL) based on tree-tableaux, graph-tableaux, binary decision diagrams, resolution and games using formula-classes from the literature. In the process, we gather and analyse a set of test formulae which could form the basis of a suite of benchmark formulae for CTL.