YES

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is finite.