Given the team's expertise with the structure of proofs and techniques for automation, we have taken on the implementation of the TAC prover. This prover, written in OCaml, is currently underdevelopment and has not yet been released. Its architecture is designed to perform focused proof search of rather limited depth and to use only “obvious” induction invariants. A goal of this prover is to completely automate a large number of simple theorems within an inductive and co-inductive setting: proofs of more significant theorems would then be organized as being simple lists of lemmas. A large class of examples, including those from the POPLMark challenge  , are currently being treated by this prover.