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

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

SUM(s(x)) -> SQR(s(x))
SUM(s(x)) -> SUM(x)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Forward Instantiation Transformation


Dependency Pair:

SUM(s(x)) -> SUM(x)


Rules:


sum(0) -> 0
sum(s(x)) -> +(sqr(s(x)), sum(x))
sum(s(x)) -> +(*(s(x), s(x)), sum(x))
sqr(x) -> *(x, x)





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

SUM(s(x)) -> SUM(x)
one new Dependency Pair is created:

SUM(s(s(x''))) -> SUM(s(x''))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 2
             ↳Forward Instantiation Transformation


Dependency Pair:

SUM(s(s(x''))) -> SUM(s(x''))


Rules:


sum(0) -> 0
sum(s(x)) -> +(sqr(s(x)), sum(x))
sum(s(x)) -> +(*(s(x), s(x)), sum(x))
sqr(x) -> *(x, x)





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

SUM(s(s(x''))) -> SUM(s(x''))
one new Dependency Pair is created:

SUM(s(s(s(x'''')))) -> SUM(s(s(x'''')))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 2
             ↳FwdInst
             ...
               →DP Problem 3
                 ↳Polynomial Ordering


Dependency Pair:

SUM(s(s(s(x'''')))) -> SUM(s(s(x'''')))


Rules:


sum(0) -> 0
sum(s(x)) -> +(sqr(s(x)), sum(x))
sum(s(x)) -> +(*(s(x), s(x)), sum(x))
sqr(x) -> *(x, x)





The following dependency pair can be strictly oriented:

SUM(s(s(s(x'''')))) -> SUM(s(s(x'''')))


There are no usable rules w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(SUM(x1))=  1 + x1  
  POL(s(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 2
             ↳FwdInst
             ...
               →DP Problem 4
                 ↳Dependency Graph


Dependency Pair:


Rules:


sum(0) -> 0
sum(s(x)) -> +(sqr(s(x)), sum(x))
sum(s(x)) -> +(*(s(x), s(x)), sum(x))
sqr(x) -> *(x, x)





Using the Dependency Graph resulted in no new DP problems.

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