(0) Obligation:

Clauses:

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

Queries:

palindrome(g).

(1) PrologToPrologProblemTransformerProof (SOUND transformation)

Built Prolog problem from termination graph.

(2) Obligation:

Clauses:

reverse346(.(T315, T316), T317, T318, T319, T320) :- reverse346(T316, T315, .(T317, T318), T319, T320).
reverse346([], T332, T333, T332, T333).
palindrome1(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) :- reverse346(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))).
palindrome1(.(T354, .(T353, .(T352, .(T351, .(T352, .(T353, .(T354, [])))))))).
palindrome1(.(T372, .(T371, .(T370, .(T370, .(T371, .(T372, []))))))).
palindrome1(.(T387, .(T386, .(T385, .(T386, .(T387, [])))))).
palindrome1(.(T399, .(T398, .(T398, .(T399, []))))).
palindrome1(.(T408, .(T407, .(T408, [])))).
palindrome1(.(T414, .(T414, []))).
palindrome1(.(T417, [])).
palindrome1([]).

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)
reverse346_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(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → U2_g(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_in_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
reverse346_in_ggggg(.(T315, T316), T317, T318, T319, T320) → U1_ggggg(T315, T316, T317, T318, T319, T320, reverse346_in_ggggg(T316, T315, .(T317, T318), T319, T320))
reverse346_in_ggggg([], T332, T333, T332, T333) → reverse346_out_ggggg([], T332, T333, T332, T333)
U1_ggggg(T315, T316, T317, T318, T319, T320, reverse346_out_ggggg(T316, T315, .(T317, T318), T319, T320)) → reverse346_out_ggggg(.(T315, T316), T317, T318, T319, T320)
U2_g(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_out_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → palindrome1_out_g(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
palindrome1_in_g(.(T354, .(T353, .(T352, .(T351, .(T352, .(T353, .(T354, [])))))))) → palindrome1_out_g(.(T354, .(T353, .(T352, .(T351, .(T352, .(T353, .(T354, []))))))))
palindrome1_in_g(.(T372, .(T371, .(T370, .(T370, .(T371, .(T372, []))))))) → palindrome1_out_g(.(T372, .(T371, .(T370, .(T370, .(T371, .(T372, [])))))))
palindrome1_in_g(.(T387, .(T386, .(T385, .(T386, .(T387, [])))))) → palindrome1_out_g(.(T387, .(T386, .(T385, .(T386, .(T387, []))))))
palindrome1_in_g(.(T399, .(T398, .(T398, .(T399, []))))) → palindrome1_out_g(.(T399, .(T398, .(T398, .(T399, [])))))
palindrome1_in_g(.(T408, .(T407, .(T408, [])))) → palindrome1_out_g(.(T408, .(T407, .(T408, []))))
palindrome1_in_g(.(T414, .(T414, []))) → palindrome1_out_g(.(T414, .(T414, [])))
palindrome1_in_g(.(T417, [])) → palindrome1_out_g(.(T417, []))
palindrome1_in_g([]) → palindrome1_out_g([])

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

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(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → U2_g(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_in_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
reverse346_in_ggggg(.(T315, T316), T317, T318, T319, T320) → U1_ggggg(T315, T316, T317, T318, T319, T320, reverse346_in_ggggg(T316, T315, .(T317, T318), T319, T320))
reverse346_in_ggggg([], T332, T333, T332, T333) → reverse346_out_ggggg([], T332, T333, T332, T333)
U1_ggggg(T315, T316, T317, T318, T319, T320, reverse346_out_ggggg(T316, T315, .(T317, T318), T319, T320)) → reverse346_out_ggggg(.(T315, T316), T317, T318, T319, T320)
U2_g(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_out_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → palindrome1_out_g(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
palindrome1_in_g(.(T354, .(T353, .(T352, .(T351, .(T352, .(T353, .(T354, [])))))))) → palindrome1_out_g(.(T354, .(T353, .(T352, .(T351, .(T352, .(T353, .(T354, []))))))))
palindrome1_in_g(.(T372, .(T371, .(T370, .(T370, .(T371, .(T372, []))))))) → palindrome1_out_g(.(T372, .(T371, .(T370, .(T370, .(T371, .(T372, [])))))))
palindrome1_in_g(.(T387, .(T386, .(T385, .(T386, .(T387, [])))))) → palindrome1_out_g(.(T387, .(T386, .(T385, .(T386, .(T387, []))))))
palindrome1_in_g(.(T399, .(T398, .(T398, .(T399, []))))) → palindrome1_out_g(.(T399, .(T398, .(T398, .(T399, [])))))
palindrome1_in_g(.(T408, .(T407, .(T408, [])))) → palindrome1_out_g(.(T408, .(T407, .(T408, []))))
palindrome1_in_g(.(T414, .(T414, []))) → palindrome1_out_g(.(T414, .(T414, [])))
palindrome1_in_g(.(T417, [])) → palindrome1_out_g(.(T417, []))
palindrome1_in_g([]) → palindrome1_out_g([])

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

(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(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → U2_G(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_in_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
PALINDROME1_IN_G(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → REVERSE346_IN_GGGGG(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))
REVERSE346_IN_GGGGG(.(T315, T316), T317, T318, T319, T320) → U1_GGGGG(T315, T316, T317, T318, T319, T320, reverse346_in_ggggg(T316, T315, .(T317, T318), T319, T320))
REVERSE346_IN_GGGGG(.(T315, T316), T317, T318, T319, T320) → REVERSE346_IN_GGGGG(T316, T315, .(T317, T318), T319, T320)

The TRS R consists of the following rules:

palindrome1_in_g(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → U2_g(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_in_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
reverse346_in_ggggg(.(T315, T316), T317, T318, T319, T320) → U1_ggggg(T315, T316, T317, T318, T319, T320, reverse346_in_ggggg(T316, T315, .(T317, T318), T319, T320))
reverse346_in_ggggg([], T332, T333, T332, T333) → reverse346_out_ggggg([], T332, T333, T332, T333)
U1_ggggg(T315, T316, T317, T318, T319, T320, reverse346_out_ggggg(T316, T315, .(T317, T318), T319, T320)) → reverse346_out_ggggg(.(T315, T316), T317, T318, T319, T320)
U2_g(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_out_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → palindrome1_out_g(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
palindrome1_in_g(.(T354, .(T353, .(T352, .(T351, .(T352, .(T353, .(T354, [])))))))) → palindrome1_out_g(.(T354, .(T353, .(T352, .(T351, .(T352, .(T353, .(T354, []))))))))
palindrome1_in_g(.(T372, .(T371, .(T370, .(T370, .(T371, .(T372, []))))))) → palindrome1_out_g(.(T372, .(T371, .(T370, .(T370, .(T371, .(T372, [])))))))
palindrome1_in_g(.(T387, .(T386, .(T385, .(T386, .(T387, [])))))) → palindrome1_out_g(.(T387, .(T386, .(T385, .(T386, .(T387, []))))))
palindrome1_in_g(.(T399, .(T398, .(T398, .(T399, []))))) → palindrome1_out_g(.(T399, .(T398, .(T398, .(T399, [])))))
palindrome1_in_g(.(T408, .(T407, .(T408, [])))) → palindrome1_out_g(.(T408, .(T407, .(T408, []))))
palindrome1_in_g(.(T414, .(T414, []))) → palindrome1_out_g(.(T414, .(T414, [])))
palindrome1_in_g(.(T417, [])) → palindrome1_out_g(.(T417, []))
palindrome1_in_g([]) → palindrome1_out_g([])

The argument filtering Pi contains the following mapping:
palindrome1_in_g(x1)  =  palindrome1_in_g(x1)
.(x1, x2)  =  .(x1, x2)
U2_g(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_g(x10)
reverse346_in_ggggg(x1, x2, x3, x4, x5)  =  reverse346_in_ggggg(x1, x2, x3, x4, x5)
U1_ggggg(x1, x2, x3, x4, x5, x6, x7)  =  U1_ggggg(x7)
[]  =  []
reverse346_out_ggggg(x1, x2, x3, x4, x5)  =  reverse346_out_ggggg
palindrome1_out_g(x1)  =  palindrome1_out_g
PALINDROME1_IN_G(x1)  =  PALINDROME1_IN_G(x1)
U2_G(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_G(x10)
REVERSE346_IN_GGGGG(x1, x2, x3, x4, x5)  =  REVERSE346_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(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → U2_G(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_in_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
PALINDROME1_IN_G(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → REVERSE346_IN_GGGGG(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))
REVERSE346_IN_GGGGG(.(T315, T316), T317, T318, T319, T320) → U1_GGGGG(T315, T316, T317, T318, T319, T320, reverse346_in_ggggg(T316, T315, .(T317, T318), T319, T320))
REVERSE346_IN_GGGGG(.(T315, T316), T317, T318, T319, T320) → REVERSE346_IN_GGGGG(T316, T315, .(T317, T318), T319, T320)

The TRS R consists of the following rules:

palindrome1_in_g(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → U2_g(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_in_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
reverse346_in_ggggg(.(T315, T316), T317, T318, T319, T320) → U1_ggggg(T315, T316, T317, T318, T319, T320, reverse346_in_ggggg(T316, T315, .(T317, T318), T319, T320))
reverse346_in_ggggg([], T332, T333, T332, T333) → reverse346_out_ggggg([], T332, T333, T332, T333)
U1_ggggg(T315, T316, T317, T318, T319, T320, reverse346_out_ggggg(T316, T315, .(T317, T318), T319, T320)) → reverse346_out_ggggg(.(T315, T316), T317, T318, T319, T320)
U2_g(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_out_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → palindrome1_out_g(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
palindrome1_in_g(.(T354, .(T353, .(T352, .(T351, .(T352, .(T353, .(T354, [])))))))) → palindrome1_out_g(.(T354, .(T353, .(T352, .(T351, .(T352, .(T353, .(T354, []))))))))
palindrome1_in_g(.(T372, .(T371, .(T370, .(T370, .(T371, .(T372, []))))))) → palindrome1_out_g(.(T372, .(T371, .(T370, .(T370, .(T371, .(T372, [])))))))
palindrome1_in_g(.(T387, .(T386, .(T385, .(T386, .(T387, [])))))) → palindrome1_out_g(.(T387, .(T386, .(T385, .(T386, .(T387, []))))))
palindrome1_in_g(.(T399, .(T398, .(T398, .(T399, []))))) → palindrome1_out_g(.(T399, .(T398, .(T398, .(T399, [])))))
palindrome1_in_g(.(T408, .(T407, .(T408, [])))) → palindrome1_out_g(.(T408, .(T407, .(T408, []))))
palindrome1_in_g(.(T414, .(T414, []))) → palindrome1_out_g(.(T414, .(T414, [])))
palindrome1_in_g(.(T417, [])) → palindrome1_out_g(.(T417, []))
palindrome1_in_g([]) → palindrome1_out_g([])

The argument filtering Pi contains the following mapping:
palindrome1_in_g(x1)  =  palindrome1_in_g(x1)
.(x1, x2)  =  .(x1, x2)
U2_g(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_g(x10)
reverse346_in_ggggg(x1, x2, x3, x4, x5)  =  reverse346_in_ggggg(x1, x2, x3, x4, x5)
U1_ggggg(x1, x2, x3, x4, x5, x6, x7)  =  U1_ggggg(x7)
[]  =  []
reverse346_out_ggggg(x1, x2, x3, x4, x5)  =  reverse346_out_ggggg
palindrome1_out_g(x1)  =  palindrome1_out_g
PALINDROME1_IN_G(x1)  =  PALINDROME1_IN_G(x1)
U2_G(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_G(x10)
REVERSE346_IN_GGGGG(x1, x2, x3, x4, x5)  =  REVERSE346_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:

REVERSE346_IN_GGGGG(.(T315, T316), T317, T318, T319, T320) → REVERSE346_IN_GGGGG(T316, T315, .(T317, T318), T319, T320)

The TRS R consists of the following rules:

palindrome1_in_g(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → U2_g(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_in_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
reverse346_in_ggggg(.(T315, T316), T317, T318, T319, T320) → U1_ggggg(T315, T316, T317, T318, T319, T320, reverse346_in_ggggg(T316, T315, .(T317, T318), T319, T320))
reverse346_in_ggggg([], T332, T333, T332, T333) → reverse346_out_ggggg([], T332, T333, T332, T333)
U1_ggggg(T315, T316, T317, T318, T319, T320, reverse346_out_ggggg(T316, T315, .(T317, T318), T319, T320)) → reverse346_out_ggggg(.(T315, T316), T317, T318, T319, T320)
U2_g(T272, T271, T270, T269, T268, T267, T266, T264, T265, reverse346_out_ggggg(T265, T264, .(T266, .(T267, .(T268, .(T269, .(T270, .(T271, .(T272, []))))))), T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265))))))))) → palindrome1_out_g(.(T272, .(T271, .(T270, .(T269, .(T268, .(T267, .(T266, .(T264, T265)))))))))
palindrome1_in_g(.(T354, .(T353, .(T352, .(T351, .(T352, .(T353, .(T354, [])))))))) → palindrome1_out_g(.(T354, .(T353, .(T352, .(T351, .(T352, .(T353, .(T354, []))))))))
palindrome1_in_g(.(T372, .(T371, .(T370, .(T370, .(T371, .(T372, []))))))) → palindrome1_out_g(.(T372, .(T371, .(T370, .(T370, .(T371, .(T372, [])))))))
palindrome1_in_g(.(T387, .(T386, .(T385, .(T386, .(T387, [])))))) → palindrome1_out_g(.(T387, .(T386, .(T385, .(T386, .(T387, []))))))
palindrome1_in_g(.(T399, .(T398, .(T398, .(T399, []))))) → palindrome1_out_g(.(T399, .(T398, .(T398, .(T399, [])))))
palindrome1_in_g(.(T408, .(T407, .(T408, [])))) → palindrome1_out_g(.(T408, .(T407, .(T408, []))))
palindrome1_in_g(.(T414, .(T414, []))) → palindrome1_out_g(.(T414, .(T414, [])))
palindrome1_in_g(.(T417, [])) → palindrome1_out_g(.(T417, []))
palindrome1_in_g([]) → palindrome1_out_g([])

The argument filtering Pi contains the following mapping:
palindrome1_in_g(x1)  =  palindrome1_in_g(x1)
.(x1, x2)  =  .(x1, x2)
U2_g(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)  =  U2_g(x10)
reverse346_in_ggggg(x1, x2, x3, x4, x5)  =  reverse346_in_ggggg(x1, x2, x3, x4, x5)
U1_ggggg(x1, x2, x3, x4, x5, x6, x7)  =  U1_ggggg(x7)
[]  =  []
reverse346_out_ggggg(x1, x2, x3, x4, x5)  =  reverse346_out_ggggg
palindrome1_out_g(x1)  =  palindrome1_out_g
REVERSE346_IN_GGGGG(x1, x2, x3, x4, x5)  =  REVERSE346_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:

REVERSE346_IN_GGGGG(.(T315, T316), T317, T318, T319, T320) → REVERSE346_IN_GGGGG(T316, T315, .(T317, T318), T319, T320)

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:

REVERSE346_IN_GGGGG(.(T315, T316), T317, T318, T319, T320) → REVERSE346_IN_GGGGG(T316, T315, .(T317, T318), T319, T320)

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:

  • REVERSE346_IN_GGGGG(.(T315, T316), T317, T318, T319, T320) → REVERSE346_IN_GGGGG(T316, T315, .(T317, T318), T319, T320)
    The graph contains the following edges 1 > 1, 1 > 2, 4 >= 4, 5 >= 5

(14) YES