Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-266)

The rewrite relation of the following TRS is considered.

b(a(a(b(x1)))) → b(a(a(a(x1)))) (1)
a(b(b(a(x1)))) → a(a(b(b(x1)))) (2)
b(a(a(a(x1)))) → b(b(b(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(a(b(x1)))) → a(a(a(b(x1)))) (4)
a(b(b(a(x1)))) → b(b(a(a(x1)))) (5)
a(a(a(b(x1)))) → a(b(b(b(x1)))) (6)

1.1 Closure Under Flat Contexts

Using the flat contexts

{b(☐), a(☐)}

We obtain the transformed TRS
a(a(a(b(x1)))) → a(b(b(b(x1)))) (6)
b(b(a(a(b(x1))))) → b(a(a(a(b(x1))))) (7)
a(b(a(a(b(x1))))) → a(a(a(a(b(x1))))) (8)
b(a(b(b(a(x1))))) → b(b(b(a(a(x1))))) (9)
a(a(b(b(a(x1))))) → a(b(b(a(a(x1))))) (10)

1.1.1 Semantic Labeling

Root-labeling is applied.

We obtain the labeled TRS
aa(aa(ab(ba(x1)))) → ab(bb(bb(ba(x1)))) (11)
aa(aa(ab(bb(x1)))) → ab(bb(bb(bb(x1)))) (12)
bb(ba(aa(ab(ba(x1))))) → ba(aa(aa(ab(ba(x1))))) (13)
bb(ba(aa(ab(bb(x1))))) → ba(aa(aa(ab(bb(x1))))) (14)
ab(ba(aa(ab(ba(x1))))) → aa(aa(aa(ab(ba(x1))))) (15)
ab(ba(aa(ab(bb(x1))))) → aa(aa(aa(ab(bb(x1))))) (16)
ba(ab(bb(ba(aa(x1))))) → bb(bb(ba(aa(aa(x1))))) (17)
ba(ab(bb(ba(ab(x1))))) → bb(bb(ba(aa(ab(x1))))) (18)
aa(ab(bb(ba(aa(x1))))) → ab(bb(ba(aa(aa(x1))))) (19)
aa(ab(bb(ba(ab(x1))))) → ab(bb(ba(aa(ab(x1))))) (20)

1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[aa(x1)] = 1 · x1
[ab(x1)] = 1 · x1
[ba(x1)] = 1 · x1 + 1
[bb(x1)] = 1 · x1
all of the following rules can be deleted.
ab(ba(aa(ab(ba(x1))))) → aa(aa(aa(ab(ba(x1))))) (15)
ab(ba(aa(ab(bb(x1))))) → aa(aa(aa(ab(bb(x1))))) (16)
ba(ab(bb(ba(aa(x1))))) → bb(bb(ba(aa(aa(x1))))) (17)
ba(ab(bb(ba(ab(x1))))) → bb(bb(ba(aa(ab(x1))))) (18)

1.1.1.1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
aa#(aa(ab(ba(x1)))) → bb#(bb(ba(x1))) (21)
aa#(aa(ab(ba(x1)))) → bb#(ba(x1)) (22)
aa#(aa(ab(bb(x1)))) → bb#(bb(bb(x1))) (23)
aa#(aa(ab(bb(x1)))) → bb#(bb(x1)) (24)
bb#(ba(aa(ab(ba(x1))))) → aa#(aa(ab(ba(x1)))) (25)
bb#(ba(aa(ab(bb(x1))))) → aa#(aa(ab(bb(x1)))) (26)
aa#(ab(bb(ba(aa(x1))))) → bb#(ba(aa(aa(x1)))) (27)
aa#(ab(bb(ba(aa(x1))))) → aa#(aa(x1)) (28)
aa#(ab(bb(ba(ab(x1))))) → bb#(ba(aa(ab(x1)))) (29)
aa#(ab(bb(ba(ab(x1))))) → aa#(ab(x1)) (30)

1.1.1.1.1.1 Reduction Pair Processor

Using the linear polynomial interpretation over the naturals
[aa#(x1)] = 1 · x1
[aa(x1)] = 1 + 1 · x1
[ab(x1)] = 1 · x1
[ba(x1)] = 1 · x1
[bb#(x1)] = 1 · x1
[bb(x1)] = 1 + 1 · x1
the pairs
aa#(aa(ab(ba(x1)))) → bb#(ba(x1)) (22)
aa#(aa(ab(bb(x1)))) → bb#(bb(x1)) (24)
aa#(ab(bb(ba(aa(x1))))) → aa#(aa(x1)) (28)
aa#(ab(bb(ba(ab(x1))))) → aa#(ab(x1)) (30)
could be deleted.

1.1.1.1.1.1.1 Reduction Pair Processor

Using the linear polynomial interpretation over the naturals
[aa#(x1)] = 1 · x1
[aa(x1)] = 1 + 1 · x1
[ab(x1)] = 1 + 1 · x1
[ba(x1)] = 1 · x1
[bb#(x1)] = 1 · x1
[bb(x1)] = 1 + 1 · x1
the pairs
aa#(aa(ab(ba(x1)))) → bb#(bb(ba(x1))) (21)
aa#(aa(ab(bb(x1)))) → bb#(bb(bb(x1))) (23)
aa#(ab(bb(ba(aa(x1))))) → bb#(ba(aa(aa(x1)))) (27)
aa#(ab(bb(ba(ab(x1))))) → bb#(ba(aa(ab(x1)))) (29)
could be deleted.

1.1.1.1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.