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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains two SCCs. 


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


Dependency Pair:

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


Rules:


half(0) -> 0
half(s(s(x))) -> s(half(x))
log(s(0)) -> 0
log(s(s(x))) -> s(log(s(half(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
         ↳AFS


Dependency Pair:


Rules:


half(0) -> 0
half(s(s(x))) -> s(half(x))
log(s(0)) -> 0
log(s(s(x))) -> s(log(s(half(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 Pair:

LOG(s(s(x))) -> LOG(s(half(x)))


Rules:


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


Strategy:

innermost




The following dependency pair can be strictly oriented:

LOG(s(s(x))) -> LOG(s(half(x)))


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

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


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


Dependency Pair:


Rules:


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


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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