YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

b(a(b(x0)))	→	a(b(a(x0)))
b(b(a(x0)))	→	b(b(b(x0)))
c(a(x0))	→	a(b(c(x0)))
c(b(x0))	→	b(a(c(x0)))

Proof

1 Rule Removal

Using the linear polynomial interpretation over the naturals

[a(x₁)]	=	1 · x₁ + 1
[b(x₁)]	=	1 · x₁ + 1
[c(x₁)]	=	8 · x₁ + 14

the rules

b(a(b(x0)))	→	a(b(a(x0)))
b(b(a(x0)))	→	b(b(b(x0)))

remain.

1.1 String Reversal

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

b(a(b(x0)))	→	a(b(a(x0)))
a(b(b(x0)))	→	b(b(b(x0)))

1.1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.

b^#(a(b(x0)))	→	a^#(x0)
b^#(a(b(x0)))	→	b^#(a(x0))
b^#(a(b(x0)))	→	a^#(b(a(x0)))
a^#(b(b(x0)))	→	b^#(b(b(x0)))

1.1.1.1 Reduction Pair Processor with Usable Rules

Using the linear polynomial interpretation over the arctic semiring over the integers

[a^#(x₁)]	=	0 · x₁ + -∞
[a(x₁)]	=	1 · x₁ + -∞
[b^#(x₁)]	=	0 · x₁ + -∞
[b(x₁)]	=	1 · x₁ + -∞

together with the usable rules

b(a(b(x0)))	→	a(b(a(x0)))
a(b(b(x0)))	→	b(b(b(x0)))

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

b^#(a(b(x0)))	→	a^#(b(a(x0)))
a^#(b(b(x0)))	→	b^#(b(b(x0)))

remain.

1.1.1.1.1 Reduction Pair Processor with Usable Rules

Using the linear polynomial interpretation over (3 x 3)-matrices with strict dimension 1 over the arctic semiring over the integers

[a^#(x₁)]

1	0	-∞
-∞	-∞	-∞
-∞	-∞	-∞

· x₁ +

1	-∞	-∞
-∞	-∞	-∞
-∞	-∞	-∞

[a(x₁)]

0	-∞	-∞
0	0	-∞
1	0	0

· x₁ +

0	-∞	-∞
0	-∞	-∞
1	-∞	-∞

[b^#(x₁)]

0	0	0
-∞	-∞	-∞
-∞	-∞	-∞

· x₁ +

0	-∞	-∞
-∞	-∞	-∞
-∞	-∞	-∞

[b(x₁)]

0	0	-∞
0	0	0
0	0	0

· x₁ +

-∞	-∞	-∞
-∞	-∞	-∞
0	-∞	-∞

together with the usable rules

b(a(b(x0)))	→	a(b(a(x0)))
a(b(b(x0)))	→	b(b(b(x0)))

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

b^#(a(b(x0)))

→

a^#(b(a(x0)))

remains.

1.1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.