Certification Problem

Input (TPDB SRS_Standard/Waldmann_06_SRS/uni-1)

The rewrite relation of the following TRS is considered.

a(a(a(x1))) → a(c(a(a(x1)))) (1)
c(c(c(x1))) → a(x1) (2)
a(x1) → x1 (3)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by matchbox @ termCOMP 2023)

1 Closure Under Flat Contexts

Using the flat contexts

{c(☐), a(☐)}

We obtain the transformed TRS
c(a(a(a(x1)))) → c(a(c(a(a(x1))))) (4)
c(c(c(c(x1)))) → c(a(x1)) (5)
c(a(x1)) → c(x1) (6)
a(a(a(a(x1)))) → a(a(c(a(a(x1))))) (7)
a(c(c(c(x1)))) → a(a(x1)) (8)
a(a(x1)) → a(x1) (9)

1.1 Semantic Labeling

The following interpretations form a model of the rules.

As carrier we take the set {0,1}. Symbols are labeled by the interpretation of their arguments using the interpretations (modulo 2):

[c(x1)] = 2x1 + 0
[a(x1)] = 2x1 + 1

We obtain the labeled TRS
a1(a1(a1(a1(x1)))) → a1(a0(c1(a1(a1(x1))))) (10)
a1(a1(a1(a0(x1)))) → a1(a0(c1(a1(a0(x1))))) (11)
c1(a1(a1(a1(x1)))) → c1(a0(c1(a1(a1(x1))))) (12)
c1(a1(a1(a0(x1)))) → c1(a0(c1(a1(a0(x1))))) (13)
a0(c0(c0(c1(x1)))) → a1(a1(x1)) (14)
a0(c0(c0(c0(x1)))) → a1(a0(x1)) (15)
c0(c0(c0(c1(x1)))) → c1(a1(x1)) (16)
c0(c0(c0(c0(x1)))) → c1(a0(x1)) (17)
a1(a1(x1)) → a1(x1) (18)
a1(a0(x1)) → a0(x1) (19)
c1(a1(x1)) → c1(x1) (20)
c1(a0(x1)) → c0(x1) (21)

1.1.1 Rule Removal

Using the matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1
[c0(x1)] = x1 +
5
[c1(x1)] = x1 +
6
[a0(x1)] = x1 +
1
[a1(x1)] = x1 +
8
all of the following rules can be deleted.
a1(a1(a1(a1(x1)))) → a1(a0(c1(a1(a1(x1))))) (10)
a1(a1(a1(a0(x1)))) → a1(a0(c1(a1(a0(x1))))) (11)
c1(a1(a1(a1(x1)))) → c1(a0(c1(a1(a1(x1))))) (12)
c1(a1(a1(a0(x1)))) → c1(a0(c1(a1(a0(x1))))) (13)
a0(c0(c0(c1(x1)))) → a1(a1(x1)) (14)
a0(c0(c0(c0(x1)))) → a1(a0(x1)) (15)
c0(c0(c0(c1(x1)))) → c1(a1(x1)) (16)
c0(c0(c0(c0(x1)))) → c1(a0(x1)) (17)
a1(a1(x1)) → a1(x1) (18)
a1(a0(x1)) → a0(x1) (19)
c1(a1(x1)) → c1(x1) (20)
c1(a0(x1)) → c0(x1) (21)

1.1.1.1 R is empty

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