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

(0) Obligation:

Clauses:

suffix(Xs, Ys) :- app(X1, Xs, Ys).
app([], X, X).
app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs).

Query: suffix(a,g)

(1) PrologToPiTRSViaGraphTransformerProof (SOUND transformation)

Transformed Prolog program to (Pi-)TRS.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="A: suffix(T1, T2)\n\nT2 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
5 [label="5: suffix(T1, T2), SCOPE: 1, CLAUSE: 0\n\nT2 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="B: app(X6, T7, T6)\n\nT6 is ground\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: app(X6, T7, T6), SCOPE: 2, CLAUSE: 1 | app(X6, T7, T6), SCOPE: 2, CLAUSE: 2\n\nT6 is ground\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: app(X6, T7, T6), SCOPE: 2, CLAUSE: 1\n\nT6 is ground\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: app(X6, T7, T6), SCOPE: 2, CLAUSE: 2\n\nT6 is ground\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: app(X29, T22, T21)\n\nT21 is ground\nX29 is free", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 30 [arrowhead = none ];
30 -> 5;

31 [label="ONLY EVAL with clause\nsuffix(X4, X5) :- app(X6, X4, X5).\nand substitutionT1 -> T7,\nX4 -> T7,\nT2 -> T6,\nX5 -> T6,\nT5 -> T7", fontsize=14, style = filled, fillcolor = lightblue];
5 -> 31 [arrowhead = none ];
31 -> 7;

32 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
7 -> 32 [arrowhead = none ];
32 -> 9;

33 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
9 -> 33 [arrowhead = none ];
33 -> 11;

34 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
9 -> 34 [arrowhead = none ];
34 -> 12;

35 [label="EVAL with clause\napp([], X11, X11).\nand substitutionX6 -> [],\nT7 -> T12,\nX11 -> T12,\nT6 -> T12", fontsize=14, style = filled, fillcolor = lightblue];
11 -> 35 [arrowhead = none ];
35 -> 14;

36 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
11 -> 36 [arrowhead = none ];
36 -> 15;

37 [label="EVAL with clause\napp(.(X24, X25), X26, .(X24, X27)) :- app(X25, X26, X27).\nand substitutionX24 -> T20,\nX25 -> X29,\nX6 -> .(T20, X29),\nT7 -> T22,\nX26 -> T22,\nX28 -> T20,\nX27 -> T21,\nT6 -> .(T20, T21),\nT19 -> T22", fontsize=14, style = filled, fillcolor = lightblue];
12 -> 37 [arrowhead = none ];
37 -> 28;

38 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
12 -> 38 [arrowhead = none ];
38 -> 29;

39 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
14 -> 39 [arrowhead = none ];
39 -> 18;

40 [label="INSTANCE with matching:\nX6 -> X29\nT7 -> T22\nT6 -> T21", fontsize=14, style = filled, fillcolor = lightgrey];
28 -> 40 [arrowhead = none , style=dashed];
40 -> 7[style=dashed];

}

(2) Obligation:

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

suffixA_in_ag(T7, T6) → U1_ag(T7, T6, appB_in_aag(X6, T7, T6))
appB_in_aag([], T12, T12) → appB_out_aag([], T12, T12)
appB_in_aag(.(T20, X29), T22, .(T20, T21)) → U2_aag(T20, X29, T22, T21, appB_in_aag(X29, T22, T21))
U2_aag(T20, X29, T22, T21, appB_out_aag(X29, T22, T21)) → appB_out_aag(.(T20, X29), T22, .(T20, T21))
U1_ag(T7, T6, appB_out_aag(X6, T7, T6)) → suffixA_out_ag(T7, T6)

The argument filtering Pi contains the following mapping:
suffixA_in_ag(x1, x2)  =  suffixA_in_ag(x2)
U1_ag(x1, x2, x3)  =  U1_ag(x2, x3)
appB_in_aag(x1, x2, x3)  =  appB_in_aag(x3)
appB_out_aag(x1, x2, x3)  =  appB_out_aag(x1, x2, x3)
.(x1, x2)  =  .(x1, x2)
U2_aag(x1, x2, x3, x4, x5)  =  U2_aag(x1, x4, x5)
suffixA_out_ag(x1, x2)  =  suffixA_out_ag(x1, x2)

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

SUFFIXA_IN_AG(T7, T6) → U1_AG(T7, T6, appB_in_aag(X6, T7, T6))
SUFFIXA_IN_AG(T7, T6) → APPB_IN_AAG(X6, T7, T6)
APPB_IN_AAG(.(T20, X29), T22, .(T20, T21)) → U2_AAG(T20, X29, T22, T21, appB_in_aag(X29, T22, T21))
APPB_IN_AAG(.(T20, X29), T22, .(T20, T21)) → APPB_IN_AAG(X29, T22, T21)

The TRS R consists of the following rules:

suffixA_in_ag(T7, T6) → U1_ag(T7, T6, appB_in_aag(X6, T7, T6))
appB_in_aag([], T12, T12) → appB_out_aag([], T12, T12)
appB_in_aag(.(T20, X29), T22, .(T20, T21)) → U2_aag(T20, X29, T22, T21, appB_in_aag(X29, T22, T21))
U2_aag(T20, X29, T22, T21, appB_out_aag(X29, T22, T21)) → appB_out_aag(.(T20, X29), T22, .(T20, T21))
U1_ag(T7, T6, appB_out_aag(X6, T7, T6)) → suffixA_out_ag(T7, T6)

