All of the first-level resolvents are computed first, then the second-level resolvents, and so on. A first-level resolvent is one between two clauses in the base set; an i-th level resolvent is one whose deepest parent is an (i-1)-th level resolvent.
and here:
- Level 0 clauses are the original axioms and the negation of the goal
- Level k clauses are the resolvents computed from two clauses, one of which must be from level k-1 and the other from any earlier level.
What I mean from these statements and my comments are as the following:
- Level 0 consists original clauses and negation of the goal. Let this set be X.
- Level 1 consists resolution of (X,X) which are the only possible candidates. Let this set be Y.
- Level 2 consists resolutions of (Y,X) and (Y,Y).
and so on.
My explanation applies the second statement. Actually it will give the same results as the first one except that you will resolve same sets at every level which is unnecessary. Breadth-first strategy is already very inefficient and a wrong approach makes it even worse.
I hope this clarifies your question.