The algorithm as described above is a method for answering the decision problem for sequent derivability in the Lambek calculus.
we can annotate the ATGs with the ATGs they are derived from so that a complete set of Roorda-style proof nets, and thus the proofs themselves, can be recovered.