Certification Problem

Input (TPDB SRS_Relative/Waldmann_06_relative/r3)

The relative rewrite relation R/S is considered where R is the following TRS

a(a(x1)) → x1 (1)

and S is the following TRS.

a(a(x1)) → b(a(a(a(b(x1))))) (2)

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

1.1 Closure Under Flat Contexts

Using the flat contexts

{a(☐), b(☐)}

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

1.1.1 Semantic Labeling

Root-labeling is applied.

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

1.1.1.1 Rule Removal

Using the matrix interpretations of dimension 3 with strict dimension 1 over the integers
[aa(x1)] =
0
0
1
+
1 1 0
0 0 1
0 0 1
· x1
[ab(x1)] =
0
0
0
+
1 0 0
0 0 0
0 0 0
· x1
[ba(x1)] =
0
0
0
+
1 0 0
0 0 0
0 0 0
· x1
[bb(x1)] =
0
0
0
+
1 0 0
0 0 0
0 0 0
· x1
all of the following rules can be deleted.
aa(aa(aa(x1))) → aa(x1) (7)
aa(aa(aa(x1))) → ab(ba(aa(aa(ab(ba(x1)))))) (11)

1.1.1.1.1 Rule Removal

Using the matrix interpretations of dimension 3 with strict dimension 1 over the integers
[aa(x1)] =
0
0
0
+
1 0 0
0 0 1
0 1 0
· x1
[ab(x1)] =
0
1
0
+
1 0 0
0 0 0
0 0 0
· x1
[ba(x1)] =
0
0
0
+
1 0 1
0 0 0
0 0 0
· x1
[bb(x1)] =
0
0
0
+
1 0 0
0 0 0
0 0 0
· x1
all of the following rules can be deleted.
ba(aa(ab(x1))) → bb(x1) (10)
ba(aa(ab(x1))) → bb(ba(aa(aa(ab(bb(x1)))))) (14)

1.1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1.1 R is empty

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