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) PrologToPrologProblemTransformerProof (SOUND transformation)

Built Prolog problem from termination graph.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="1: p\n\n", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
2 [label="2: p, SCOPE: 1, CLAUSE: 0\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
3 [label="3: r\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
4 [label="4: r, SCOPE: 2, CLAUSE: 1 | r, SCOPE: 2, CLAUSE: 2 | ?_2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: ','(q, !_2) | r, SCOPE: 2, CLAUSE: 2 | ?_2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: ','(q, !_2), SCOPE: 3, CLAUSE: 3 | ','(q, !_2), SCOPE: 3, CLAUSE: 4 | r, SCOPE: 2, CLAUSE: 2 | ?_2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: !_2 | ','(q, !_2), SCOPE: 3, CLAUSE: 4 | r, SCOPE: 2, CLAUSE: 2 | ?_2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 10 [arrowhead = none ];
10 -> 2;

11 [label="EVAL with clause\np :- r.\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
2 -> 11 [arrowhead = none ];
11 -> 3;

12 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
3 -> 12 [arrowhead = none ];
12 -> 4;

13 [label="EVAL with clause\nr :- ','(q, !).\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 13 [arrowhead = none ];
13 -> 5;

14 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
5 -> 14 [arrowhead = none ];
14 -> 6;

15 [label="EVAL with clause\nq.\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
6 -> 15 [arrowhead = none ];
15 -> 7;

16 [label="CUT", fontsize=14, style = filled, fillcolor = lightgreen];
7 -> 16 [arrowhead = none ];
16 -> 8;

17 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
8 -> 17 [arrowhead = none ];
17 -> 9;

}

(2) Obligation:

Clauses:

p1.

Queries:

p1().

(3) PrologToPiTRSProof (SOUND transformation)

We use the technique of [LOPSTR]. With regard to the inferred argument filtering the predicates were used in the following modes:
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

p1_in_ → p1_out_

Pi is empty.

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(4) Obligation:

Pi-finite rewrite system:
The TRS R consists of the following rules:

p1_in_ → p1_out_

Pi is empty.

(5) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem:
Pi DP problem:
P is empty.
The TRS R consists of the following rules:

p1_in_ → p1_out_

Pi is empty.
We have to consider all (P,R,Pi)-chains

(6) Obligation:

Pi DP problem:
P is empty.
The TRS R consists of the following rules:

p1_in_ → p1_out_

Pi is empty.
We have to consider all (P,R,Pi)-chains

(7) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,R,Pi) chain.

(8) TRUE