Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-450)

The rewrite relation of the following TRS is considered.

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

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Closure Under Flat Contexts

Using the flat contexts

{b(☐), a(☐)}

We obtain the transformed TRS
b(a(b(b(x1)))) → b(b(b(b(x1)))) (1)
b(a(b(b(x1)))) → b(a(a(a(x1)))) (3)
b(b(b(a(a(x1))))) → b(a(a(b(b(x1))))) (4)
a(b(b(a(a(x1))))) → a(a(a(b(b(x1))))) (5)

1.1 Semantic Labeling

Root-labeling is applied.

We obtain the labeled TRS
ba(ab(bb(bb(x1)))) → bb(bb(bb(bb(x1)))) (6)
ba(ab(bb(ba(x1)))) → bb(bb(bb(ba(x1)))) (7)
ba(ab(bb(bb(x1)))) → ba(aa(aa(ab(x1)))) (8)
ba(ab(bb(ba(x1)))) → ba(aa(aa(aa(x1)))) (9)
bb(bb(ba(aa(ab(x1))))) → ba(aa(ab(bb(bb(x1))))) (10)
bb(bb(ba(aa(aa(x1))))) → ba(aa(ab(bb(ba(x1))))) (11)
ab(bb(ba(aa(ab(x1))))) → aa(aa(ab(bb(bb(x1))))) (12)
ab(bb(ba(aa(aa(x1))))) → aa(aa(ab(bb(ba(x1))))) (13)

1.1.1 Dependency Pair Transformation

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

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.