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

(0) Obligation:

Clauses:

reverse([], X, X).
reverse(.(X, Y), Z, U) :- reverse(Y, Z, .(X, U)).

Query: reverse(g,g,a)

(1) PrologToPiTRSViaGraphTransformerProof (SOUND transformation)

Transformed Prolog program to (Pi-)TRS.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="A: reverse(T1, T2, T3)\n\nT1 is ground\nT2 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
4 [label="4: reverse(T1, T2, T3), SCOPE: 1, CLAUSE: 0 | reverse(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\nT1 is ground\nT2 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: true | reverse([], T5, T3), SCOPE: 1, CLAUSE: 1\n\nT5 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: reverse(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\nT1 is ground\nT2 is ground\nX2 is free\nreverse(T1, T2, T3) !=? reverse([], X2, X2)", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: reverse([], T5, T3), SCOPE: 1, CLAUSE: 1\n\nT5 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: reverse(T11, T12, .(T10, T14))\n\nT10 is ground\nT11 is ground\nT12 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: reverse(T11, T12, .(T10, T14)), SCOPE: 2, CLAUSE: 0 | reverse(T11, T12, .(T10, T14)), SCOPE: 2, CLAUSE: 1\n\nT10 is ground\nT11 is ground\nT12 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: reverse(T11, T12, .(T10, T14)), SCOPE: 2, CLAUSE: 0\n\nT10 is ground\nT11 is ground\nT12 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="25: reverse(T11, T12, .(T10, T14)), SCOPE: 2, CLAUSE: 1\n\nT10 is ground\nT11 is ground\nT12 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: reverse(T41, T42, .(T40, .(T43, T45)))\n\nT40 is ground\nT41 is ground\nT42 is ground\nT43 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
40 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 40 [arrowhead = none ];
40 -> 4;

41 [label="EVAL with clause\nreverse([], X2, X2).\nand substitutionT1 -> [],\nT2 -> T5,\nX2 -> T5,\nT3 -> T5", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 41 [arrowhead = none ];
41 -> 10;

42 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
4 -> 42 [arrowhead = none ];
42 -> 13;

43 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
10 -> 43 [arrowhead = none ];
43 -> 15;

44 [label="EVAL with clause\nreverse(.(X11, X12), X13, X14) :- reverse(X12, X13, .(X11, X14)).\nand substitutionX11 -> T10,\nX12 -> T11,\nT1 -> .(T10, T11),\nT2 -> T12,\nX13 -> T12,\nT3 -> T14,\nX14 -> T14,\nT13 -> T14", fontsize=14, style = filled, fillcolor = lightblue];
13 -> 44 [arrowhead = none ];
44 -> 18;

45 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
13 -> 45 [arrowhead = none ];
45 -> 19;

46 [label="BACKTRACK\nfor clause: reverse(.(X, Y), Z, U) :- reverse(Y, Z, .(X, U))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
15 -> 46 [arrowhead = none ];
46 -> 16;

47 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
18 -> 47 [arrowhead = none ];
47 -> 20;

48 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
20 -> 48 [arrowhead = none ];
48 -> 24;

49 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
20 -> 49 [arrowhead = none ];
49 -> 25;

50 [label="EVAL with clause\nreverse([], X19, X19).\nand substitutionT11 -> [],\nT12 -> .(T28, T29),\nX19 -> .(T28, T29),\nT10 -> T28,\nT14 -> T29,\nT27 -> .(T28, T29)", fontsize=14, style = filled, fillcolor = lightblue];
24 -> 50 [arrowhead = none ];
50 -> 27;

51 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
24 -> 51 [arrowhead = none ];
51 -> 30;

52 [label="EVAL with clause\nreverse(.(X28, X29), X30, X31) :- reverse(X29, X30, .(X28, X31)).\nand substitutionX28 -> T40,\nX29 -> T41,\nT11 -> .(T40, T41),\nT12 -> T42,\nX30 -> T42,\nT10 -> T43,\nT14 -> T45,\nX31 -> .(T43, T45),\nT44 -> T45", fontsize=14, style = filled, fillcolor = lightblue];
25 -> 52 [arrowhead = none ];
52 -> 38;

53 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
25 -> 53 [arrowhead = none ];
53 -> 39;

54 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
27 -> 54 [arrowhead = none ];
54 -> 31;

55 [label="INSTANCE with matching:\nT1 -> T41\nT2 -> T42\nT3 -> .(T40, .(T43, T45))", fontsize=14, style = filled, fillcolor = lightgrey];
38 -> 55 [arrowhead = none , style=dashed];
55 -> 1[style=dashed];

}

(2) Obligation:

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

reverseA_in_gga([], T5, T5) → reverseA_out_gga([], T5, T5)
reverseA_in_gga(.(T28, []), .(T28, T29), T29) → reverseA_out_gga(.(T28, []), .(T28, T29), T29)
reverseA_in_gga(.(T43, .(T40, T41)), T42, T45) → U1_gga(T43, T40, T41, T42, T45, reverseA_in_gga(T41, T42, .(T40, .(T43, T45))))
U1_gga(T43, T40, T41, T42, T45, reverseA_out_gga(T41, T42, .(T40, .(T43, T45)))) → reverseA_out_gga(.(T43, .(T40, T41)), T42, T45)

The argument filtering Pi contains the following mapping:
reverseA_in_gga(x1, x2, x3)  =  reverseA_in_gga(x1, x2)
[]  =  []
reverseA_out_gga(x1, x2, x3)  =  reverseA_out_gga(x1, x2, x3)
.(x1, x2)  =  .(x1, x2)
U1_gga(x1, x2, x3, x4, x5, x6)  =  U1_gga(x1, x2, x3, x4, x6)

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

REVERSEA_IN_GGA(.(T43, .(T40, T41)), T42, T45) → U1_GGA(T43, T40, T41, T42, T45, reverseA_in_gga(T41, T42, .(T40, .(T43, T45))))
REVERSEA_IN_GGA(.(T43, .(T40, T41)), T42, T45) → REVERSEA_IN_GGA(T41, T42, .(T40, .(T43, T45)))

The TRS R consists of the following rules:

reverseA_in_gga([], T5, T5) → reverseA_out_gga([], T5, T5)
reverseA_in_gga(.(T28, []), .(T28, T29), T29) → reverseA_out_gga(.(T28, []), .(T28, T29), T29)
reverseA_in_gga(.(T43, .(T40, T41)), T42, T45) → U1_gga(T43, T40, T41, T42, T45, reverseA_in_gga(T41, T42, .(T40, .(T43, T45))))
U1_gga(T43, T40, T41, T42, T45, reverseA_out_gga(T41, T42, .(T40, .(T43, T45)))) → reverseA_out_gga(.(T43, .(T40, T41)), T42, T45)

The argument filtering Pi contains the following mapping:
reverseA_in_gga(x1, x2, x3)  =  reverseA_in_gga(x1, x2)
[]  =  []
reverseA_out_gga(x1, x2, x3)  =  reverseA_out_gga(x1, x2, x3)
.(x1, x2)  =  .(x1, x2)
U1_gga(x1, x2, x3, x4, x5, x6)  =  U1_gga(x1, x2, x3, x4, x6)
REVERSEA_IN_GGA(x1, x2, x3)  =  REVERSEA_IN_GGA(x1, x2)
U1_GGA(x1, x2, x3, x4, x5, x6)  =  U1_GGA(x1, x2, x3, x4, x6)

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

(4) Obligation:

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

REVERSEA_IN_GGA(.(T43, .(T40, T41)), T42, T45) → U1_GGA(T43, T40, T41, T42, T45, reverseA_in_gga(T41, T42, .(T40, .(T43, T45))))
REVERSEA_IN_GGA(.(T43, .(T40, T41)), T42, T45) → REVERSEA_IN_GGA(T41, T42, .(T40, .(T43, T45)))

The TRS R consists of the following rules:

reverseA_in_gga([], T5, T5) → reverseA_out_gga([], T5, T5)
reverseA_in_gga(.(T28, []), .(T28, T29), T29) → reverseA_out_gga(.(T28, []), .(T28, T29), T29)
reverseA_in_gga(.(T43, .(T40, T41)), T42, T45) → U1_gga(T43, T40, T41, T42, T45, reverseA_in_gga(T41, T42, .(T40, .(T43, T45))))
U1_gga(T43, T40, T41, T42, T45, reverseA_out_gga(T41, T42, .(T40, .(T43, T45)))) → reverseA_out_gga(.(T43, .(T40, T41)), T42, T45)

The argument filtering Pi contains the following mapping:
reverseA_in_gga(x1, x2, x3)  =  reverseA_in_gga(x1, x2)
[]  =  []
reverseA_out_gga(x1, x2, x3)  =  reverseA_out_gga(x1, x2, x3)
.(x1, x2)  =  .(x1, x2)
U1_gga(x1, x2, x3, x4, x5, x6)  =  U1_gga(x1, x2, x3, x4, x6)
REVERSEA_IN_GGA(x1, x2, x3)  =  REVERSEA_IN_GGA(x1, x2)
U1_GGA(x1, x2, x3, x4, x5, x6)  =  U1_GGA(x1, x2, x3, x4, x6)

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:

REVERSEA_IN_GGA(.(T43, .(T40, T41)), T42, T45) → REVERSEA_IN_GGA(T41, T42, .(T40, .(T43, T45)))

The TRS R consists of the following rules:

reverseA_in_gga([], T5, T5) → reverseA_out_gga([], T5, T5)
reverseA_in_gga(.(T28, []), .(T28, T29), T29) → reverseA_out_gga(.(T28, []), .(T28, T29), T29)
reverseA_in_gga(.(T43, .(T40, T41)), T42, T45) → U1_gga(T43, T40, T41, T42, T45, reverseA_in_gga(T41, T42, .(T40, .(T43, T45))))
U1_gga(T43, T40, T41, T42, T45, reverseA_out_gga(T41, T42, .(T40, .(T43, T45)))) → reverseA_out_gga(.(T43, .(T40, T41)), T42, T45)

The argument filtering Pi contains the following mapping:
reverseA_in_gga(x1, x2, x3)  =  reverseA_in_gga(x1, x2)
[]  =  []
reverseA_out_gga(x1, x2, x3)  =  reverseA_out_gga(x1, x2, x3)
.(x1, x2)  =  .(x1, x2)
U1_gga(x1, x2, x3, x4, x5, x6)  =  U1_gga(x1, x2, x3, x4, x6)
REVERSEA_IN_GGA(x1, x2, x3)  =  REVERSEA_IN_GGA(x1, x2)

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:

REVERSEA_IN_GGA(.(T43, .(T40, T41)), T42, T45) → REVERSEA_IN_GGA(T41, T42, .(T40, .(T43, T45)))

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

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:

REVERSEA_IN_GGA(.(T43, .(T40, T41)), T42) → REVERSEA_IN_GGA(T41, T42)

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:

• REVERSEA_IN_GGA(.(T43, .(T40, T41)), T42) → REVERSEA_IN_GGA(T41, T42)
  The graph contains the following edges 1 > 1, 2 >= 2

(12) YES