Certification Problem

Input (TPDB SRS_Standard/Secret_06_SRS/secr3)

The rewrite relation of the following TRS is considered.

a(b(a(x1))) → b(c(x1)) (1)
b(b(b(x1))) → c(b(x1)) (2)
c(x1) → a(b(x1)) (3)
c(d(x1)) → d(c(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(x1))) → c(b(x1)) (5)
b(b(b(x1))) → b(c(x1)) (6)
c(x1) → b(a(x1)) (7)
d(c(x1)) → a(b(c(d(x1)))) (8)

1.1 Dependency Pair Transformation

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

1.1.1 Dependency Graph Processor

The dependency pairs are split into 2 components.