Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-470)

The rewrite relation of the following TRS is considered.

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

1.1 Semantic Labeling

Root-labeling is applied.

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

1.1.1 Dependency Pair Transformation

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

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 2 components.