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