Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-115)

The rewrite relation of the following TRS is considered.

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

{a(☐), b(☐)}

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

1.1 Semantic Labeling

Root-labeling is applied.

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

1.1.1 Dependency Pair Transformation

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

1.1.1.1 Reduction Pair Processor

Using the linear polynomial interpretation over the naturals
[aa#(x1)] = 1 + 1 · x1
[aa(x1)] = 1 + 1 · x1
[ab(x1)] = 1 + 1 · x1
[bb(x1)] = 1 + 1 · x1
[ba(x1)] = 1 + 1 · x1
[ba#(x1)] = 1 + 1 · x1
the pairs
aa#(aa(aa(aa(x1)))) → ba#(x1) (15)
ba#(aa(aa(aa(x1)))) → ba#(aa(x1)) (18)
ba#(aa(aa(ab(x1)))) → ba#(ab(x1)) (20)
aa#(ab(bb(bb(ba(x1))))) → ba#(aa(aa(x1))) (21)
aa#(ab(bb(bb(ba(x1))))) → aa#(aa(x1)) (22)
aa#(ab(bb(bb(ba(x1))))) → aa#(x1) (23)
aa#(ab(bb(bb(bb(x1))))) → ba#(aa(ab(x1))) (24)
aa#(ab(bb(bb(bb(x1))))) → aa#(ab(x1)) (25)
ba#(ab(bb(bb(ba(x1))))) → ba#(aa(aa(x1))) (26)
ba#(ab(bb(bb(ba(x1))))) → aa#(aa(x1)) (27)
ba#(ab(bb(bb(ba(x1))))) → aa#(x1) (28)
ba#(ab(bb(bb(bb(x1))))) → ba#(aa(ab(x1))) (29)
ba#(ab(bb(bb(bb(x1))))) → aa#(ab(x1)) (30)
could be deleted.

1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.