Term Rewriting System R:
[X, Y]
f(c(X, s(Y))) -> f(c(s(X), Y))
g(c(s(X), Y)) -> f(c(X, s(Y)))

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

F(c(X, s(Y))) -> F(c(s(X), Y))
G(c(s(X), Y)) -> F(c(X, s(Y)))

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Argument Filtering and Ordering


Dependency Pair:

F(c(X, s(Y))) -> F(c(s(X), Y))


Rules:


f(c(X, s(Y))) -> f(c(s(X), Y))
g(c(s(X), Y)) -> f(c(X, s(Y)))





The following dependency pair can be strictly oriented:

F(c(X, s(Y))) -> F(c(s(X), Y))


There are no usable rules using the Ce-refinement 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:
F(x1) -> F(x1)
c(x1, x2) -> x2
s(x1) -> s(x1)


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


Dependency Pair:


Rules:


f(c(X, s(Y))) -> f(c(s(X), Y))
g(c(s(X), Y)) -> f(c(X, s(Y)))





Using the Dependency Graph resulted in no new DP problems.

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