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

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

FIB(s(s(x))) -> +'(fib(s(x)), fib(x))
FIB(s(s(x))) -> FIB(s(x))
FIB(s(s(x))) -> FIB(x)
+'(x, s(y)) -> +'(x, y)

Furthermore, R contains two SCCs.


   R
DPs
       →DP Problem 1
Usable Rules (Innermost)
       →DP Problem 2
UsableRules


Dependency Pair:

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


Rules:


fib(0) -> 0
fib(s(0)) -> s(0)
fib(s(s(x))) -> +(fib(s(x)), fib(x))
+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))


Strategy:

innermost




As we are in the innermost case, we can delete all 5 non-usable-rules.


   R
DPs
       →DP Problem 1
UsableRules
           →DP Problem 3
Size-Change Principle
       →DP Problem 2
UsableRules


Dependency Pair:

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


Rule:

none


Strategy:

innermost




We number the DPs as follows:
  1. +'(x, s(y)) -> +'(x, y)
and get the following Size-Change Graph(s):
{1} , {1}
1=1
2>2

which lead(s) to this/these maximal multigraph(s):
{1} , {1}
1=1
2>2

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
s(x1) -> s(x1)

We obtain no new DP problems.


   R
DPs
       →DP Problem 1
UsableRules
       →DP Problem 2
Usable Rules (Innermost)


Dependency Pairs:

FIB(s(s(x))) -> FIB(x)
FIB(s(s(x))) -> FIB(s(x))


Rules:


fib(0) -> 0
fib(s(0)) -> s(0)
fib(s(s(x))) -> +(fib(s(x)), fib(x))
+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))


Strategy:

innermost




As we are in the innermost case, we can delete all 5 non-usable-rules.


   R
DPs
       →DP Problem 1
UsableRules
       →DP Problem 2
UsableRules
           →DP Problem 4
Size-Change Principle


Dependency Pairs:

FIB(s(s(x))) -> FIB(x)
FIB(s(s(x))) -> FIB(s(x))


Rule:

none


Strategy:

innermost




We number the DPs as follows:
  1. FIB(s(s(x))) -> FIB(x)
  2. FIB(s(s(x))) -> FIB(s(x))
and get the following Size-Change Graph(s):
{1, 2} , {1, 2}
1>1

which lead(s) to this/these maximal multigraph(s):
{1, 2} , {1, 2}
1>1

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
s(x1) -> s(x1)

We obtain no new DP problems.

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