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

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(s(s(x))) -> FIB(x)

Furthermore, R contains one SCC. 


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


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))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


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:
FIB(x1) -> FIB(x1)
s(x1) -> s(x1)


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


Dependency Pair:


Rules:


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


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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