YES

Problem 1: 

(VAR v_NonEmpty:S x1:S)
(RULES
a(b(x1:S)) -> b(c(a(x1:S)))
b(a(x1:S)) -> a(c(b(x1:S)))
b(c(x1:S)) -> c(b(b(x1:S)))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 A(b(x1:S)) -> A(x1:S)
 A(b(x1:S)) -> B(c(a(x1:S)))
 B(a(x1:S)) -> A(c(b(x1:S)))
 B(a(x1:S)) -> B(x1:S)
 B(c(x1:S)) -> B(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))

Problem 1: 

SCC Processor:
-> Pairs:
 A(b(x1:S)) -> A(x1:S)
 A(b(x1:S)) -> B(c(a(x1:S)))
 B(a(x1:S)) -> A(c(b(x1:S)))
 B(a(x1:S)) -> B(x1:S)
 B(c(x1:S)) -> B(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B(a(x1:S)) -> B(x1:S)
 B(c(x1:S)) -> B(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
->->-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
->->Cycle:
->->-> Pairs:
 A(b(x1:S)) -> A(x1:S)
->->-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))


The problem is decomposed in 2 subproblems.

Problem 1.1: 

Reduction Pair Processor:
-> Pairs:
 B(a(x1:S)) -> B(x1:S)
 B(c(x1:S)) -> B(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
-> Usable rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a](X) = 2.X + 1
[b](X) = X
[c](X) = X
[B](X) = 2.X

Problem 1.1: 

SCC Processor:
-> Pairs:
 B(c(x1:S)) -> B(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B(c(x1:S)) -> B(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
->->-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))

Problem 1.1: 

Reduction Pair Processor:
-> Pairs:
 B(c(x1:S)) -> B(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
-> Usable rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 2
->Bound:
 1
->Interpretation:
 
[a](X) = [1 1;1 0].X + [1;0]
[b](X) = [1 1;0 1].X + [1;0]
[c](X) = [0 0;0 1].X + [0;1]
[B](X) = [0 1;0 1].X

Problem 1.1: 

SCC Processor:
-> Pairs:
 B(c(x1:S)) -> B(x1:S)
-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B(c(x1:S)) -> B(x1:S)
->->-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))

Problem 1.1: 

Subterm Processor:
-> Pairs:
 B(c(x1:S)) -> B(x1:S)
-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
->Projection:
 pi(B) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Subterm Processor:
-> Pairs:
 A(b(x1:S)) -> A(x1:S)
-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
->Projection:
 pi(A) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 a(b(x1:S)) -> b(c(a(x1:S)))
 b(a(x1:S)) -> a(c(b(x1:S)))
 b(c(x1:S)) -> c(b(b(x1:S)))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.