Given a clause c and a set of clauses C, this algorithm instantiates ATP to search for
a Robinson resolution derivation (either propositional or first-order) of a clause c'
such that c' subsumes c.
TODO: At the moment, the ATP configuration is taken from a test due to Tomer.
It does not find some derivations, e.g. of P from P | P. It should
be fixed such that it returns a derivation of a clause subsuming the given
clause, if such a refutation exists.
Given a clause c and a set of clauses C, this algorithm instantiates ATP to search for a Robinson resolution derivation (either propositional or first-order) of a clause c' such that c' subsumes c.
TODO: At the moment, the ATP configuration is taken from a test due to Tomer. It does not find some derivations, e.g. of P from P | P. It should be fixed such that it returns a derivation of a clause subsuming the given clause, if such a refutation exists.