Left Termination of the query pattern w.r.t. the given Prolog program could successfully be proven:

(0) Obligation:

Clauses:

p :- r.
r :- ','(q, !).
r :- q.
q.
q :- r.

Queries:

p().

(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