Term Rewriting System R:
[x, y]
rev(a) -> a
rev(b) -> b
rev(++(x, y)) -> ++(rev(y), rev(x))
rev(++(x, x)) -> rev(x)

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

REV(++(x, y)) -> REV(y)
REV(++(x, y)) -> REV(x)
REV(++(x, x)) -> REV(x)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Argument Filtering and Ordering


Dependency Pairs:

REV(++(x, x)) -> REV(x)
REV(++(x, y)) -> REV(x)
REV(++(x, y)) -> REV(y)


Rules:


rev(a) -> a
rev(b) -> b
rev(++(x, y)) -> ++(rev(y), rev(x))
rev(++(x, x)) -> rev(x)


Strategy:

innermost




The following dependency pairs can be strictly oriented:

REV(++(x, x)) -> REV(x)
REV(++(x, y)) -> REV(x)
REV(++(x, y)) -> REV(y)


There are no usable rules for innermost that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
REV(x1) -> REV(x1)
++(x1, x2) -> ++(x1, x2)


   R
DPs
       →DP Problem 1
AFS
           →DP Problem 2
Dependency Graph


Dependency Pair:


Rules:


rev(a) -> a
rev(b) -> b
rev(++(x, y)) -> ++(rev(y), rev(x))
rev(++(x, x)) -> rev(x)


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

Innermost Termination of R successfully shown.
Duration:
0:00 minutes