(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).

Queries:

p(a).

(1) PrologToDTProblemTransformerProof (SOUND transformation)

Built DT problem from termination graph.

(2) Obligation:

Triples:


Clauses:


Afs:

(3) TPisEmptyProof (EQUIVALENT transformation)

There are no more dependency triples. Hence, the dependency triple problem trivially terminates.

(4) YES