(0) Obligation:

Clauses:

palindrome(Xs) :- reverse(Xs, Xs).
reverse(X1s, X2s) :- reverse(X1s, [], X2s).
reverse([], Xs, Xs).
reverse(.(X, X1s), X2s, Ys) :- reverse(X1s, .(X, X2s), Ys).

Queries:

palindrome(g).

(1) PrologToPrologProblemTransformerProof (SOUND transformation)

Built Prolog problem from termination graph.

(2) Obligation:

Clauses:

reverse70([], T365, T366, T365, T366).
reverse70(.(T379, T380), T381, T382, T383, T384) :- reverse70(T380, T379, .(T381, T382), T383, T384).
palindrome1([]).
palindrome1(.(T19, [])).
palindrome1(.(T42, .(T42, []))).
palindrome1(.(T75, .(T74, .(T75, [])))).
palindrome1(.(T118, .(T117, .(T117, .(T118, []))))).
palindrome1(.(T171, .(T170, .(T169, .(T170, .(T171, [])))))).
palindrome1(.(T234, .(T233, .(T232, .(T232, .(T233, .(T234, []))))))).
palindrome1(.(T307, .(T306, .(T305, .(T304, .(T305, .(T306, .(T307, [])))))))).
palindrome1(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) :- reverse70(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))).

Queries:

palindrome1(g).

(3) PrologToPiTRSProof (SOUND transformation)

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

palindrome1_in_g([]) → palindrome1_out_g([])
palindrome1_in_g(.(T19, [])) → palindrome1_out_g(.(T19, []))
palindrome1_in_g(.(T42, .(T42, []))) → palindrome1_out_g(.(T42, .(T42, [])))
palindrome1_in_g(.(T75, .(T74, .(T75, [])))) → palindrome1_out_g(.(T75, .(T74, .(T75, []))))
palindrome1_in_g(.(T118, .(T117, .(T117, .(T118, []))))) → palindrome1_out_g(.(T118, .(T117, .(T117, .(T118, [])))))
palindrome1_in_g(.(T171, .(T170, .(T169, .(T170, .(T171, [])))))) → palindrome1_out_g(.(T171, .(T170, .(T169, .(T170, .(T171, []))))))
palindrome1_in_g(.(T234, .(T233, .(T232, .(T232, .(T233, .(T234, []))))))) → palindrome1_out_g(.(T234, .(T233, .(T232, .(T232, .(T233, .(T234, [])))))))
palindrome1_in_g(.(T307, .(T306, .(T305, .(T304, .(T305, .(T306, .(T307, [])))))))) → palindrome1_out_g(.(T307, .(T306, .(T305, .(T304, .(T305, .(T306, .(T307, []))))))))
palindrome1_in_g(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → U2_g(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_in_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))
reverse70_in_ggggg([], T365, T366, T365, T366) → reverse70_out_ggggg([], T365, T366, T365, T366)
reverse70_in_ggggg(.(T379, T380), T381, T382, T383, T384) → U1_ggggg(T379, T380, T381, T382, T383, T384, reverse70_in_ggggg(T380, T379, .(T381, T382), T383, T384))
U1_ggggg(T379, T380, T381, T382, T383, T384, reverse70_out_ggggg(T380, T379, .(T381, T382), T383, T384)) → reverse70_out_ggggg(.(T379, T380), T381, T382, T383, T384)
U2_g(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_out_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → palindrome1_out_g(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))

