Term Rewriting System R:
[x, y]
-(x, 0) -> x
-(0, s(y)) -> 0
-(s(x), s(y)) -> -(x, y)
f(0) -> 0
f(s(x)) -> -(s(x), g(f(x)))
g(0) -> s(0)
g(s(x)) -> -(s(x), f(g(x)))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

-'(s(x), s(y)) -> -'(x, y)
F(s(x)) -> -'(s(x), g(f(x)))
F(s(x)) -> G(f(x))
F(s(x)) -> F(x)
G(s(x)) -> -'(s(x), f(g(x)))
G(s(x)) -> F(g(x))
G(s(x)) -> G(x)

Furthermore, R contains two SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Argument Filtering and Ordering
       →DP Problem 2
         ↳AFS


Dependency Pair:

-'(s(x), s(y)) -> -'(x, y)


Rules:


-(x, 0) -> x
-(0, s(y)) -> 0
-(s(x), s(y)) -> -(x, y)
f(0) -> 0
f(s(x)) -> -(s(x), g(f(x)))
g(0) -> s(0)
g(s(x)) -> -(s(x), f(g(x)))


Strategy:

innermost




The following dependency pair can be strictly oriented:

-'(s(x), s(y)) -> -'(x, 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:
-'(x1, x2) -> -'(x1, x2)
s(x1) -> s(x1)


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


Dependency Pair:


Rules:


-(x, 0) -> x
-(0, s(y)) -> 0
-(s(x), s(y)) -> -(x, y)
f(0) -> 0
f(s(x)) -> -(s(x), g(f(x)))
g(0) -> s(0)
g(s(x)) -> -(s(x), f(g(x)))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
       →DP Problem 2
         ↳Argument Filtering and Ordering


Dependency Pairs:

G(s(x)) -> G(x)
F(s(x)) -> F(x)
G(s(x)) -> F(g(x))
F(s(x)) -> G(f(x))


Rules:


-(x, 0) -> x
-(0, s(y)) -> 0
-(s(x), s(y)) -> -(x, y)
f(0) -> 0
f(s(x)) -> -(s(x), g(f(x)))
g(0) -> s(0)
g(s(x)) -> -(s(x), f(g(x)))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

G(s(x)) -> G(x)
F(s(x)) -> F(x)
F(s(x)) -> G(f(x))


The following usable rules for innermost can be oriented:

f(0) -> 0
f(s(x)) -> -(s(x), g(f(x)))
g(0) -> s(0)
g(s(x)) -> -(s(x), f(g(x)))
-(x, 0) -> x
-(0, s(y)) -> 0
-(s(x), s(y)) -> -(x, y)


Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
{F, G}
{g, s} > f

resulting in one new DP problem.
Used Argument Filtering System:
F(x1) -> F(x1)
G(x1) -> G(x1)
s(x1) -> s(x1)
f(x1) -> f(x1)
g(x1) -> g(x1)
-(x1, x2) -> x1


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


Dependency Pair:

G(s(x)) -> F(g(x))


Rules:


-(x, 0) -> x
-(0, s(y)) -> 0
-(s(x), s(y)) -> -(x, y)
f(0) -> 0
f(s(x)) -> -(s(x), g(f(x)))
g(0) -> s(0)
g(s(x)) -> -(s(x), f(g(x)))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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