Termination Proof

by AProVE (version ba869e7b28377cd372aedcb96abeb62c4ad6aaa5 rene 20130719 unpublished dirty )

Input

The rewrite relation of the following TRS is considered.

Tseq(SRlbeta(x))	→	SRlbeta(Tseq(x))
Tseq(SRseq(x))	→	SRseq(Tseq(x))
Tseq(SRseq(x))	→	x
Tseq(SRcp(x))	→	SRcp(Tseq(x))
Tseq(SRllet(x))	→	SRllet(Tseq(x))
Tseq(SRlapp(x))	→	SRlapp(Tseq(x))
Tseq(SRlseq(x))	→	SRlseq(Tseq(x))
Tseq(Answer)	→	Answer
SRlll(x)	→	SRlapp(x)
SRlll(x)	→	SRllet(x)

The evaluation strategy is innermost.

Proof

1 Rule Removal

Using the linear polynomial interpretation over the naturals

[Tseq(x₁)]	=	1 · x₁ + 1
[SRlbeta(x₁)]	=	1 · x₁
[SRseq(x₁)]	=	1 · x₁
[SRcp(x₁)]	=	1 · x₁
[SRllet(x₁)]	=	1 · x₁
[SRlapp(x₁)]	=	1 · x₁
[SRlseq(x₁)]	=	1 · x₁
[Answer]	=	0
[SRlll(x₁)]	=	1 · x₁ + 1

the rules

Tseq(SRlbeta(x))	→	SRlbeta(Tseq(x))
Tseq(SRseq(x))	→	SRseq(Tseq(x))
Tseq(SRcp(x))	→	SRcp(Tseq(x))
Tseq(SRllet(x))	→	SRllet(Tseq(x))
Tseq(SRlapp(x))	→	SRlapp(Tseq(x))
Tseq(SRlseq(x))	→	SRlseq(Tseq(x))

remain.

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.

Tseq^#(SRlbeta(x))	→	Tseq^#(x)
Tseq^#(SRseq(x))	→	Tseq^#(x)
Tseq^#(SRcp(x))	→	Tseq^#(x)
Tseq^#(SRllet(x))	→	Tseq^#(x)
Tseq^#(SRlapp(x))	→	Tseq^#(x)
Tseq^#(SRlseq(x))	→	Tseq^#(x)

1.1.1 Usable Rules Processor

We restrict the rewrite rules to the following usable rules of the DP problem.

There are no rules.

1.1.1.1 Innermost Lhss Removal Processor

We restrict the innermost strategy to the following left hand sides.

There are no lhss.

1.1.1.1.1 Size-Change Termination

Using size-change termination in combination with the subterm criterion one obtains the following initial size-change graphs.

Tseq^#(SRlbeta(x)) → Tseq^#(x):
1>1
Tseq^#(SRseq(x)) → Tseq^#(x):
1>1
Tseq^#(SRcp(x)) → Tseq^#(x):
1>1
Tseq^#(SRllet(x)) → Tseq^#(x):
1>1
Tseq^#(SRlapp(x)) → Tseq^#(x):
1>1
Tseq^#(SRlseq(x)) → Tseq^#(x):
1>1

As there is no critical graph in the transitive closure, there are no infinite chains.