Recent work in deductive reasoning has shown that transformers can
generate formal proofs with high reliability, both in a formal
setting [1]}, [2]} and
with rules expressed in natural language [3]}.
Inspired by this, we apply similar ideas to generating entailment
trees, in particular leveraging
the generative techniques used in the ProofWriter system [4]}
(Section ).
