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