(0) Obligation:
Clauses:
f(X) :- ','(p(X), q(X)).
p(a).
p(X) :- ','(p(a), !).
q(b).
Query: f(a)
(1) PrologToDTProblemTransformerProof (SOUND transformation)
Built DT problem from termination graph DT10.
(2) Obligation:
Triples:
Clauses:
Afs:
(3) TPisEmptyProof (EQUIVALENT transformation)
There are no more dependency triples. Hence, the dependency triple problem trivially terminates.
(4) YES