MAYBE
(ignored inputs)COMMENT translated from Cops 174
*** Computating Strongly Quasi-Reducible Parts ***
TRS:
   [ +(?x,0) -> ?x,
     +(s(?x),?y) -> s(+(?y,?x)),
     +(+(?x,?y),?z) -> +(?x,+(?y,?z)),
     +(?x,?y) -> +(?y,?x) ]
Constructors: {+,0,s}
Defined function symbols: {}
Constructor subsystem:
   [ +(?x,0) -> ?x,
     +(s(?x),?y) -> s(+(?y,?x)),
     +(+(?x,?y),?z) -> +(?x,+(?y,?z)) ]
Rule part & Conj Part:
   [ +(?x,0) -> ?x,
     +(s(?x),?y) -> s(+(?y,?x)),
     +(+(?x,?y),?z) -> +(?x,+(?y,?z)) ]
   [ +(?x,?y) -> +(?y,?x) ]
*** Ground Confluence Check by Rewriting Induction ***
Sort: {Nat}
Signature:
   [ + : Nat,Nat -> Nat,
     0 : Nat,
     s : Nat -> Nat ]
Rule Part:
   [ +(?x,0) -> ?x,
     +(s(?x),?y) -> s(+(?y,?x)),
     +(+(?x,?y),?z) -> +(?x,+(?y,?z)) ]
Conjecture Part:
   [ +(?x,?y) = +(?y,?x) ]
Termination proof failed.
examples/fromCops/cr/174.trs: Failure(unknown)
(10 msec.)