(0) Obligation:
Clauses:
p(X) :- ','(no(letter(X)), q(X)).
q(x) :- p(X1).
letter(x).
no(X) :- ','(X, ','(!, failure(a))).
no(X2).
failure(b).
Query: p(a)
(1) PrologToTRSTransformerProof (SOUND transformation)
Transformed Prolog program to TRS.
(2) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(3) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(4) YES