Term Rewriting System R:
[x]
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
bits(0) -> 0
bits(s(x)) -> s(bits(half(s(x))))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

HALF(s(s(x))) -> HALF(x)
BITS(s(x)) -> BITS(half(s(x)))
BITS(s(x)) -> HALF(s(x))

Furthermore, R contains two SCCs. 


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


Dependency Pair:

HALF(s(s(x))) -> HALF(x)


Rules:


half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
bits(0) -> 0
bits(s(x)) -> s(bits(half(s(x))))


Strategy:

innermost




The following dependency pair can be strictly oriented:

HALF(s(s(x))) -> HALF(x)


There are no usable rules for innermost w.r.t. to the AFS 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:
HALF(x1) -> HALF(x1)
s(x1) -> s(x1)


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


Dependency Pair:


Rules:


half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
bits(0) -> 0
bits(s(x)) -> s(bits(half(s(x))))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
       →DP Problem 2
         ↳Narrowing Transformation


Dependency Pair:

BITS(s(x)) -> BITS(half(s(x)))


Rules:


half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
bits(0) -> 0
bits(s(x)) -> s(bits(half(s(x))))


Strategy:

innermost




On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

BITS(s(x)) -> BITS(half(s(x)))
two new Dependency Pairs are created:

BITS(s(0)) -> BITS(0)
BITS(s(s(x''))) -> BITS(s(half(x'')))

The transformation is resulting in one new DP problem: 



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


Dependency Pair:

BITS(s(s(x''))) -> BITS(s(half(x'')))


Rules:


half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
bits(0) -> 0
bits(s(x)) -> s(bits(half(s(x))))


Strategy:

innermost




The following dependency pair can be strictly oriented:

BITS(s(s(x''))) -> BITS(s(half(x'')))


The following usable rules for innermost w.r.t. to the AFS can be oriented:

half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))


Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
s > half

resulting in one new DP problem.
Used Argument Filtering System:
BITS(x1) -> BITS(x1)
s(x1) -> s(x1)
half(x1) -> half(x1)


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


Dependency Pair:


Rules:


half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
bits(0) -> 0
bits(s(x)) -> s(bits(half(s(x))))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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