Jitpro is an interactive theorem prover for higher order logic that outputs tableau proofs. Holitmus is a proof checker which takes as input claims and corresponding proof terms.
My task is to build an algorithm that translates tableau proofs into proof terms. This allows us to use Holitmus for checking the proofs outputted by Jitpro.
In my first talk I will give a quick overview on refutation calculus and on the proof term calculus that we are using. Then, explain how we want to give the translation.