Term Rewriting System R:
[X, Y, L]
eq(0, 0) -> true
eq(s(X), s(Y)) -> eq(X, Y)
eq(X, Y) -> false
inf(X) -> cons(X, inf(s(X)))
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
length(nil) -> 0
length(cons(X, L)) -> s(length(L))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

EQ(s(X), s(Y)) -> EQ(X, Y)
INF(X) -> INF(s(X))
TAKE(s(X), cons(Y, L)) -> TAKE(X, L)
LENGTH(cons(X, L)) -> LENGTH(L)

Furthermore, R contains four SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Forward Instantiation Transformation
       →DP Problem 2
         ↳Inst
       →DP Problem 3
         ↳Remaining
       →DP Problem 4
         ↳Remaining


Dependency Pair:

EQ(s(X), s(Y)) -> EQ(X, Y)


Rules:


eq(0, 0) -> true
eq(s(X), s(Y)) -> eq(X, Y)
eq(X, Y) -> false
inf(X) -> cons(X, inf(s(X)))
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
length(nil) -> 0
length(cons(X, L)) -> s(length(L))


Strategy:

innermost




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

EQ(s(X), s(Y)) -> EQ(X, Y)
one new Dependency Pair is created:

EQ(s(s(X'')), s(s(Y''))) -> EQ(s(X''), s(Y''))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 5
             ↳Forward Instantiation Transformation
       →DP Problem 2
         ↳Inst
       →DP Problem 3
         ↳Remaining
       →DP Problem 4
         ↳Remaining


Dependency Pair:

EQ(s(s(X'')), s(s(Y''))) -> EQ(s(X''), s(Y''))


Rules:


eq(0, 0) -> true
eq(s(X), s(Y)) -> eq(X, Y)
eq(X, Y) -> false
inf(X) -> cons(X, inf(s(X)))
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
length(nil) -> 0
length(cons(X, L)) -> s(length(L))


Strategy:

innermost




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

EQ(s(s(X'')), s(s(Y''))) -> EQ(s(X''), s(Y''))
one new Dependency Pair is created:

EQ(s(s(s(X''''))), s(s(s(Y'''')))) -> EQ(s(s(X'''')), s(s(Y'''')))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 5
             ↳FwdInst
             ...
               →DP Problem 6
                 ↳Argument Filtering and Ordering
       →DP Problem 2
         ↳Inst
       →DP Problem 3
         ↳Remaining
       →DP Problem 4
         ↳Remaining


Dependency Pair:

EQ(s(s(s(X''''))), s(s(s(Y'''')))) -> EQ(s(s(X'''')), s(s(Y'''')))


Rules:


eq(0, 0) -> true
eq(s(X), s(Y)) -> eq(X, Y)
eq(X, Y) -> false
inf(X) -> cons(X, inf(s(X)))
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
length(nil) -> 0
length(cons(X, L)) -> s(length(L))


Strategy:

innermost




The following dependency pair can be strictly oriented:

EQ(s(s(s(X''''))), s(s(s(Y'''')))) -> EQ(s(s(X'''')), s(s(Y'''')))


There are no usable rules for innermost that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
EQ(x1, x2) -> EQ(x1, x2)
s(x1) -> s(x1)


   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 5
             ↳FwdInst
             ...
               →DP Problem 7
                 ↳Dependency Graph
       →DP Problem 2
         ↳Inst
       →DP Problem 3
         ↳Remaining
       →DP Problem 4
         ↳Remaining


Dependency Pair:


Rules:


eq(0, 0) -> true
eq(s(X), s(Y)) -> eq(X, Y)
eq(X, Y) -> false
inf(X) -> cons(X, inf(s(X)))
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
length(nil) -> 0
length(cons(X, L)) -> s(length(L))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳Instantiation Transformation
       →DP Problem 3
         ↳Remaining
       →DP Problem 4
         ↳Remaining


Dependency Pair:

INF(X) -> INF(s(X))


Rules:


eq(0, 0) -> true
eq(s(X), s(Y)) -> eq(X, Y)
eq(X, Y) -> false
inf(X) -> cons(X, inf(s(X)))
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
length(nil) -> 0
length(cons(X, L)) -> s(length(L))


Strategy:

innermost




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

INF(X) -> INF(s(X))
one new Dependency Pair is created:

INF(s(X'')) -> INF(s(s(X'')))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳Inst
           →DP Problem 8
             ↳Instantiation Transformation
       →DP Problem 3
         ↳Remaining
       →DP Problem 4
         ↳Remaining


Dependency Pair:

INF(s(X'')) -> INF(s(s(X'')))


Rules:


eq(0, 0) -> true
eq(s(X), s(Y)) -> eq(X, Y)
eq(X, Y) -> false
inf(X) -> cons(X, inf(s(X)))
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
length(nil) -> 0
length(cons(X, L)) -> s(length(L))


Strategy:

innermost




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

INF(s(X'')) -> INF(s(s(X'')))
one new Dependency Pair is created:

INF(s(s(X''''))) -> INF(s(s(s(X''''))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳Inst
           →DP Problem 8
             ↳Inst
             ...
               →DP Problem 9
                 ↳Instantiation Transformation
       →DP Problem 3
         ↳Remaining
       →DP Problem 4
         ↳Remaining


Dependency Pair:

INF(s(s(X''''))) -> INF(s(s(s(X''''))))


Rules:


eq(0, 0) -> true
eq(s(X), s(Y)) -> eq(X, Y)
eq(X, Y) -> false
inf(X) -> cons(X, inf(s(X)))
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
length(nil) -> 0
length(cons(X, L)) -> s(length(L))


Strategy:

innermost




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

INF(s(s(X''''))) -> INF(s(s(s(X''''))))
one new Dependency Pair is created:

INF(s(s(s(X'''''')))) -> INF(s(s(s(s(X'''''')))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳Inst
           →DP Problem 8
             ↳Inst
             ...
               →DP Problem 10
                 ↳Instantiation Transformation
       →DP Problem 3
         ↳Remaining
       →DP Problem 4
         ↳Remaining


Dependency Pair:

INF(s(s(s(X'''''')))) -> INF(s(s(s(s(X'''''')))))


Rules:


eq(0, 0) -> true
eq(s(X), s(Y)) -> eq(X, Y)
eq(X, Y) -> false
inf(X) -> cons(X, inf(s(X)))
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
length(nil) -> 0
length(cons(X, L)) -> s(length(L))


Strategy:

innermost




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

INF(s(s(s(X'''''')))) -> INF(s(s(s(s(X'''''')))))
one new Dependency Pair is created:

INF(s(s(s(s(X''''''''))))) -> INF(s(s(s(s(s(X''''''''))))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳Inst
           →DP Problem 8
             ↳Inst
             ...
               →DP Problem 11
                 ↳Instantiation Transformation
       →DP Problem 3
         ↳Remaining
       →DP Problem 4
         ↳Remaining


Dependency Pair:

INF(s(s(s(s(X''''''''))))) -> INF(s(s(s(s(s(X''''''''))))))


Rules:


eq(0, 0) -> true
eq(s(X), s(Y)) -> eq(X, Y)
eq(X, Y) -> false
inf(X) -> cons(X, inf(s(X)))
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
length(nil) -> 0
length(cons(X, L)) -> s(length(L))


Strategy:

innermost




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

INF(s(s(s(s(X''''''''))))) -> INF(s(s(s(s(s(X''''''''))))))
one new Dependency Pair is created:

INF(s(s(s(s(s(X'''''''''')))))) -> INF(s(s(s(s(s(s(X'''''''''')))))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳Inst
       →DP Problem 3
         ↳Remaining Obligation(s)
       →DP Problem 4
         ↳Remaining Obligation(s)




The following remains to be proven:


   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳Inst
       →DP Problem 3
         ↳Remaining Obligation(s)
       →DP Problem 4
         ↳Remaining Obligation(s)




The following remains to be proven:


   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳Inst
       →DP Problem 3
         ↳Remaining Obligation(s)
       →DP Problem 4
         ↳Remaining Obligation(s)




The following remains to be proven:

Innermost Termination of R could not be shown.
Duration:
0:00 minutes