The argument filtering Pi contains the following mapping:
palindrome1_in_g(x1)  =  palindrome1_in_g(x1)
[]  =  []
palindrome1_out_g(x1)  =  palindrome1_out_g
.(x1, x2)  =  .(x1, x2)
U2_g(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_g(x10)
reverse70_in_ggggg(x1, x2, x3, x4, x5)  =  reverse70_in_ggggg(x1, x2, x3, x4, x5)
reverse70_out_ggggg(x1, x2, x3, x4, x5)  =  reverse70_out_ggggg
U1_ggggg(x1, x2, x3, x4, x5, x6, x7)  =  U1_ggggg(x7)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(4) Obligation:

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

palindrome1_in_g([]) → palindrome1_out_g([])
palindrome1_in_g(.(T19, [])) → palindrome1_out_g(.(T19, []))
palindrome1_in_g(.(T42, .(T42, []))) → palindrome1_out_g(.(T42, .(T42, [])))
palindrome1_in_g(.(T75, .(T74, .(T75, [])))) → palindrome1_out_g(.(T75, .(T74, .(T75, []))))
palindrome1_in_g(.(T118, .(T117, .(T117, .(T118, []))))) → palindrome1_out_g(.(T118, .(T117, .(T117, .(T118, [])))))
palindrome1_in_g(.(T171, .(T170, .(T169, .(T170, .(T171, [])))))) → palindrome1_out_g(.(T171, .(T170, .(T169, .(T170, .(T171, []))))))
palindrome1_in_g(.(T234, .(T233, .(T232, .(T232, .(T233, .(T234, []))))))) → palindrome1_out_g(.(T234, .(T233, .(T232, .(T232, .(T233, .(T234, [])))))))
palindrome1_in_g(.(T307, .(T306, .(T305, .(T304, .(T305, .(T306, .(T307, [])))))))) → palindrome1_out_g(.(T307, .(T306, .(T305, .(T304, .(T305, .(T306, .(T307, []))))))))
palindrome1_in_g(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → U2_g(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_in_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))
reverse70_in_ggggg([], T365, T366, T365, T366) → reverse70_out_ggggg([], T365, T366, T365, T366)
reverse70_in_ggggg(.(T379, T380), T381, T382, T383, T384) → U1_ggggg(T379, T380, T381, T382, T383, T384, reverse70_in_ggggg(T380, T379, .(T381, T382), T383, T384))
U1_ggggg(T379, T380, T381, T382, T383, T384, reverse70_out_ggggg(T380, T379, .(T381, T382), T383, T384)) → reverse70_out_ggggg(.(T379, T380), T381, T382, T383, T384)
U2_g(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_out_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → palindrome1_out_g(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))

The argument filtering Pi contains the following mapping:
palindrome1_in_g(x1)  =  palindrome1_in_g(x1)
[]  =  []
palindrome1_out_g(x1)  =  palindrome1_out_g
.(x1, x2)  =  .(x1, x2)
U2_g(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_g(x10)
reverse70_in_ggggg(x1, x2, x3, x4, x5)  =  reverse70_in_ggggg(x1, x2, x3, x4, x5)
reverse70_out_ggggg(x1, x2, x3, x4, x5)  =  reverse70_out_ggggg
U1_ggggg(x1, x2, x3, x4, x5, x6, x7)  =  U1_ggggg(x7)

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

PALINDROME1_IN_G(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → U2_G(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_in_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))
PALINDROME1_IN_G(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → REVERSE70_IN_GGGGG(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))
REVERSE70_IN_GGGGG(.(T379, T380), T381, T382, T383, T384) → U1_GGGGG(T379, T380, T381, T382, T383, T384, reverse70_in_ggggg(T380, T379, .(T381, T382), T383, T384))
REVERSE70_IN_GGGGG(.(T379, T380), T381, T382, T383, T384) → REVERSE70_IN_GGGGG(T380, T379, .(T381, T382), T383, T384)

The TRS R consists of the following rules:

palindrome1_in_g([]) → palindrome1_out_g([])
palindrome1_in_g(.(T19, [])) → palindrome1_out_g(.(T19, []))
palindrome1_in_g(.(T42, .(T42, []))) → palindrome1_out_g(.(T42, .(T42, [])))
palindrome1_in_g(.(T75, .(T74, .(T75, [])))) → palindrome1_out_g(.(T75, .(T74, .(T75, []))))
palindrome1_in_g(.(T118, .(T117, .(T117, .(T118, []))))) → palindrome1_out_g(.(T118, .(T117, .(T117, .(T118, [])))))
palindrome1_in_g(.(T171, .(T170, .(T169, .(T170, .(T171, [])))))) → palindrome1_out_g(.(T171, .(T170, .(T169, .(T170, .(T171, []))))))
palindrome1_in_g(.(T234, .(T233, .(T232, .(T232, .(T233, .(T234, []))))))) → palindrome1_out_g(.(T234, .(T233, .(T232, .(T232, .(T233, .(T234, [])))))))
palindrome1_in_g(.(T307, .(T306, .(T305, .(T304, .(T305, .(T306, .(T307, [])))))))) → palindrome1_out_g(.(T307, .(T306, .(T305, .(T304, .(T305, .(T306, .(T307, []))))))))
palindrome1_in_g(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → U2_g(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_in_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))
reverse70_in_ggggg([], T365, T366, T365, T366) → reverse70_out_ggggg([], T365, T366, T365, T366)
reverse70_in_ggggg(.(T379, T380), T381, T382, T383, T384) → U1_ggggg(T379, T380, T381, T382, T383, T384, reverse70_in_ggggg(T380, T379, .(T381, T382), T383, T384))
U1_ggggg(T379, T380, T381, T382, T383, T384, reverse70_out_ggggg(T380, T379, .(T381, T382), T383, T384)) → reverse70_out_ggggg(.(T379, T380), T381, T382, T383, T384)
U2_g(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_out_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → palindrome1_out_g(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))

The argument filtering Pi contains the following mapping:
palindrome1_in_g(x1)  =  palindrome1_in_g(x1)
[]  =  []
palindrome1_out_g(x1)  =  palindrome1_out_g
.(x1, x2)  =  .(x1, x2)
U2_g(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_g(x10)
reverse70_in_ggggg(x1, x2, x3, x4, x5)  =  reverse70_in_ggggg(x1, x2, x3, x4, x5)
reverse70_out_ggggg(x1, x2, x3, x4, x5)  =  reverse70_out_ggggg
U1_ggggg(x1, x2, x3, x4, x5, x6, x7)  =  U1_ggggg(x7)
PALINDROME1_IN_G(x1)  =  PALINDROME1_IN_G(x1)
U2_G(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_G(x10)
REVERSE70_IN_GGGGG(x1, x2, x3, x4, x5)  =  REVERSE70_IN_GGGGG(x1, x2, x3, x4, x5)
U1_GGGGG(x1, x2, x3, x4, x5, x6, x7)  =  U1_GGGGG(x7)

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

(6) Obligation:

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

PALINDROME1_IN_G(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → U2_G(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_in_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))
PALINDROME1_IN_G(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → REVERSE70_IN_GGGGG(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))
REVERSE70_IN_GGGGG(.(T379, T380), T381, T382, T383, T384) → U1_GGGGG(T379, T380, T381, T382, T383, T384, reverse70_in_ggggg(T380, T379, .(T381, T382), T383, T384))
REVERSE70_IN_GGGGG(.(T379, T380), T381, T382, T383, T384) → REVERSE70_IN_GGGGG(T380, T379, .(T381, T382), T383, T384)

The TRS R consists of the following rules:

palindrome1_in_g([]) → palindrome1_out_g([])
palindrome1_in_g(.(T19, [])) → palindrome1_out_g(.(T19, []))
palindrome1_in_g(.(T42, .(T42, []))) → palindrome1_out_g(.(T42, .(T42, [])))
palindrome1_in_g(.(T75, .(T74, .(T75, [])))) → palindrome1_out_g(.(T75, .(T74, .(T75, []))))
palindrome1_in_g(.(T118, .(T117, .(T117, .(T118, []))))) → palindrome1_out_g(.(T118, .(T117, .(T117, .(T118, [])))))
palindrome1_in_g(.(T171, .(T170, .(T169, .(T170, .(T171, [])))))) → palindrome1_out_g(.(T171, .(T170, .(T169, .(T170, .(T171, []))))))
palindrome1_in_g(.(T234, .(T233, .(T232, .(T232, .(T233, .(T234, []))))))) → palindrome1_out_g(.(T234, .(T233, .(T232, .(T232, .(T233, .(T234, [])))))))
palindrome1_in_g(.(T307, .(T306, .(T305, .(T304, .(T305, .(T306, .(T307, [])))))))) → palindrome1_out_g(.(T307, .(T306, .(T305, .(T304, .(T305, .(T306, .(T307, []))))))))
palindrome1_in_g(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → U2_g(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_in_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))
reverse70_in_ggggg([], T365, T366, T365, T366) → reverse70_out_ggggg([], T365, T366, T365, T366)
reverse70_in_ggggg(.(T379, T380), T381, T382, T383, T384) → U1_ggggg(T379, T380, T381, T382, T383, T384, reverse70_in_ggggg(T380, T379, .(T381, T382), T383, T384))
U1_ggggg(T379, T380, T381, T382, T383, T384, reverse70_out_ggggg(T380, T379, .(T381, T382), T383, T384)) → reverse70_out_ggggg(.(T379, T380), T381, T382, T383, T384)
U2_g(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_out_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → palindrome1_out_g(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))

The argument filtering Pi contains the following mapping:
palindrome1_in_g(x1)  =  palindrome1_in_g(x1)
[]  =  []
palindrome1_out_g(x1)  =  palindrome1_out_g
.(x1, x2)  =  .(x1, x2)
U2_g(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_g(x10)
reverse70_in_ggggg(x1, x2, x3, x4, x5)  =  reverse70_in_ggggg(x1, x2, x3, x4, x5)
reverse70_out_ggggg(x1, x2, x3, x4, x5)  =  reverse70_out_ggggg
U1_ggggg(x1, x2, x3, x4, x5, x6, x7)  =  U1_ggggg(x7)
PALINDROME1_IN_G(x1)  =  PALINDROME1_IN_G(x1)
U2_G(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_G(x10)
REVERSE70_IN_GGGGG(x1, x2, x3, x4, x5)  =  REVERSE70_IN_GGGGG(x1, x2, x3, x4, x5)
U1_GGGGG(x1, x2, x3, x4, x5, x6, x7)  =  U1_GGGGG(x7)

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

(7) DependencyGraphProof (EQUIVALENT transformation)

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

(8) Obligation:

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

REVERSE70_IN_GGGGG(.(T379, T380), T381, T382, T383, T384) → REVERSE70_IN_GGGGG(T380, T379, .(T381, T382), T383, T384)

The TRS R consists of the following rules:

palindrome1_in_g([]) → palindrome1_out_g([])
palindrome1_in_g(.(T19, [])) → palindrome1_out_g(.(T19, []))
palindrome1_in_g(.(T42, .(T42, []))) → palindrome1_out_g(.(T42, .(T42, [])))
palindrome1_in_g(.(T75, .(T74, .(T75, [])))) → palindrome1_out_g(.(T75, .(T74, .(T75, []))))
palindrome1_in_g(.(T118, .(T117, .(T117, .(T118, []))))) → palindrome1_out_g(.(T118, .(T117, .(T117, .(T118, [])))))
palindrome1_in_g(.(T171, .(T170, .(T169, .(T170, .(T171, [])))))) → palindrome1_out_g(.(T171, .(T170, .(T169, .(T170, .(T171, []))))))
palindrome1_in_g(.(T234, .(T233, .(T232, .(T232, .(T233, .(T234, []))))))) → palindrome1_out_g(.(T234, .(T233, .(T232, .(T232, .(T233, .(T234, [])))))))
palindrome1_in_g(.(T307, .(T306, .(T305, .(T304, .(T305, .(T306, .(T307, [])))))))) → palindrome1_out_g(.(T307, .(T306, .(T305, .(T304, .(T305, .(T306, .(T307, []))))))))
palindrome1_in_g(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → U2_g(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_in_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))
reverse70_in_ggggg([], T365, T366, T365, T366) → reverse70_out_ggggg([], T365, T366, T365, T366)
reverse70_in_ggggg(.(T379, T380), T381, T382, T383, T384) → U1_ggggg(T379, T380, T381, T382, T383, T384, reverse70_in_ggggg(T380, T379, .(T381, T382), T383, T384))
U1_ggggg(T379, T380, T381, T382, T383, T384, reverse70_out_ggggg(T380, T379, .(T381, T382), T383, T384)) → reverse70_out_ggggg(.(T379, T380), T381, T382, T383, T384)
U2_g(T334, T333, T332, T331, T330, T329, T328, T326, T327, reverse70_out_ggggg(T327, T326, .(T328, .(T329, .(T330, .(T331, .(T332, .(T333, .(T334, []))))))), T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327))))))))) → palindrome1_out_g(.(T334, .(T333, .(T332, .(T331, .(T330, .(T329, .(T328, .(T326, T327)))))))))

