Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-408)

The rewrite relation of the following TRS is considered.

a(b(b(b(x1)))) → b(b(a(b(x1)))) (1)
a(b(a(a(x1)))) → b(a(b(a(x1)))) (2)
b(b(a(a(x1)))) → b(a(a(a(x1)))) (3)
a(b(b(b(x1)))) → a(b(a(a(x1)))) (4)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Closure Under Flat Contexts

Using the flat contexts

{a(☐), b(☐)}

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

1.1 Semantic Labeling

Root-labeling is applied.

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

1.1.1 Rule Removal

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

1.1.1.1 Dependency Pair Transformation

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

1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.