This method converts a RobinsonResolutionProof resproof, which is assumed to have the empty clause as end-clause, into an LKProof of a sequent s.
This method converts a RobinsonResolutionProof resproof, which is assumed to have the empty clause as end-clause, into an LKProof of a sequent s. To do this, the provided createAxiom method is assumed to return, on input c, an LKProof with end-sequent "s' merge c", where s' is a sub-sequent of s.