Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-361)

The rewrite relation of the following TRS is considered.

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

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

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
a#(b(a(b(x1)))) → a#(a(b(b(x1)))) (9)
a#(b(a(b(x1)))) → a#(b(b(x1))) (10)
a#(b(a(b(x1)))) → b#(b(x1)) (11)
b#(a(a(a(x1)))) → a#(a(b(a(x1)))) (12)
b#(a(a(a(x1)))) → a#(b(a(x1))) (13)
b#(a(a(a(x1)))) → b#(a(x1)) (14)
a#(b(a(a(x1)))) → a#(a(b(b(x1)))) (15)
a#(b(a(a(x1)))) → a#(b(b(x1))) (16)
a#(b(a(a(x1)))) → b#(b(x1)) (17)
a#(b(a(a(x1)))) → b#(x1) (18)
b#(b(b(a(x1)))) → a#(b(a(b(x1)))) (19)
b#(b(b(a(x1)))) → b#(a(b(x1))) (20)
b#(b(b(a(x1)))) → a#(b(x1)) (21)
b#(b(b(a(x1)))) → b#(x1) (22)

1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.