So for the past week or so, I've been studying the theoretical concerns of generalizing the LowerUnits algorithm to first order logic proofs. As a result of that work, I've come up with what I think a good first conjecture might be for applicability: we can lower a unit as long as the clauses that are resolved with the unit are also pair-wise unifiable (so that when we lower the unit, the faster contraction rule that usually overrides a resolution rule can actually proceed, as many times as is necessary), and further, that the unit formula is the most general form (e.g., the unit is P(X,Y), and the clause resolving with it might have a variant P(a,Y), but not the other way around -- though in some cases, this does work; this restriction allows a greater number of proofs to succeed by preventing cases where we might get a resolvent containing a too specific variant of the unit that isn't covered by the already specific unit clause we're trying to lower -- see the first real example in section 3 of [1]).
I am concerned that this criteria is somewhat loose; that I could possibly find a better condition for when we can lower units, but finding counter-examples to such things is difficult. I'm also less concerned that it's wrong: but I don't think so--it seems to work always, though I haven't proved it. But if either is the case, I'm not sure I'm asking the right questions.
I have other concerns as well; aside from the concern of unifiability of unit formulas that we want to lower, is it possible that the position of where the unit clause first appears in the proof matters? I've spent considerable time looking at questions for this, but I don't think that's the case either; but again, no proof, only some examples where it seems okay (and many more not documented).
A last concern is that of how far to 'lower' the unit; I think this is solvable by just generalizing the algorithm though--once we know we can apply it, following it like in the propositional case will indicate when to re-insert the unit.
[1] https://github.com/jgorzny/Skeptik/blob/develop/documents/proofs-test.pdf
(As a final note -- for the proofs in the pictures proofs-6-7, proofs-8-9, the letters should be interpreted as first order predicates over unifiable variables, e.g. P(X); which were the easiest to consider at first. Since these proofs probably aren't too useful (but I may want to refer to them), they can probably even be ignored by now.)