YES
*** Computating Strongly Quasi-Reducible Parts ***
TRS:
   [ s(p(?x)) -> ?x,
     p(s(?x)) -> ?x ]
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 ]
   [ ]
*** Ground Confluence Check by Rewriting Induction ***
Sort: {Int}
Signature:
   [ s : Int -> Int,
     p : Int -> Int,
     0 : Int ]
Rule Part:
   [ s(p(?x)) -> ?x,
     p(s(?x)) -> ?x ]
Conjecture Part:
   [ ]
Precedence (by weight): {(p,1),(s,0)}
Rule part is confluent.
R0 is ground confluent.
Conjucture part is empty.
examples/additions/int1.trs: Success(GCR)
(6 msec.)