Saturday, 31 May 2014

Parser Clean Up

Today I was  looking into the MRR 3 node issue, and it looks like, at least from all the examples I have, that the first two references are actually the same line, and the third is different. So I'm currently ensuring that this is the case, and then performing resolution on the first and third (the second and third work just as well); this completes the proof. Is it necessary to consider the second? If not, is there a reason SPASS uses three references?

I also cleaned up a bit of the code; for example the parser no longer parses "eq", "ge", etc. functions explicitly; it just parses a function with an arbitrary name and number of arguments. 

Also, when Skeptik is done the proof is often shorter than the given proof, at least in terms of lines: for FSTP2.spass for example, it has 18 lines in the file (each one is a Res, MRR or Inp, and thus useful?), but Skeptik only has 12:

1: { ⊢ (eq (f U) 0), (eq (f U) 1)} : Axiom()[]
2: {(eq (f X) 0) ⊢ (eq (f (s X)) 1)} : Axiom()[]
3: {(eq (f W) 0) ⊢ (eq (f (max NEW1 (s W))) 1)} : Axiom()[]
4: { ⊢ (le W (max W X))} : Axiom()[]
5: {(eq (f V) 1), (eq (f U) 1), (le (s U) V) ⊢ } : Axiom()[]
6: {(eq (f (max (s U) X)) 1), (eq (f U) 1) ⊢ } : UnifyingResolution(4, 5)[]
7: {(eq (f W) 0), (eq (f U) 1) ⊢ } : UnifyingResolution(3, 6)[]
8: {(eq (f X) 0) ⊢ } : UnifyingResolutionMRR(2, 7)[]
9: { ⊢ (eq (f X) 1)} : UnifyingResolutionMRR(1, 8)[]
10: { ⊢ (le W W)} : Axiom()[]
11: {(eq (f (s U)) 1), (eq (f U) 1) ⊢ } : UnifyingResolution(10, 5)[]

12: { ⊢ } : UnifyingResolutionMRR(9, 11)[]

Do you know if Skeptik is already compressing/reducing the proof? If so, is there a way to disable this (just so that I can see that everything is working properly?

No comments:

Post a Comment