YES

Problem 1: 


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


Problem 1: 

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

:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
Confluence Problem:
(VAR vNonEmpty)
(REPLACEMENT-MAP
(c)
(h 1, 2)
(a)
(b)
(f 1)
(fSNonEmpty)
)
(RULES
h(a,h(f(b),c)) -> 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
(c)
(h 1, 2)
(a)
(b)
(f 1)
(fSNonEmpty)
)
(RULES
h(a,h(f(b),c)) -> c
)
Linear:YES
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

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


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

-> 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.