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

(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:

p17(a) :- p17(X3).
p11(a) :- p17(X1).

Clauses:

p1c7(b).
p1c7(a) :- p1c7(X3).

Afs:

p11(x1)  =  p11(x1)

(3) TriplesToPiDPProof (SOUND transformation)

We use the technique of [LOPSTR]. With regard to the inferred argument filtering the predicates were used in the following modes:
p11_in: (b)
p17_in: (f)
Transforming TRIPLES into the following Term Rewriting System:
Pi DP problem:
The TRS P consists of the following rules:

P11_IN_G(a) → U2_G(p17_in_a(X1))
P11_IN_G(a) → P17_IN_A(X1)
P17_IN_A(a) → U1_A(p17_in_a(X3))
P17_IN_A(a) → P17_IN_A(X3)

R is empty.
The argument filtering Pi contains the following mapping:
a  =  a
p17_in_a(x1)  =  p17_in_a
P11_IN_G(x1)  =  P11_IN_G(x1)
U2_G(x1)  =  U2_G(x1)
P17_IN_A(x1)  =  P17_IN_A
U1_A(x1)  =  U1_A(x1)

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

Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES

(4) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

P11_IN_G(a) → U2_G(p17_in_a(X1))
P11_IN_G(a) → P17_IN_A(X1)
P17_IN_A(a) → U1_A(p17_in_a(X3))
P17_IN_A(a) → P17_IN_A(X3)

R is empty.
The argument filtering Pi contains the following mapping:
a  =  a
p17_in_a(x1)  =  p17_in_a
P11_IN_G(x1)  =  P11_IN_G(x1)
U2_G(x1)  =  U2_G(x1)
P17_IN_A(x1)  =  P17_IN_A
U1_A(x1)  =  U1_A(x1)

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

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 1 SCC with 3 less nodes.

(6) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

P17_IN_A(a) → P17_IN_A(X3)

R is empty.
The argument filtering Pi contains the following mapping:
a  =  a
P17_IN_A(x1)  =  P17_IN_A

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

(7) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(8) Obligation:

Q DP problem:
The TRS P consists of the following rules:

P17_IN_A → P17_IN_A

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

(9) NonTerminationProof (EQUIVALENT transformation)

We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

s = P17_IN_A evaluates to t =P17_IN_A

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

• Semiunifier: [ ]
• Matcher: [ ]

---

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from P17_IN_A to P17_IN_A.

(10) NO