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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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

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


Rules:


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


Strategy:

innermost




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

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

LOG(s(0)) -> LOG(0)
LOG(s(s(x''))) -> LOG(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:

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


Rules:


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

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