Certification Problem
Input (TPDB SRS_Standard/Zantema_06/03)
The rewrite relation of the following TRS is considered.
|
a(a(b(b(x1)))) |
→ |
b(b(b(a(a(a(x1)))))) |
(1) |
|
a(c(x1)) |
→ |
c(a(x1)) |
(2) |
|
c(b(x1)) |
→ |
b(c(x1)) |
(3) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by matchbox @ termCOMP 2023)
1 String Reversal
Since only unary symbols occur, one can reverse all terms and obtains the TRS
|
b(b(a(a(x1)))) |
→ |
a(a(a(b(b(b(x1)))))) |
(4) |
|
c(a(x1)) |
→ |
a(c(x1)) |
(5) |
|
b(c(x1)) |
→ |
c(b(x1)) |
(6) |
1.1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
c#(a(x1)) |
→ |
c#(x1) |
(7) |
|
b#(c(x1)) |
→ |
c#(b(x1)) |
(8) |
|
b#(c(x1)) |
→ |
b#(x1) |
(9) |
|
b#(b(a(a(x1)))) |
→ |
b#(x1) |
(10) |
|
b#(b(a(a(x1)))) |
→ |
b#(b(x1)) |
(11) |
|
b#(b(a(a(x1)))) |
→ |
b#(b(b(x1))) |
(12) |
1.1.1 Monotonic Reduction Pair Processor with Usable Rules
Using the matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1
| [c(x1)] |
= |
x1 +
|
| [b(x1)] |
= |
x1 +
|
| [a(x1)] |
= |
x1 +
|
| [c#(x1)] |
= |
x1 +
|
| [b#(x1)] |
= |
x1 +
|
together with the usable
rules
|
b(b(a(a(x1)))) |
→ |
a(a(a(b(b(b(x1)))))) |
(4) |
|
c(a(x1)) |
→ |
a(c(x1)) |
(5) |
|
b(c(x1)) |
→ |
c(b(x1)) |
(6) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
|
b#(c(x1)) |
→ |
c#(b(x1)) |
(8) |
|
b#(c(x1)) |
→ |
b#(x1) |
(9) |
and
no rules
could be deleted.
1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 2
components.