Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-371)

The rewrite relation of the following TRS is considered.

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

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
a#(a(a(a(x1)))) → a#(a(a(b(x1)))) (7)
a#(a(a(a(x1)))) → a#(a(b(x1))) (8)
a#(a(a(a(x1)))) → a#(b(x1)) (9)
a#(a(a(a(x1)))) → b#(x1) (10)
b#(a(b(b(x1)))) → b#(b(a(a(x1)))) (11)
b#(a(b(b(x1)))) → b#(a(a(x1))) (12)
b#(a(b(b(x1)))) → a#(a(x1)) (13)
b#(a(b(b(x1)))) → a#(x1) (14)
a#(b(a(a(x1)))) → b#(a(a(a(x1)))) (15)
a#(b(a(a(x1)))) → a#(a(a(x1))) (16)

1.1.1 Reduction Pair Processor

Using the linear polynomial interpretation over the naturals
[a#(x1)] = 1 · x1
[a(x1)] = 1 + 1 · x1
[b(x1)] = 1 + 1 · x1
[b#(x1)] = 1 · x1
the pairs
a#(a(a(a(x1)))) → a#(a(b(x1))) (8)
a#(a(a(a(x1)))) → a#(b(x1)) (9)
a#(a(a(a(x1)))) → b#(x1) (10)
b#(a(b(b(x1)))) → b#(a(a(x1))) (12)
b#(a(b(b(x1)))) → a#(a(x1)) (13)
b#(a(b(b(x1)))) → a#(x1) (14)
a#(b(a(a(x1)))) → a#(a(a(x1))) (16)
could be deleted.

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 2 components.