The argument filtering Pi contains the following mapping:
palindrome1_in_g(x1)  =  palindrome1_in_g(x1)
[]  =  []
palindrome1_out_g(x1)  =  palindrome1_out_g
.(x1, x2)  =  .(x1, x2)
U2_g(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_g(x10)
reverse70_in_ggggg(x1, x2, x3, x4, x5)  =  reverse70_in_ggggg(x1, x2, x3, x4, x5)
reverse70_out_ggggg(x1, x2, x3, x4, x5)  =  reverse70_out_ggggg
U1_ggggg(x1, x2, x3, x4, x5, x6, x7)  =  U1_ggggg(x7)
REVERSE70_IN_GGGGG(x1, x2, x3, x4, x5)  =  REVERSE70_IN_GGGGG(x1, x2, x3, x4, x5)

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

(9) UsableRulesProof (EQUIVALENT transformation)

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

(10) Obligation:

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

REVERSE70_IN_GGGGG(.(T379, T380), T381, T382, T383, T384) → REVERSE70_IN_GGGGG(T380, T379, .(T381, T382), T383, T384)

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

(11) PiDPToQDPProof (EQUIVALENT transformation)

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

(12) Obligation:

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

REVERSE70_IN_GGGGG(.(T379, T380), T381, T382, T383, T384) → REVERSE70_IN_GGGGG(T380, T379, .(T381, T382), T383, T384)

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

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

  • REVERSE70_IN_GGGGG(.(T379, T380), T381, T382, T383, T384) → REVERSE70_IN_GGGGG(T380, T379, .(T381, T382), T383, T384)
    The graph contains the following edges 1 > 1, 1 > 2, 4 >= 4, 5 >= 5

(14) YES