MAYBE
(ignored inputs)COMMENT translated from Cops 140
*** Computating Strongly Quasi-Reducible Parts ***
TRS:
   [ +(0,?y) -> ?y,
     +(?x,s(?y)) -> s(+(?y,?x)),
     +(+(?x,?y),?z) -> +(?x,+(?y,?z)),
     +(?x,?y) -> +(?y,?x) ]
Constructors: {+,0,s}
Defined function symbols: {}
Constructor subsystem:
   [ +(0,?y) -> ?y,
     +(?x,s(?y)) -> s(+(?y,?x)),
     +(+(?x,?y),?z) -> +(?x,+(?y,?z)) ]
Rule part & Conj Part:
   [ +(0,?y) -> ?y,
     +(?x,s(?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:
   [ +(0,?y) -> ?y,
     +(?x,s(?y)) -> s(+(?y,?x)),
     +(+(?x,?y),?z) -> +(?x,+(?y,?z)) ]
Conjecture Part:
   [ +(?x,?y) = +(?y,?x) ]
Termination proof failed.
examples/fromCops/cr/140.trs: Failure(unknown)
(6 msec.)