Term Rewriting System R:
[X]
f(0) -> cons(0, nf(ns(n0)))
f(s(0)) -> f(p(s(0)))
f(X) -> nf(X)
p(s(0)) -> 0
s(X) -> ns(X)
0 -> n0
activate(nf(X)) -> f(activate(X))
activate(ns(X)) -> s(activate(X))
activate(n0) -> 0
activate(X) -> X
Innermost Termination of R to be shown.
R
↳Removing Redundant Rules for Innermost Termination
Removing the following rules from R which left hand sides contain non normal subterms
f(0) -> cons(0, nf(ns(n0)))
f(s(0)) -> f(p(s(0)))
p(s(0)) -> 0
R
↳RRRI
→TRS2
↳Removing Redundant Rules
Removing the following rules from R which fullfill a polynomial ordering:
f(X) -> nf(X)
where the Polynomial interpretation:
| POL(activate(x1)) | = 2·x1 |
| POL(n__f(x1)) | = 1 + x1 |
| POL(0) | = 0 |
| POL(n__s(x1)) | = x1 |
| POL(s(x1)) | = x1 |
| POL(n__0) | = 0 |
| POL(f(x1)) | = 2 + x1 |
was used.
Not all Rules of R can be deleted, so we still have to regard a part of R.
R
↳RRRI
→TRS2
↳RRRPolo
→TRS3
↳Removing Redundant Rules
Removing the following rules from R which fullfill a polynomial ordering:
0 -> n0
where the Polynomial interpretation:
| POL(activate(x1)) | = 2·x1 |
| POL(n__f(x1)) | = x1 |
| POL(0) | = 2 |
| POL(n__s(x1)) | = x1 |
| POL(s(x1)) | = x1 |
| POL(n__0) | = 1 |
| POL(f(x1)) | = x1 |
was used.
Not all Rules of R can be deleted, so we still have to regard a part of R.
R
↳RRRI
→TRS2
↳RRRPolo
→TRS3
↳RRRPolo
...
→TRS4
↳Removing Redundant Rules
Removing the following rules from R which fullfill a polynomial ordering:
activate(ns(X)) -> s(activate(X))
where the Polynomial interpretation:
| POL(activate(x1)) | = 2·x1 |
| POL(n__f(x1)) | = x1 |
| POL(0) | = 0 |
| POL(n__s(x1)) | = 1 + x1 |
| POL(n__0) | = 0 |
| POL(s(x1)) | = 1 + x1 |
| POL(f(x1)) | = x1 |
was used.
Not all Rules of R can be deleted, so we still have to regard a part of R.
R
↳RRRI
→TRS2
↳RRRPolo
→TRS3
↳RRRPolo
...
→TRS5
↳Removing Redundant Rules
Removing the following rules from R which fullfill a polynomial ordering:
activate(n0) -> 0
where the Polynomial interpretation:
| POL(activate(x1)) | = x1 |
| POL(n__f(x1)) | = x1 |
| POL(0) | = 0 |
| POL(n__s(x1)) | = x1 |
| POL(s(x1)) | = x1 |
| POL(n__0) | = 1 |
| POL(f(x1)) | = x1 |
was used.
Not all Rules of R can be deleted, so we still have to regard a part of R.
R
↳RRRI
→TRS2
↳RRRPolo
→TRS3
↳RRRPolo
...
→TRS6
↳Removing Redundant Rules
Removing the following rules from R which fullfill a polynomial ordering:
activate(nf(X)) -> f(activate(X))
where the Polynomial interpretation:
| POL(activate(x1)) | = x1 |
| POL(n__f(x1)) | = 1 + x1 |
| POL(n__s(x1)) | = x1 |
| POL(s(x1)) | = x1 |
| POL(f(x1)) | = x1 |
was used.
Not all Rules of R can be deleted, so we still have to regard a part of R.
R
↳RRRI
→TRS2
↳RRRPolo
→TRS3
↳RRRPolo
...
→TRS7
↳Removing Redundant Rules
Removing the following rules from R which fullfill a polynomial ordering:
s(X) -> ns(X)
where the Polynomial interpretation:
| POL(activate(x1)) | = x1 |
| POL(n__s(x1)) | = x1 |
| POL(s(x1)) | = 1 + x1 |
was used.
Not all Rules of R can be deleted, so we still have to regard a part of R.
R
↳RRRI
→TRS2
↳RRRPolo
→TRS3
↳RRRPolo
...
→TRS8
↳Removing Redundant Rules
Removing the following rules from R which fullfill a polynomial ordering:
activate(X) -> X
where the Polynomial interpretation:
| POL(activate(x1)) | = 1 + x1 |
was used.
All Rules of R can be deleted.
R
↳RRRI
→TRS2
↳RRRPolo
→TRS3
↳RRRPolo
...
→TRS9
↳Dependency Pair Analysis
R contains no Dependency Pairs and therefore no SCCs.
Innermost Termination of R successfully shown.
Duration:
0:00 minutes