MAYBE
(ignored inputs)COMMENT translated from Cops 6
*** Computating Strongly Quasi-Reducible Parts ***
TRS:
   [ f(f(?x,?y),?z) -> f(?x,f(?y,?z)),
     f(i(?x1),?x1) -> e ]
Constructors: {e,f,i}
Defined function symbols: {}
Constructor subsystem:
   [ f(f(?x,?y),?z) -> f(?x,f(?y,?z)),
     f(i(?x1),?x1) -> e ]
Rule part & Conj Part:
   [ f(f(?x,?y),?z) -> f(?x,f(?y,?z)),
     f(i(?x1),?x1) -> e ]
   [ ]
*** Ground Confluence Check by Rewriting Induction ***
Sort: {Elem}
Signature:
   [ e : Elem,
     f : Elem,Elem -> Elem,
     i : Elem -> Elem ]
Rule Part:
   [ f(f(?x,?y),?z) -> f(?x,f(?y,?z)),
     f(i(?x1),?x1) -> e ]
Conjecture Part:
   [ ]
Termination proof failed.
examples/fromCops/noncr/6.trs: Failure(unknown)
(6 msec.)