Certification Problem

Input (TPDB SRS_Standard/Bouchare_06/04)

The rewrite relation of the following TRS is considered.

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

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 String Reversal

Since only unary symbols occur, one can reverse all terms and obtains the TRS
b(b(b(x1))) → b(a(x1)) (4)
a(a(x1)) → a(b(a(x1))) (2)
a(a(a(x1))) → b(b(a(x1))) (5)

1.1 Closure Under Flat Contexts

Using the flat contexts

{b(☐), a(☐)}

We obtain the transformed TRS
b(b(b(x1))) → b(a(x1)) (4)
a(a(x1)) → a(b(a(x1))) (2)
b(a(a(a(x1)))) → b(b(b(a(x1)))) (6)
a(a(a(a(x1)))) → a(b(b(a(x1)))) (7)

1.1.1 Semantic Labeling

Root-labeling is applied.

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

1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[bb(x1)] = 1 · x1 + 1
[ba(x1)] = 1 · x1
[ab(x1)] = 1 · x1
[aa(x1)] = 1 · x1 + 1
all of the following rules can be deleted.
bb(bb(bb(x1))) → ba(ab(x1)) (8)
bb(bb(ba(x1))) → ba(aa(x1)) (9)
aa(ab(x1)) → ab(ba(ab(x1))) (10)
aa(aa(x1)) → ab(ba(aa(x1))) (11)
aa(aa(aa(ab(x1)))) → ab(bb(ba(ab(x1)))) (14)
aa(aa(aa(aa(x1)))) → ab(bb(ba(aa(x1)))) (15)

1.1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[ba(x1)] = 1 · x1
[aa(x1)] = 1 · x1 + 1
[ab(x1)] = 1 · x1
[bb(x1)] = 1 · x1
all of the following rules can be deleted.
ba(aa(aa(ab(x1)))) → bb(bb(ba(ab(x1)))) (12)
ba(aa(aa(aa(x1)))) → bb(bb(ba(aa(x1)))) (13)

1.1.1.1.1.1 R is empty

There are no rules in the TRS. Hence, it is terminating.