YES

Problem 1: 


:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
Confluence Problem:
(VAR vNonEmpty x y)
(REPLACEMENT-MAP
(+ 1, 2)
(fSNonEmpty)
(s 1)
)
(RULES
+(s(x),y) -> s(+(x,y))
+(x,s(y)) -> s(+(x,y))
+(x,y) -> +(y,x)
)
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::


Problem 1: 

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

Problem 1: 
Linearity Procedure:
Linear?
YES

Problem 1: 
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
Confluence Problem:
(VAR vNonEmpty x y)
(REPLACEMENT-MAP
(+ 1, 2)
(fSNonEmpty)
(s 1)
)
(RULES
+(s(x),y) -> s(+(x,y))
+(x,s(y)) -> s(+(x,y))
+(x,y) -> +(y,x)
)
Linear:YES
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

Huet Levy Procedure:
-> Rules:
 +(s(x),y) -> s(+(x,y))
 +(x,s(y)) -> s(+(x,y))
 +(x,y) -> +(y,x)
-> Vars:
 x, y, x, y, x, y

-> Rlps:
 (rule: +(s(x),y) -> s(+(x,y)), id: 1, possubterms: +(s(x),y)->[], s(x)->[1])
 (rule: +(x,s(y)) -> s(+(x,y)), id: 2, possubterms: +(x,s(y))->[], s(y)->[2])
 (rule: +(x,y) -> +(y,x), id: 3, possubterms: +(x,y)->[])

-> Unifications:
(R2 unifies with R1 at p: [], l: +(x,s(y)), lp: +(x,s(y)), sig: {x -> s(x'),y' -> s(y)}, l': +(s(x'),y'), r: s(+(x,y)), r': s(+(x',y')))
(R3 unifies with R1 at p: [], l: +(x,y), lp: +(x,y), sig: {x -> s(x'),y -> y'}, l': +(s(x'),y'), r: +(y,x), r': s(+(x',y')))
(R3 unifies with R2 at p: [], l: +(x,y), lp: +(x,y), sig: {x -> x',y -> s(y')}, l': +(x',s(y')), r: +(y,x), r': s(+(x',y')))

-> Critical pairs info:
<s(+(x',y')),+(s(y'),x')>   =>  Not trivial, Overlay, Proper, NW0, N1
<s(+(x',y')),+(y',s(x'))>   =>  Not trivial, Overlay, Proper, NW0, N2
<s(+(x',s(y))),s(+(s(x'),y))>   =>  Not trivial, Overlay, Proper, NW0, N3

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



The problem is decomposed in 3 subproblems.

Problem 1.1: 
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
Confluence Problem:
(VAR x y x' y')
(REPLACEMENT-MAP
(+ 1, 2)
(fSNonEmpty)
(s 1)
)
(RULES
+(s(x),y) -> s(+(x,y))
+(x,s(y)) -> s(+(x,y))
+(x,y) -> +(y,x)
)
Critical Pairs:
<s(+(x',y')),+(s(y'),x')>   =>  Not trivial, Overlay, Proper, NW0, N1
Linear:YES
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

Strong Confluence Procedure:
-> Rewritings:
s: s(+(x',y'))
Nodes: [0,1]
Edges: [(0,1),(1,0)]
ID: 0 => ('s(+(x',y'))', D0)
ID: 1 => ('s(+(y',x'))', D1, R3, P[1], S{x10 -> x', x11 -> y'}), NR: '+(y',x')'
t: +(s(y'),x')
Nodes: [0,1,2,3]
Edges: [(0,1),(0,2),(1,3),(2,0),(2,3),(3,1)]
ID: 0 => ('+(s(y'),x')', D0)
ID: 1 => ('s(+(y',x'))', D1, R1, P[], S{x6 -> y', x7 -> x'}), NR: 's(+(y',x'))'
ID: 2 => ('+(x',s(y'))', D1, R3, P[], S{x10 -> s(y'), x11 -> x'}), NR: '+(x',s(y'))'
ID: 3 => ('s(+(x',y'))', D2, R3, P[1], S{x10 -> y', x11 -> x'}), NR: '+(x',y')'
SNodesPath1: s(+(x',y'))
TNodesPath1: +(s(y'),x') -> s(+(y',x')) -> s(+(x',y'))
SNodesPath2: s(+(x',y')) -> s(+(y',x'))
TNodesPath2: +(s(y'),x') -> s(+(y',x'))
s(+(x',y')) ->= s(+(x',y')) *<- +(s(y'),x')
+(s(y'),x') ->= s(+(y',x')) *<- s(+(x',y'))
"Strongly closed critical pair"

The problem is confluent.

Problem 1.2: 
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
Confluence Problem:
(VAR x y x' y')
(REPLACEMENT-MAP
(+ 1, 2)
(fSNonEmpty)
(s 1)
)
(RULES
+(s(x),y) -> s(+(x,y))
+(x,s(y)) -> s(+(x,y))
+(x,y) -> +(y,x)
)
Critical Pairs:
<s(+(x',y')),+(y',s(x'))>   =>  Not trivial, Overlay, Proper, NW0, N2
Linear:YES
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

Strong Confluence Procedure:
-> Rewritings:
s: s(+(x',y'))
Nodes: [0,1]
Edges: [(0,1),(1,0)]
ID: 0 => ('s(+(x',y'))', D0)
ID: 1 => ('s(+(y',x'))', D1, R3, P[1], S{x10 -> x', x11 -> y'}), NR: '+(y',x')'
t: +(y',s(x'))
Nodes: [0,1,2,3]
Edges: [(0,1),(0,2),(1,3),(2,0),(2,3),(3,1)]
ID: 0 => ('+(y',s(x'))', D0)
ID: 1 => ('s(+(y',x'))', D1, R2, P[], S{x8 -> y', x9 -> x'}), NR: 's(+(y',x'))'
ID: 2 => ('+(s(x'),y')', D1, R3, P[], S{x10 -> y', x11 -> s(x')}), NR: '+(s(x'),y')'
ID: 3 => ('s(+(x',y'))', D2, R3, P[1], S{x10 -> y', x11 -> x'}), NR: '+(x',y')'
SNodesPath1: s(+(x',y'))
TNodesPath1: +(y',s(x')) -> s(+(y',x')) -> s(+(x',y'))
SNodesPath2: s(+(x',y')) -> s(+(y',x'))
TNodesPath2: +(y',s(x')) -> s(+(y',x'))
s(+(x',y')) ->= s(+(x',y')) *<- +(y',s(x'))
+(y',s(x')) ->= s(+(y',x')) *<- s(+(x',y'))
"Strongly closed critical pair"

