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

0 Prolog
  ↳1 PrologToPiTRSProof (⇐)
    ↳2 PiTRS
    ↳3 DependencyPairsProof (⇔)
    ↳4 PiDP
    ↳5 DependencyGraphProof (⇔)
    ↳6 PiDP
    ↳7 UsableRulesProof (⇔)
    ↳8 PiDP
    ↳9 PiDPToQDPProof (⇔)
    ↳10 QDP
    ↳11 QDPSizeChangeProof (⇔)
    ↳12 TRUE
  ↳13 PrologToPiTRSProof (⇐)
    ↳14 PiTRS
    ↳15 DependencyPairsProof (⇔)
    ↳16 PiDP
    ↳17 DependencyGraphProof (⇔)
    ↳18 PiDP
    ↳19 UsableRulesProof (⇔)
    ↳20 PiDP

(0) Obligation:

Clauses:

list([]).
list(.(X1, Ts)) :- list(Ts).

Queries:

list(g).

(1) PrologToPiTRSProof (SOUND transformation)

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

list_in_g([]) → list_out_g([])
list_in_g(.(X1, Ts)) → U1_g(X1, Ts, list_in_g(Ts))
U1_g(X1, Ts, list_out_g(Ts)) → list_out_g(.(X1, Ts))

The argument filtering Pi contains the following mapping:
list_in_g(x1)  =  list_in_g(x1)
[]  =  []
list_out_g(x1)  =  list_out_g
.(x1, x2)  =  .(x1, x2)
U1_g(x1, x2, x3)  =  U1_g(x3)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(2) Obligation:

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

list_in_g([]) → list_out_g([])
list_in_g(.(X1, Ts)) → U1_g(X1, Ts, list_in_g(Ts))
U1_g(X1, Ts, list_out_g(Ts)) → list_out_g(.(X1, Ts))

The argument filtering Pi contains the following mapping:
list_in_g(x1)  =  list_in_g(x1)
[]  =  []
list_out_g(x1)  =  list_out_g
.(x1, x2)  =  .(x1, x2)
U1_g(x1, x2, x3)  =  U1_g(x3)

(3) DependencyPairsProof (EQUIVALENT transformation)

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

LIST_IN_G(.(X1, Ts)) → U1_G(X1, Ts, list_in_g(Ts))
LIST_IN_G(.(X1, Ts)) → LIST_IN_G(Ts)

The TRS R consists of the following rules:

list_in_g([]) → list_out_g([])
list_in_g(.(X1, Ts)) → U1_g(X1, Ts, list_in_g(Ts))
U1_g(X1, Ts, list_out_g(Ts)) → list_out_g(.(X1, Ts))

The argument filtering Pi contains the following mapping:
list_in_g(x1)  =  list_in_g(x1)
[]  =  []
list_out_g(x1)  =  list_out_g
.(x1, x2)  =  .(x1, x2)
U1_g(x1, x2, x3)  =  U1_g(x3)
LIST_IN_G(x1)  =  LIST_IN_G(x1)
U1_G(x1, x2, x3)  =  U1_G(x3)

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

(4) Obligation:

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

LIST_IN_G(.(X1, Ts)) → U1_G(X1, Ts, list_in_g(Ts))
LIST_IN_G(.(X1, Ts)) → LIST_IN_G(Ts)

The TRS R consists of the following rules:

list_in_g([]) → list_out_g([])
list_in_g(.(X1, Ts)) → U1_g(X1, Ts, list_in_g(Ts))
U1_g(X1, Ts, list_out_g(Ts)) → list_out_g(.(X1, Ts))

The argument filtering Pi contains the following mapping:
list_in_g(x1)  =  list_in_g(x1)
[]  =  []
list_out_g(x1)  =  list_out_g
.(x1, x2)  =  .(x1, x2)
U1_g(x1, x2, x3)  =  U1_g(x3)
LIST_IN_G(x1)  =  LIST_IN_G(x1)
U1_G(x1, x2, x3)  =  U1_G(x3)

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

(5) DependencyGraphProof (EQUIVALENT transformation)

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

(6) Obligation:

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

LIST_IN_G(.(X1, Ts)) → LIST_IN_G(Ts)

The TRS R consists of the following rules:

list_in_g([]) → list_out_g([])
list_in_g(.(X1, Ts)) → U1_g(X1, Ts, list_in_g(Ts))
U1_g(X1, Ts, list_out_g(Ts)) → list_out_g(.(X1, Ts))

The argument filtering Pi contains the following mapping:
list_in_g(x1)  =  list_in_g(x1)
[]  =  []
list_out_g(x1)  =  list_out_g
.(x1, x2)  =  .(x1, x2)
U1_g(x1, x2, x3)  =  U1_g(x3)
LIST_IN_G(x1)  =  LIST_IN_G(x1)

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

(7) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(8) Obligation:

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

LIST_IN_G(.(X1, Ts)) → LIST_IN_G(Ts)

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

(9) PiDPToQDPProof (EQUIVALENT transformation)

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

(10) Obligation:

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

LIST_IN_G(.(X1, Ts)) → LIST_IN_G(Ts)

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

(11) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • LIST_IN_G(.(X1, Ts)) → LIST_IN_G(Ts)
    The graph contains the following edges 1 > 1

(12) TRUE

(13) PrologToPiTRSProof (SOUND transformation)

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

list_in_g([]) → list_out_g([])
list_in_g(.(X1, Ts)) → U1_g(X1, Ts, list_in_g(Ts))
U1_g(X1, Ts, list_out_g(Ts)) → list_out_g(.(X1, Ts))

Pi is empty.

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(14) Obligation:

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

list_in_g([]) → list_out_g([])
list_in_g(.(X1, Ts)) → U1_g(X1, Ts, list_in_g(Ts))
U1_g(X1, Ts, list_out_g(Ts)) → list_out_g(.(X1, Ts))

Pi is empty.

(15) DependencyPairsProof (EQUIVALENT transformation)

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

LIST_IN_G(.(X1, Ts)) → U1_G(X1, Ts, list_in_g(Ts))
LIST_IN_G(.(X1, Ts)) → LIST_IN_G(Ts)

The TRS R consists of the following rules:

list_in_g([]) → list_out_g([])
list_in_g(.(X1, Ts)) → U1_g(X1, Ts, list_in_g(Ts))
U1_g(X1, Ts, list_out_g(Ts)) → list_out_g(.(X1, Ts))

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

(16) Obligation:

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

LIST_IN_G(.(X1, Ts)) → U1_G(X1, Ts, list_in_g(Ts))
LIST_IN_G(.(X1, Ts)) → LIST_IN_G(Ts)

The TRS R consists of the following rules:

list_in_g([]) → list_out_g([])
list_in_g(.(X1, Ts)) → U1_g(X1, Ts, list_in_g(Ts))
U1_g(X1, Ts, list_out_g(Ts)) → list_out_g(.(X1, Ts))

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

(17) DependencyGraphProof (EQUIVALENT transformation)

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

(18) Obligation:

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

LIST_IN_G(.(X1, Ts)) → LIST_IN_G(Ts)

The TRS R consists of the following rules:

list_in_g([]) → list_out_g([])
list_in_g(.(X1, Ts)) → U1_g(X1, Ts, list_in_g(Ts))
U1_g(X1, Ts, list_out_g(Ts)) → list_out_g(.(X1, Ts))

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

(19) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(20) Obligation:

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

LIST_IN_G(.(X1, Ts)) → LIST_IN_G(Ts)

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