Certification Problem

Input (TPDB SRS_Relative/Waldmann_19/random-50)

The rewrite relation of the following TRS is considered.

c(b(a(x1)))	→	c(c(c(x1)))	(1)
b(c(c(x1)))	→	a(c(c(x1)))	(2)
b(a(c(x1)))	→	b(c(b(x1)))	(3)
a(a(c(x1)))	→	c(c(c(x1)))	(4)
c(a(c(x1)))	→	c(c(b(x1)))	(5)
b(c(a(x1)))	→	a(a(b(x1)))	(6)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by matchbox @ termCOMP 2023)

1 String Reversal

Since only unary symbols occur, one can reverse all terms and obtains the TRS

a(b(c(x1)))	→	c(c(c(x1)))	(7)
c(c(b(x1)))	→	c(c(a(x1)))	(8)
c(a(b(x1)))	→	b(c(b(x1)))	(9)
c(a(a(x1)))	→	c(c(c(x1)))	(10)
c(a(c(x1)))	→	b(c(c(x1)))	(11)
a(c(b(x1)))	→	b(a(a(x1)))	(12)

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.

c^#(c(b(x1)))	→	c^#(c(a(x1)))	(13)
c^#(c(b(x1)))	→	c^#(a(x1))	(14)
c^#(c(b(x1)))	→	a^#(x1)	(15)
c^#(a(c(x1)))	→	c^#(c(x1))	(16)
c^#(a(b(x1)))	→	c^#(b(x1))	(17)
c^#(a(a(x1)))	→	c^#(x1)	(18)
c^#(a(a(x1)))	→	c^#(c(x1))	(19)
c^#(a(a(x1)))	→	c^#(c(c(x1)))	(20)
a^#(c(b(x1)))	→	a^#(x1)	(21)
a^#(c(b(x1)))	→	a^#(a(x1))	(22)
a^#(b(c(x1)))	→	c^#(c(x1))	(23)
a^#(b(c(x1)))	→	c^#(c(c(x1)))	(24)

1.1.1 Monotonic Reduction Pair Processor with Usable Rules

Using the matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1

[c(x₁)]

x₁ +

[b(x₁)]

x₁ +

[a(x₁)]

x₁ +

[c^#(x₁)]

x₁ +

[a^#(x₁)]

x₁ +

together with the usable rules

a(b(c(x1)))	→	c(c(c(x1)))	(7)
c(c(b(x1)))	→	c(c(a(x1)))	(8)
c(a(b(x1)))	→	b(c(b(x1)))	(9)
c(a(a(x1)))	→	c(c(c(x1)))	(10)
c(a(c(x1)))	→	b(c(c(x1)))	(11)
a(c(b(x1)))	→	b(a(a(x1)))	(12)

(w.r.t. the implicit argument filter of the reduction pair), the pairs

c^#(c(b(x1)))	→	c^#(a(x1))	(14)
c^#(c(b(x1)))	→	a^#(x1)	(15)
c^#(a(c(x1)))	→	c^#(c(x1))	(16)
c^#(a(b(x1)))	→	c^#(b(x1))	(17)
c^#(a(a(x1)))	→	c^#(x1)	(18)
c^#(a(a(x1)))	→	c^#(c(x1))	(19)
a^#(c(b(x1)))	→	a^#(x1)	(21)
a^#(c(b(x1)))	→	a^#(a(x1))	(22)
a^#(b(c(x1)))	→	c^#(c(x1))	(23)
a^#(b(c(x1)))	→	c^#(c(c(x1)))	(24)

and no rules could be deleted.

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

The 1^st component contains the pair

c^#(c(b(x1)))	→	c^#(c(a(x1)))	(13)
c^#(a(a(x1)))	→	c^#(c(c(x1)))	(20)

1.1.1.1.1 Reduction Pair Processor with Usable Rules

Using the matrix interpretations of dimension 2 with strict dimension 1 over the arctic semiring over the naturals

[c(x₁)]

0	0
-2	-2

· x₁ +

-∞

[b(x₁)]

0	0
-2	-2

· x₁ +

-∞

[a(x₁)]

0	0
0	0

· x₁ +

-∞

[c^#(x₁)]

1	2
1	2

· x₁ +

-∞

together with the usable rules

a(b(c(x1)))	→	c(c(c(x1)))	(7)
c(c(b(x1)))	→	c(c(a(x1)))	(8)
c(a(b(x1)))	→	b(c(b(x1)))	(9)
c(a(a(x1)))	→	c(c(c(x1)))	(10)
c(a(c(x1)))	→	b(c(c(x1)))	(11)
a(c(b(x1)))	→	b(a(a(x1)))	(12)

(w.r.t. the implicit argument filter of the reduction pair), the pair

c^#(a(a(x1)))

→

c^#(c(c(x1)))

(20)

could be deleted.

1.1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

The 1^st component contains the pair

c^#(c(b(x1)))

→

c^#(c(a(x1)))

(13)

1.1.1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules

Using the matrix interpretations of dimension 1 with strict dimension 1 over the naturals

[c(x₁)]

· x₁ +

[b(x₁)]

· x₁ +

[a(x₁)]

· x₁ +

[c^#(x₁)]

· x₁ +

together with the usable rules

a(b(c(x1)))	→	c(c(c(x1)))	(7)
c(c(b(x1)))	→	c(c(a(x1)))	(8)
c(a(b(x1)))	→	b(c(b(x1)))	(9)
c(a(a(x1)))	→	c(c(c(x1)))	(10)
c(a(c(x1)))	→	b(c(c(x1)))	(11)
a(c(b(x1)))	→	b(a(a(x1)))	(12)

(w.r.t. the implicit argument filter of the reduction pair), the pair

c^#(c(b(x1)))

→

c^#(c(a(x1)))

(13)

and the rules

a(b(c(x1)))	→	c(c(c(x1)))	(7)
c(c(b(x1)))	→	c(c(a(x1)))	(8)
c(a(b(x1)))	→	b(c(b(x1)))	(9)
c(a(a(x1)))	→	c(c(c(x1)))	(10)
c(a(c(x1)))	→	b(c(c(x1)))	(11)
a(c(b(x1)))	→	b(a(a(x1)))	(12)

could be deleted.

1.1.1.1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.