The problem is confluent.

Problem 1.3: 
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
Confluence Problem:
(VAR x y x' y')
(REPLACEMENT-MAP
(+ 1, 2)
(fSNonEmpty)
(s 1)
)
(RULES
+(s(x),y) -> s(+(x,y))
+(x,s(y)) -> s(+(x,y))
+(x,y) -> +(y,x)
)
Critical Pairs:
<s(+(x',s(y))),s(+(s(x'),y))>   =>  Not trivial, Overlay, Proper, NW0, N3
Linear:YES
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

Strong Confluence Procedure:
-> Rewritings:
s: s(+(x',s(y)))
Nodes: [0,1,2,3]
Edges: [(0,1),(0,2),(1,3),(2,0),(2,3),(3,1)]
ID: 0 => ('s(+(x',s(y)))', D0)
ID: 1 => ('s(s(+(x',y)))', D1, R2, P[1], S{x8 -> x', x9 -> y}), NR: 's(+(x',y))'
ID: 2 => ('s(+(s(y),x'))', D1, R3, P[1], S{x10 -> x', x11 -> s(y)}), NR: '+(s(y),x')'
ID: 3 => ('s(s(+(y,x')))', D2, R3, P[1, 1], S{x10 -> x', x11 -> y}), NR: '+(y,x')'
t: s(+(s(x'),y))
Nodes: [0,1,2,3]
Edges: [(0,1),(0,2),(1,3),(2,0),(2,3),(3,1)]
ID: 0 => ('s(+(s(x'),y))', D0)
ID: 1 => ('s(s(+(x',y)))', D1, R1, P[1], S{x6 -> x', x7 -> y}), NR: 's(+(x',y))'
ID: 2 => ('s(+(y,s(x')))', D1, R3, P[1], S{x10 -> s(x'), x11 -> y}), NR: '+(y,s(x'))'
ID: 3 => ('s(s(+(y,x')))', D2, R3, P[1, 1], S{x10 -> x', x11 -> y}), NR: '+(y,x')'
SNodesPath1: s(+(x',s(y))) -> s(s(+(x',y)))
TNodesPath1: s(+(s(x'),y)) -> s(s(+(x',y)))
SNodesPath2: s(+(x',s(y))) -> s(s(+(x',y)))
TNodesPath2: s(+(s(x'),y)) -> s(s(+(x',y)))
s(+(x',s(y))) ->= s(s(+(x',y))) *<- s(+(s(x'),y))
s(+(s(x'),y)) ->= s(s(+(x',y))) *<- s(+(x',s(y)))
"Strongly closed critical pair"

The problem is confluent.