Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-126)

The rewrite relation of the following TRS is considered.

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

1.1 Semantic Labeling

Root-labeling is applied.

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

1.1.1 Dependency Pair Transformation

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

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.