Certification Problem
Input (TPDB SRS_Standard/Zantema_06/09)
The rewrite relation of the following TRS is considered.
|
a(s(x1)) |
→ |
s(a(x1)) |
(1) |
|
b(a(b(s(x1)))) |
→ |
a(b(s(a(x1)))) |
(2) |
|
b(a(b(b(x1)))) |
→ |
c(s(x1)) |
(3) |
|
c(s(x1)) |
→ |
a(b(a(b(x1)))) |
(4) |
|
a(b(a(a(x1)))) |
→ |
b(a(b(a(x1)))) |
(5) |
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
|
s(a(x1)) |
→ |
a(s(x1)) |
(6) |
|
s(b(a(b(x1)))) |
→ |
a(s(b(a(x1)))) |
(7) |
|
b(b(a(b(x1)))) |
→ |
s(c(x1)) |
(8) |
|
s(c(x1)) |
→ |
b(a(b(a(x1)))) |
(9) |
|
a(a(b(a(x1)))) |
→ |
a(b(a(b(x1)))) |
(10) |
1.1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
b#(b(a(b(x1)))) |
→ |
s#(c(x1)) |
(11) |
|
a#(a(b(a(x1)))) |
→ |
b#(x1) |
(12) |
|
a#(a(b(a(x1)))) |
→ |
b#(a(b(x1))) |
(13) |
|
a#(a(b(a(x1)))) |
→ |
a#(b(x1)) |
(14) |
|
a#(a(b(a(x1)))) |
→ |
a#(b(a(b(x1)))) |
(15) |
|
s#(c(x1)) |
→ |
b#(a(x1)) |
(16) |
|
s#(c(x1)) |
→ |
b#(a(b(a(x1)))) |
(17) |
|
s#(c(x1)) |
→ |
a#(x1) |
(18) |
|
s#(c(x1)) |
→ |
a#(b(a(x1))) |
(19) |
|
s#(b(a(b(x1)))) |
→ |
b#(a(x1)) |
(20) |
|
s#(b(a(b(x1)))) |
→ |
a#(x1) |
(21) |
|
s#(b(a(b(x1)))) |
→ |
a#(s(b(a(x1)))) |
(22) |
|
s#(b(a(b(x1)))) |
→ |
s#(b(a(x1))) |
(23) |
|
s#(a(x1)) |
→ |
a#(s(x1)) |
(24) |
|
s#(a(x1)) |
→ |
s#(x1) |
(25) |
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 +
|
| [s(x1)] |
= |
x1 +
|
| [b#(x1)] |
= |
x1 +
|
| [a#(x1)] |
= |
x1 +
|
| [s#(x1)] |
= |
x1 +
|
together with the usable
rules
|
s(a(x1)) |
→ |
a(s(x1)) |
(6) |
|
s(b(a(b(x1)))) |
→ |
a(s(b(a(x1)))) |
(7) |
|
b(b(a(b(x1)))) |
→ |
s(c(x1)) |
(8) |
|
s(c(x1)) |
→ |
b(a(b(a(x1)))) |
(9) |
|
a(a(b(a(x1)))) |
→ |
a(b(a(b(x1)))) |
(10) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
|
a#(a(b(a(x1)))) |
→ |
b#(x1) |
(12) |
|
a#(a(b(a(x1)))) |
→ |
b#(a(b(x1))) |
(13) |
|
a#(a(b(a(x1)))) |
→ |
a#(b(x1)) |
(14) |
|
s#(c(x1)) |
→ |
b#(a(x1)) |
(16) |
|
s#(c(x1)) |
→ |
a#(x1) |
(18) |
|
s#(c(x1)) |
→ |
a#(b(a(x1))) |
(19) |
|
s#(b(a(b(x1)))) |
→ |
b#(a(x1)) |
(20) |
|
s#(b(a(b(x1)))) |
→ |
a#(x1) |
(21) |
|
s#(b(a(b(x1)))) |
→ |
a#(s(b(a(x1)))) |
(22) |
|
s#(b(a(b(x1)))) |
→ |
s#(b(a(x1))) |
(23) |
|
s#(a(x1)) |
→ |
a#(s(x1)) |
(24) |
|
s#(a(x1)) |
→ |
s#(x1) |
(25) |
and
no rules
could be deleted.
1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 2
components.