Today, I think I've finally fixed the UnifyingResolutions class. It looks like the bug that was mentioned in the last post was a result of my re-naming of shared variables in premises being applied in the wrong place. It turns out that I was 'waiting too long' to clear up the difference, and once I put it in the right spot, it's looks to be working fine.
By that, I mean that for every line of my example SPASS proof, the line representing the Resolvent computed by Skeptik matches the line provided by SPASS (except for some difference in variable names -- but this is fine, and some ordering of formulas). So the parsing is done, except for one thing.
The proof, when finally displayed, is not much more than a single line:
1: { ⊢ } : Axiom()[]
I think this is because the last line of the example proof is generated by an MRR inference rule, which the parser treats as an axiom. And when printing the proof, Skeptik reduces the output to show only what is necessary. But in this case what we want to show is an axiom (and the last one we've seen), so it prints that and stops. The rest of the proof using UnifyingResolutions is working well -- you can print out the proof for an intermediate result (generated by resolution, and thus not treated as an axiom) and it looks good.
So I think the next step is to stop treating other inference rules as Axioms, and code at least a quick class for at least MRR, to see the entire proof. (Even if this class does treat the input as an axiom, but something that references the premises used by MRR, so that the proof is at least displayed properly).
No comments:
Post a Comment