Certification Problem

Input (TPDB SRS_Standard/Bouchare_06/01)

The rewrite relation of the following TRS is considered.

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

1.1 Closure Under Flat Contexts

Using the flat contexts

{b(☐), a(☐)}

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

1.1.1 Semantic Labeling

Root-labeling is applied.

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

1.1.1.1 Rule Removal

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

1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1 R is empty

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