YES

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is finite.