Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-132)

The rewrite relation of the following TRS is considered.

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

1.1 Closure Under Flat Contexts

Using the flat contexts

{b(☐), a(☐)}

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

1.1.1 Semantic Labeling

Root-labeling is applied.

We obtain the labeled TRS
ba(ab(bb(bb(x1)))) → bb(bb(ba(ab(x1)))) (9)
ba(ab(bb(ba(x1)))) → bb(bb(ba(aa(x1)))) (10)
ba(aa(ab(bb(x1)))) → ba(aa(aa(ab(x1)))) (11)
ba(aa(ab(ba(x1)))) → ba(aa(aa(aa(x1)))) (12)
bb(ba(aa(aa(ab(x1))))) → ba(ab(bb(ba(ab(x1))))) (13)
bb(ba(aa(aa(aa(x1))))) → ba(ab(bb(ba(aa(x1))))) (14)
ab(ba(aa(aa(ab(x1))))) → aa(ab(bb(ba(ab(x1))))) (15)
ab(ba(aa(aa(aa(x1))))) → aa(ab(bb(ba(aa(x1))))) (16)

1.1.1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
ba#(ab(bb(bb(x1)))) → bb#(bb(ba(ab(x1)))) (17)
ba#(ab(bb(bb(x1)))) → bb#(ba(ab(x1))) (18)
ba#(ab(bb(bb(x1)))) → ba#(ab(x1)) (19)
ba#(ab(bb(bb(x1)))) → ab#(x1) (20)
ba#(ab(bb(ba(x1)))) → bb#(bb(ba(aa(x1)))) (21)
ba#(ab(bb(ba(x1)))) → bb#(ba(aa(x1))) (22)
ba#(ab(bb(ba(x1)))) → ba#(aa(x1)) (23)
ba#(aa(ab(bb(x1)))) → ba#(aa(aa(ab(x1)))) (24)
ba#(aa(ab(bb(x1)))) → ab#(x1) (25)
ba#(aa(ab(ba(x1)))) → ba#(aa(aa(aa(x1)))) (26)
bb#(ba(aa(aa(ab(x1))))) → ba#(ab(bb(ba(ab(x1))))) (27)
bb#(ba(aa(aa(ab(x1))))) → ab#(bb(ba(ab(x1)))) (28)
bb#(ba(aa(aa(ab(x1))))) → bb#(ba(ab(x1))) (29)
bb#(ba(aa(aa(ab(x1))))) → ba#(ab(x1)) (30)
bb#(ba(aa(aa(aa(x1))))) → ba#(ab(bb(ba(aa(x1))))) (31)
bb#(ba(aa(aa(aa(x1))))) → ab#(bb(ba(aa(x1)))) (32)
bb#(ba(aa(aa(aa(x1))))) → bb#(ba(aa(x1))) (33)
bb#(ba(aa(aa(aa(x1))))) → ba#(aa(x1)) (34)
ab#(ba(aa(aa(ab(x1))))) → ab#(bb(ba(ab(x1)))) (35)
ab#(ba(aa(aa(ab(x1))))) → bb#(ba(ab(x1))) (36)
ab#(ba(aa(aa(ab(x1))))) → ba#(ab(x1)) (37)
ab#(ba(aa(aa(aa(x1))))) → ab#(bb(ba(aa(x1)))) (38)
ab#(ba(aa(aa(aa(x1))))) → bb#(ba(aa(x1))) (39)
ab#(ba(aa(aa(aa(x1))))) → ba#(aa(x1)) (40)

1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.