Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-467)

The rewrite relation of the following TRS is considered.

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

1.1 Closure Under Flat Contexts

Using the flat contexts

{a(☐), b(☐)}

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

1.1.1 Semantic Labeling

Root-labeling is applied.

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

1.1.1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
aa#(ab(ba(aa(x1)))) → ba#(aa(aa(x1))) (19)
aa#(ab(ba(aa(x1)))) → aa#(aa(x1)) (20)
aa#(ab(ba(ab(x1)))) → ba#(aa(ab(x1))) (21)
aa#(ab(ba(ab(x1)))) → aa#(ab(x1)) (22)
ba#(aa(ab(ba(x1)))) → ba#(aa(aa(aa(x1)))) (23)
ba#(aa(ab(ba(x1)))) → aa#(aa(aa(x1))) (24)
ba#(aa(ab(ba(x1)))) → aa#(aa(x1)) (25)
ba#(aa(ab(ba(x1)))) → aa#(x1) (26)
ba#(aa(ab(bb(x1)))) → ba#(aa(aa(ab(x1)))) (27)
ba#(aa(ab(bb(x1)))) → aa#(aa(ab(x1))) (28)
ba#(aa(ab(bb(x1)))) → aa#(ab(x1)) (29)
aa#(ab(bb(ba(aa(x1))))) → ba#(aa(ab(ba(x1)))) (30)
aa#(ab(bb(ba(aa(x1))))) → aa#(ab(ba(x1))) (31)
aa#(ab(bb(ba(aa(x1))))) → ba#(x1) (32)
aa#(ab(bb(ba(ab(x1))))) → ba#(aa(ab(bb(x1)))) (33)
aa#(ab(bb(ba(ab(x1))))) → aa#(ab(bb(x1))) (34)
ba#(ab(bb(ba(aa(x1))))) → ba#(aa(ab(ba(x1)))) (35)
ba#(ab(bb(ba(aa(x1))))) → aa#(ab(ba(x1))) (36)
ba#(ab(bb(ba(aa(x1))))) → ba#(x1) (37)
ba#(ab(bb(ba(ab(x1))))) → ba#(aa(ab(bb(x1)))) (38)
ba#(ab(bb(ba(ab(x1))))) → aa#(ab(bb(x1))) (39)

1.1.1.1.1 Reduction Pair Processor

Using the linear polynomial interpretation over the naturals
[aa#(x1)] = 1 · x1
[ab(x1)] = 1 + 1 · x1
[ba(x1)] = 1 + 1 · x1
[aa(x1)] = 1 + 1 · x1
[ba#(x1)] = 1 · x1
[bb(x1)] = 1 + 1 · x1
the pairs
aa#(ab(ba(aa(x1)))) → ba#(aa(aa(x1))) (19)
aa#(ab(ba(aa(x1)))) → aa#(aa(x1)) (20)
aa#(ab(ba(ab(x1)))) → ba#(aa(ab(x1))) (21)
aa#(ab(ba(ab(x1)))) → aa#(ab(x1)) (22)
ba#(aa(ab(ba(x1)))) → aa#(aa(aa(x1))) (24)
ba#(aa(ab(ba(x1)))) → aa#(aa(x1)) (25)
ba#(aa(ab(ba(x1)))) → aa#(x1) (26)
ba#(aa(ab(bb(x1)))) → aa#(aa(ab(x1))) (28)
ba#(aa(ab(bb(x1)))) → aa#(ab(x1)) (29)
aa#(ab(bb(ba(aa(x1))))) → ba#(aa(ab(ba(x1)))) (30)
aa#(ab(bb(ba(aa(x1))))) → aa#(ab(ba(x1))) (31)
aa#(ab(bb(ba(aa(x1))))) → ba#(x1) (32)
aa#(ab(bb(ba(ab(x1))))) → ba#(aa(ab(bb(x1)))) (33)
aa#(ab(bb(ba(ab(x1))))) → aa#(ab(bb(x1))) (34)
ba#(ab(bb(ba(aa(x1))))) → ba#(aa(ab(ba(x1)))) (35)
ba#(ab(bb(ba(aa(x1))))) → aa#(ab(ba(x1))) (36)
ba#(ab(bb(ba(aa(x1))))) → ba#(x1) (37)
ba#(ab(bb(ba(ab(x1))))) → ba#(aa(ab(bb(x1)))) (38)
ba#(ab(bb(ba(ab(x1))))) → aa#(ab(bb(x1))) (39)
could be deleted.

1.1.1.1.1.1 Reduction Pair Processor

Using the matrix interpretations of dimension 3 with strict dimension 1 over the arctic semiring over the naturals
[ba#(x1)] =
0
-∞
-∞
+
0 0 0
-∞ -∞ -∞
-∞ -∞ -∞
· x1
[aa(x1)] =
0
0
0
+
0 0 0
0 0 0
0 0 0
· x1
[ab(x1)] =
0
0
1
+
0 -∞ 0
0 -∞ 0
0 0 0
· x1
[ba(x1)] =
0
0
0
+
0 1 0
1 0 1
0 1 0
· x1
[bb(x1)] =
0
0
-∞
+
-∞ -∞ 0
1 -∞ -∞
-∞ 0 0
· x1
the pair
ba#(aa(ab(ba(x1)))) → ba#(aa(aa(aa(x1)))) (23)
could be deleted.

1.1.1.1.1.1.1 Reduction Pair Processor

Using the matrix interpretations of dimension 3 with strict dimension 1 over the arctic semiring over the naturals
[ba#(x1)] =
0
-∞
-∞
+
-∞ 0 -∞
-∞ -∞ -∞
-∞ -∞ -∞
· x1
[aa(x1)] =
0
-∞
-∞
+
-∞ -∞ -∞
-∞ -∞ 0
-∞ 0 -∞
· x1
[ab(x1)] =
0
-∞
1
+
0 0 -∞
-∞ 0 0
0 0 0
· x1
[bb(x1)] =
0
-∞
-∞
+
-∞ 1 0
-∞ -∞ 1
-∞ -∞ -∞
· x1
[ba(x1)] =
0
0
1
+
0 -∞ -∞
0 -∞ -∞
0 -∞ -∞
· x1
the pair
ba#(aa(ab(bb(x1)))) → ba#(aa(aa(ab(x1)))) (27)
could be deleted.

1.1.1.1.1.1.1.1 P is empty

There are no pairs anymore.