Certification Problem
Input (TPDB SRS_Standard/Zantema_04/z001)
The rewrite relation of the following TRS is considered.
|
a(a(b(b(x1)))) |
→ |
b(b(b(a(a(a(x1)))))) |
(1) |
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(b(a(a(x1)))) |
→ |
a(a(a(b(b(b(x1)))))) |
(2) |
1.1 Closure Under Flat Contexts
Using the flat contexts
{b(☐), a(☐)}
We obtain the transformed TRS
|
b(b(b(a(a(x1))))) |
→ |
b(a(a(a(b(b(b(x1))))))) |
(3) |
|
a(b(b(a(a(x1))))) |
→ |
a(a(a(a(b(b(b(x1))))))) |
(4) |
1.1.1 Semantic Labeling
Root-labeling is applied.
We obtain the labeled TRS
|
bb(bb(ba(aa(ab(x1))))) |
→ |
ba(aa(aa(ab(bb(bb(bb(x1))))))) |
(5) |
|
bb(bb(ba(aa(aa(x1))))) |
→ |
ba(aa(aa(ab(bb(bb(ba(x1))))))) |
(6) |
|
ab(bb(ba(aa(ab(x1))))) |
→ |
aa(aa(aa(ab(bb(bb(bb(x1))))))) |
(7) |
|
ab(bb(ba(aa(aa(x1))))) |
→ |
aa(aa(aa(ab(bb(bb(ba(x1))))))) |
(8) |
1.1.1.1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
bb#(bb(ba(aa(ab(x1))))) |
→ |
ab#(bb(bb(bb(x1)))) |
(9) |
|
bb#(bb(ba(aa(ab(x1))))) |
→ |
bb#(bb(bb(x1))) |
(10) |
|
bb#(bb(ba(aa(ab(x1))))) |
→ |
bb#(bb(x1)) |
(11) |
|
bb#(bb(ba(aa(ab(x1))))) |
→ |
bb#(x1) |
(12) |
|
bb#(bb(ba(aa(aa(x1))))) |
→ |
ab#(bb(bb(ba(x1)))) |
(13) |
|
bb#(bb(ba(aa(aa(x1))))) |
→ |
bb#(bb(ba(x1))) |
(14) |
|
bb#(bb(ba(aa(aa(x1))))) |
→ |
bb#(ba(x1)) |
(15) |
|
ab#(bb(ba(aa(ab(x1))))) |
→ |
ab#(bb(bb(bb(x1)))) |
(16) |
|
ab#(bb(ba(aa(ab(x1))))) |
→ |
bb#(bb(bb(x1))) |
(17) |
|
ab#(bb(ba(aa(ab(x1))))) |
→ |
bb#(bb(x1)) |
(18) |
|
ab#(bb(ba(aa(ab(x1))))) |
→ |
bb#(x1) |
(19) |
|
ab#(bb(ba(aa(aa(x1))))) |
→ |
ab#(bb(bb(ba(x1)))) |
(20) |
|
ab#(bb(ba(aa(aa(x1))))) |
→ |
bb#(bb(ba(x1))) |
(21) |
|
ab#(bb(ba(aa(aa(x1))))) |
→ |
bb#(ba(x1)) |
(22) |
1.1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.