Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-216)

The rewrite relation of the following TRS is considered.

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

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Semantic Labeling

Root-labeling is applied.

We obtain the labeled TRS
aa(aa(ab(ba(x1)))) → ab(bb(bb(ba(x1)))) (4)
aa(aa(ab(bb(x1)))) → ab(bb(bb(bb(x1)))) (5)
aa(ab(bb(ba(x1)))) → ab(bb(ba(aa(x1)))) (6)
aa(ab(bb(bb(x1)))) → ab(bb(ba(ab(x1)))) (7)
ab(ba(ab(ba(x1)))) → aa(ab(ba(aa(x1)))) (8)
ab(ba(ab(bb(x1)))) → aa(ab(ba(ab(x1)))) (9)

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
aa#(aa(ab(ba(x1)))) → ab#(bb(bb(ba(x1)))) (10)
aa#(aa(ab(bb(x1)))) → ab#(bb(bb(bb(x1)))) (11)
aa#(ab(bb(ba(x1)))) → ab#(bb(ba(aa(x1)))) (12)
aa#(ab(bb(ba(x1)))) → aa#(x1) (13)
aa#(ab(bb(bb(x1)))) → ab#(bb(ba(ab(x1)))) (14)
aa#(ab(bb(bb(x1)))) → ab#(x1) (15)
ab#(ba(ab(ba(x1)))) → aa#(ab(ba(aa(x1)))) (16)
ab#(ba(ab(ba(x1)))) → ab#(ba(aa(x1))) (17)
ab#(ba(ab(ba(x1)))) → aa#(x1) (18)
ab#(ba(ab(bb(x1)))) → aa#(ab(ba(ab(x1)))) (19)
ab#(ba(ab(bb(x1)))) → ab#(ba(ab(x1))) (20)
ab#(ba(ab(bb(x1)))) → ab#(x1) (21)

1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.