Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-106)

The rewrite relation of the following TRS is considered.

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

1.1 Semantic Labeling

Root-labeling is applied.

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

1.1.1 Dependency Pair Transformation

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

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.