Certification Problem
Input (TPDB SRS_Standard/Zantema_04/z014)
The rewrite relation of the following TRS is considered.
|
a(b(x1)) |
→ |
b(a(a(x1))) |
(1) |
|
b(x1) |
→ |
c(a(c(x1))) |
(2) |
|
a(a(x1)) |
→ |
a(c(a(x1))) |
(3) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 String Reversal
Since only unary symbols occur, one can reverse all terms and obtains the TRS
|
b(a(x1)) |
→ |
a(a(b(x1))) |
(4) |
|
b(x1) |
→ |
c(a(c(x1))) |
(2) |
|
a(a(x1)) |
→ |
a(c(a(x1))) |
(3) |
1.1 Rule Removal
Using the
linear polynomial interpretation over the naturals
| [b(x1)] |
= |
1 · x1 + 1 |
| [a(x1)] |
= |
1 · x1
|
| [c(x1)] |
= |
1 · x1
|
all of the following rules can be deleted.
1.1.1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
b#(a(x1)) |
→ |
a#(a(b(x1))) |
(5) |
|
b#(a(x1)) |
→ |
a#(b(x1)) |
(6) |
|
b#(a(x1)) |
→ |
b#(x1) |
(7) |
|
a#(a(x1)) |
→ |
a#(c(a(x1))) |
(8) |
1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.
-
The
1st
component contains the
pair
1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
| [a(x1)] |
= |
1 · x1
|
| [b#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
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.
|
b#(a(x1)) |
→ |
b#(x1) |
(7) |
|
| 1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.