(0) Obligation:
Clauses:
rev(L, R) :- rev(L, [], R).
rev([], Y, Z) :- ','(!, eq(Y, Z)).
rev(L, S, R) :- ','(head(L, X), ','(tail(L, T), rev(T, .(X, S), R))).
head([], X1).
head(.(X, X2), X).
tail([], []).
tail(.(X3, Xs), Xs).
eq(X, X).
Queries:
rev(g,a).
(1) PrologToDTProblemTransformerProof (SOUND transformation)
Built DT problem from termination graph.
(2) Obligation:
Triples:
rev132(.(T714, T715), T689, T690, T692) :- rev132(T715, T714, .(T689, T690), T692).
rev1(.(T606, .(T605, .(T604, .(T603, .(T602, .(T601, .(T600, .(T645, T646)))))))), T608) :- rev132(T646, T645, .(T600, .(T601, .(T602, .(T603, .(T604, .(T605, .(T606, []))))))), T608).
Clauses:
revc132([], T674, T675, .(T674, T675)).
revc132(.(T714, T715), T689, T690, T692) :- revc132(T715, T714, .(T689, T690), T692).
Afs:
rev1(x1, x2) = rev1(x1)
(3) TriplesToPiDPProof (SOUND transformation)
We use the technique of [LOPSTR]. With regard to the inferred argument filtering the predicates were used in the following modes:
rev1_in: (b,f)
rev132_in: (b,b,b,f)
Transforming
TRIPLES into the following
Term Rewriting System:
Pi DP problem:
The TRS P consists of the following rules:
REV1_IN_GA(.(T606, .(T605, .(T604, .(T603, .(T602, .(T601, .(T600, .(T645, T646)))))))), T608) → U2_GA(T606, T605, T604, T603, T602, T601, T600, T645, T646, T608, rev132_in_ggga(T646, T645, .(T600, .(T601, .(T602, .(T603, .(T604, .(T605, .(T606, []))))))), T608))
REV1_IN_GA(.(T606, .(T605, .(T604, .(T603, .(T602, .(T601, .(T600, .(T645, T646)))))))), T608) → REV132_IN_GGGA(T646, T645, .(T600, .(T601, .(T602, .(T603, .(T604, .(T605, .(T606, []))))))), T608)
REV132_IN_GGGA(.(T714, T715), T689, T690, T692) → U1_GGGA(T714, T715, T689, T690, T692, rev132_in_ggga(T715, T714, .(T689, T690), T692))
REV132_IN_GGGA(.(T714, T715), T689, T690, T692) → REV132_IN_GGGA(T715, T714, .(T689, T690), T692)
R is empty.
The argument filtering Pi contains the following mapping:
.(
x1,
x2) =
.(
x1,
x2)
rev132_in_ggga(
x1,
x2,
x3,
x4) =
rev132_in_ggga(
x1,
x2,
x3)
[] =
[]
REV1_IN_GA(
x1,
x2) =
REV1_IN_GA(
x1)
U2_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7,
x8,
x9,
x10,
x11) =
U2_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7,
x8,
x9,
x11)
REV132_IN_GGGA(
x1,
x2,
x3,
x4) =
REV132_IN_GGGA(
x1,
x2,
x3)
U1_GGGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U1_GGGA(
x1,
x2,
x3,
x4,
x6)
We have to consider all (P,R,Pi)-chains
Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES
(4) Obligation:
Pi DP problem:
The TRS P consists of the following rules:
REV1_IN_GA(.(T606, .(T605, .(T604, .(T603, .(T602, .(T601, .(T600, .(T645, T646)))))))), T608) → U2_GA(T606, T605, T604, T603, T602, T601, T600, T645, T646, T608, rev132_in_ggga(T646, T645, .(T600, .(T601, .(T602, .(T603, .(T604, .(T605, .(T606, []))))))), T608))
REV1_IN_GA(.(T606, .(T605, .(T604, .(T603, .(T602, .(T601, .(T600, .(T645, T646)))))))), T608) → REV132_IN_GGGA(T646, T645, .(T600, .(T601, .(T602, .(T603, .(T604, .(T605, .(T606, []))))))), T608)
REV132_IN_GGGA(.(T714, T715), T689, T690, T692) → U1_GGGA(T714, T715, T689, T690, T692, rev132_in_ggga(T715, T714, .(T689, T690), T692))
REV132_IN_GGGA(.(T714, T715), T689, T690, T692) → REV132_IN_GGGA(T715, T714, .(T689, T690), T692)
R is empty.
The argument filtering Pi contains the following mapping:
.(
x1,
x2) =
.(
x1,
x2)
rev132_in_ggga(
x1,
x2,
x3,
x4) =
rev132_in_ggga(
x1,
x2,
x3)
[] =
[]
REV1_IN_GA(
x1,
x2) =
REV1_IN_GA(
x1)
U2_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7,
x8,
x9,
x10,
x11) =
U2_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7,
x8,
x9,
x11)
REV132_IN_GGGA(
x1,
x2,
x3,
x4) =
REV132_IN_GGGA(
x1,
x2,
x3)
U1_GGGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U1_GGGA(
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 3 less nodes.
(6) Obligation:
Pi DP problem:
The TRS P consists of the following rules:
REV132_IN_GGGA(.(T714, T715), T689, T690, T692) → REV132_IN_GGGA(T715, T714, .(T689, T690), T692)
R is empty.
The argument filtering Pi contains the following mapping:
.(
x1,
x2) =
.(
x1,
x2)
REV132_IN_GGGA(
x1,
x2,
x3,
x4) =
REV132_IN_GGGA(
x1,
x2,
x3)
We have to consider all (P,R,Pi)-chains
(7) PiDPToQDPProof (SOUND transformation)
Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.
(8) Obligation:
Q DP problem:
The TRS P consists of the following rules:
REV132_IN_GGGA(.(T714, T715), T689, T690) → REV132_IN_GGGA(T715, T714, .(T689, T690))
R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
(9) 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:
- REV132_IN_GGGA(.(T714, T715), T689, T690) → REV132_IN_GGGA(T715, T714, .(T689, T690))
The graph contains the following edges 1 > 1, 1 > 2
(10) YES