The argument filtering Pi contains the following mapping:
suffixA_in_ag(x1, x2)  =  suffixA_in_ag(x2)
U1_ag(x1, x2, x3)  =  U1_ag(x2, x3)
appB_in_aag(x1, x2, x3)  =  appB_in_aag(x3)
appB_out_aag(x1, x2, x3)  =  appB_out_aag(x1, x2, x3)
.(x1, x2)  =  .(x1, x2)
U2_aag(x1, x2, x3, x4, x5)  =  U2_aag(x1, x4, x5)
suffixA_out_ag(x1, x2)  =  suffixA_out_ag(x1, x2)
SUFFIXA_IN_AG(x1, x2)  =  SUFFIXA_IN_AG(x2)
U1_AG(x1, x2, x3)  =  U1_AG(x2, x3)
APPB_IN_AAG(x1, x2, x3)  =  APPB_IN_AAG(x3)
U2_AAG(x1, x2, x3, x4, x5)  =  U2_AAG(x1, x4, x5)

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

(4) Obligation:

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

SUFFIXA_IN_AG(T7, T6) → U1_AG(T7, T6, appB_in_aag(X6, T7, T6))
SUFFIXA_IN_AG(T7, T6) → APPB_IN_AAG(X6, T7, T6)
APPB_IN_AAG(.(T20, X29), T22, .(T20, T21)) → U2_AAG(T20, X29, T22, T21, appB_in_aag(X29, T22, T21))
APPB_IN_AAG(.(T20, X29), T22, .(T20, T21)) → APPB_IN_AAG(X29, T22, T21)

The TRS R consists of the following rules:

suffixA_in_ag(T7, T6) → U1_ag(T7, T6, appB_in_aag(X6, T7, T6))
appB_in_aag([], T12, T12) → appB_out_aag([], T12, T12)
appB_in_aag(.(T20, X29), T22, .(T20, T21)) → U2_aag(T20, X29, T22, T21, appB_in_aag(X29, T22, T21))
U2_aag(T20, X29, T22, T21, appB_out_aag(X29, T22, T21)) → appB_out_aag(.(T20, X29), T22, .(T20, T21))
U1_ag(T7, T6, appB_out_aag(X6, T7, T6)) → suffixA_out_ag(T7, T6)

The argument filtering Pi contains the following mapping:
suffixA_in_ag(x1, x2)  =  suffixA_in_ag(x2)
U1_ag(x1, x2, x3)  =  U1_ag(x2, x3)
appB_in_aag(x1, x2, x3)  =  appB_in_aag(x3)
appB_out_aag(x1, x2, x3)  =  appB_out_aag(x1, x2, x3)
.(x1, x2)  =  .(x1, x2)
U2_aag(x1, x2, x3, x4, x5)  =  U2_aag(x1, x4, x5)
suffixA_out_ag(x1, x2)  =  suffixA_out_ag(x1, x2)
SUFFIXA_IN_AG(x1, x2)  =  SUFFIXA_IN_AG(x2)
U1_AG(x1, x2, x3)  =  U1_AG(x2, x3)
APPB_IN_AAG(x1, x2, x3)  =  APPB_IN_AAG(x3)
U2_AAG(x1, x2, x3, x4, x5)  =  U2_AAG(x1, x4, x5)

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:

APPB_IN_AAG(.(T20, X29), T22, .(T20, T21)) → APPB_IN_AAG(X29, T22, T21)

The TRS R consists of the following rules:

suffixA_in_ag(T7, T6) → U1_ag(T7, T6, appB_in_aag(X6, T7, T6))
appB_in_aag([], T12, T12) → appB_out_aag([], T12, T12)
appB_in_aag(.(T20, X29), T22, .(T20, T21)) → U2_aag(T20, X29, T22, T21, appB_in_aag(X29, T22, T21))
U2_aag(T20, X29, T22, T21, appB_out_aag(X29, T22, T21)) → appB_out_aag(.(T20, X29), T22, .(T20, T21))
U1_ag(T7, T6, appB_out_aag(X6, T7, T6)) → suffixA_out_ag(T7, T6)

The argument filtering Pi contains the following mapping:
suffixA_in_ag(x1, x2)  =  suffixA_in_ag(x2)
U1_ag(x1, x2, x3)  =  U1_ag(x2, x3)
appB_in_aag(x1, x2, x3)  =  appB_in_aag(x3)
appB_out_aag(x1, x2, x3)  =  appB_out_aag(x1, x2, x3)
.(x1, x2)  =  .(x1, x2)
U2_aag(x1, x2, x3, x4, x5)  =  U2_aag(x1, x4, x5)
suffixA_out_ag(x1, x2)  =  suffixA_out_ag(x1, x2)
APPB_IN_AAG(x1, x2, x3)  =  APPB_IN_AAG(x3)

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:

APPB_IN_AAG(.(T20, X29), T22, .(T20, T21)) → APPB_IN_AAG(X29, T22, T21)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2)  =  .(x1, x2)
APPB_IN_AAG(x1, x2, x3)  =  APPB_IN_AAG(x3)

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

(9) PiDPToQDPProof (SOUND 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:

APPB_IN_AAG(.(T20, T21)) → APPB_IN_AAG(T21)

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:

• APPB_IN_AAG(.(T20, T21)) → APPB_IN_AAG(T21)
  The graph contains the following edges 1 > 1

(12) YES