Termination Proof

by AProVE (version ba869e7b28377cd372aedcb96abeb62c4ad6aaa5 rene 20130719 unpublished dirty )

Input

The rewrite relation of the following TRS is considered.

Proof

1 Rule Removal

1.1 Dependency Pair Transformation

1.1.1 Dependency Graph Processor

The dependency pairs are split into 2 components.

• The 1^st component contains the pairs

  Tllet#(SRcp(x))	→	Tllet#(x)
  Tllet#(SRlbeta(x))	→	Tllet#(x)
  Tllet#(SRlll(x))	→	Tllet#(x)

  1.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.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.1 Size-Change Termination

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

  • Tllet^#(SRcp(x)) → Tllet^#(x):

    1>1

  • Tllet^#(SRlbeta(x)) → Tllet^#(x):

    1>1

  • Tllet^#(SRlll(x)) → Tllet^#(x):

    1>1

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

• The 2^nd component contains the pairs

  Tlapp#(SRcp(x))	→	Tlapp#(x)
  Tlapp#(SRlbeta(x))	→	Tlapp#(x)
  Tlapp#(SRlll(x))	→	Tlapp#(x)

  1.1.1.2 Usable Rules Processor

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

  There are no rules.

  1.1.1.2.1 Innermost Lhss Removal Processor

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

  There are no lhss.

  1.1.1.2.1.1 Size-Change Termination

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

  • Tlapp^#(SRcp(x)) → Tlapp^#(x):

    1>1

  • Tlapp^#(SRlbeta(x)) → Tlapp^#(x):

    1>1

  • Tlapp^#(SRlll(x)) → Tlapp^#(x):

    1>1

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