NO

Problem 1: 


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


Problem 1: 

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

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


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

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

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

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

-> Unifications:
(R1 unifies with R1 at p: [1], l: f(f(x,a),a), lp: f(x,a), sig: {x -> f(x',a)}, l': f(f(x',a),a), r: b, r': b)

-> Critical pairs info:
<f(b,a),b>   =>  Not trivial, Not overlay, Proper, NW0, N1

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


Problem 1: 
No Convergence Brute Force Procedure:
-> Rewritings:
s: f(b,a)
Nodes: [0]
Edges: []
ID: 0 => ('f(b,a)', D0)
t: b
Nodes: [0]
Edges: []
ID: 0 => ('b', D0)
f(b,a) ->* no union *<- b
"Not joinable"

The problem is not confluent.