YES
*** Computating Strongly Quasi-Reducible Parts ***
TRS:
   [ +(0,?y) -> ?y,
     +(s(?x),?y) -> s(+(?x,?y)),
     s(s(?x)) -> ?x ]
Constructors: {0,s}
Defined function symbols: {+}
Constructor subsystem:
   [ s(s(?x)) -> ?x ]
Rule part & Conj Part:
   [ s(s(?x)) -> ?x,
     +(0,?y) -> ?y,
     +(s(?x),?y) -> s(+(?x,?y)) ]
   [ ]
*** Ground Confluence Check by Rewriting Induction ***
Sort: {Nat}
Signature:
   [ + : Nat,Nat -> Nat,
     s : Nat -> Nat,
     0 : Nat ]
Rule Part:
   [ s(s(?x)) -> ?x,
     +(0,?y) -> ?y,
     +(s(?x),?y) -> s(+(?x,?y)) ]
Conjecture Part:
   [ ]
Precedence (by weight): {(+,3),(0,2),(s,0)}
Rule part is confluent.
R0 is ground confluent.
Conjucture part is empty.
examples/additions/plus3.trs: Success(GCR)
(5 msec.)