YES

Problem 1: 


:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
Confluence Problem:
(VAR vNonEmpty)
(REPLACEMENT-MAP
(a)
(b)
(c)
(f 1)
(fSNonEmpty)
)
(RULES
a -> a
b -> b
c -> b
f(f(a)) -> c
)
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::


Problem 1: 

CleanTRS Procedure:
R was updated by simple cleaning of the TRS

:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
Confluence Problem:
(VAR vNonEmpty)
(REPLACEMENT-MAP
(a)
(b)
(c)
(f 1)
(fSNonEmpty)
)
(RULES
c -> b
f(f(a)) -> c
)
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::


Problem 1: 
Not CS-TRS Procedure:
R is not a CS-TRS

Problem 1: 
Linearity Procedure:
Linear?
YES

Problem 1: 
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
Confluence Problem:
(VAR vNonEmpty)
(REPLACEMENT-MAP
(a)
(b)
(c)
(f 1)
(fSNonEmpty)
)
(RULES
c -> b
f(f(a)) -> c
)
Linear:YES
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

Huet Levy Procedure:
-> Rules:
 c -> b
 f(f(a)) -> c
-> Vars:


-> Rlps:
 (rule: c -> b, id: 1, possubterms: c->[])
 (rule: f(f(a)) -> c, id: 2, possubterms: f(f(a))->[], f(a)->[1], a->[1, 1])

-> Unifications:


-> Critical pairs info:


-> Problem conclusions:
 Left linear, Right linear, Linear
 Weakly orthogonal, Almost orthogonal, Orthogonal
 Huet-Levy confluent, Not Newman confluent
 R is a TRS 


The problem is confluent.