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

(0) Obligation:

Clauses:

p(b).
p(a) :- p1(X).
p1(b) :- !.
p1(a) :- p1(X).

Queries:

p(g).

(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