⊢ (eq (f U) 0), (eq (f U) 1), (eq (f U) 2), (eq (f U) 3), (eq (f U) 4)
(eq (f (s U)) 0), (eq (f U) 0) ⊢
and we would get the following list of possible unifiable pairs:
((eq (f W) 0),(eq (f (s U)) 0)),
((eq (f W) 0),(eq (f U) 0))
(Does either of these look wrong? If so, the comments below might not be applicable)
So to fix this, I think we can do one of two things: (A) what we were doing before -- see if there's a list, and just pick the head of the list. I'm not convinced this will always work. Or (B) SPASS proofs actually indicate which formula in each premise is being used for resolution, and we are parsing that information. So maybe instead of just picking the first one, we use this information, and continue as if there's only one unifiable pair (the one we were told to look for).
But then either of these cases would effectively remove the check for length > 1, and that 'resolution is ambiguous' error would never be thrown. So is that a concern?
(B) seems like the better option to me. Do you have any comments on this?
No comments:
Post a Comment