NO
(ignored inputs)COMMENT Cops #647 - #721: generated ground TRSs; evenly distributed in the UNR/UNC/NFP/CR hierarchy submitted by: Bertram Felgenhauer
Rewrite Rules:
   [ h(a,a) -> c,
     b -> h(b,a),
     b -> a,
     f(c) -> c,
     c -> a ]
Apply Direct Methods...
Inner CPs:
   [ f(a) = c ]
Outer CPs:
   [ h(b,a) = a ]
not Overlay, check Termination...
unknown/not Terminating
unknown Knuth & Bendix
Linear
unknown Development Closed
unknown Strongly Closed
unknown Weakly-Non-Overlapping & Non-Collapsing & Shallow
unknown Upside-Parallel-Closed/Outside-Closed
(inner) Parallel CPs: (not computed)
unknown Toyama (Parallel CPs)
Simultaneous CPs:
   [ a = h(b,a),
     h(b,a) = a,
     f(a) = c,
     c = f(a) ]
unknown Okui (Simultaneous CPs)
unknown Strongly Depth-Preserving & Root-E-Closed/Non-E-Overlapping
unknown Strongly Weight-Preserving & Root-E-Closed/Non-E-Overlapping
check Locally Decreasing Diagrams by Rule Labelling...
Critical Pair <f(a), c> by Rules <4, 3> preceded by [(f,1)]
unknown Diagram Decreasing
check Non-Confluence...
obtain 11 rules by 3 steps unfolding
obtain 51 candidates for checking non-joinability
check by TCAP-Approximation (success)
 (failure)
check by Ordering(rpo), check by Tree-Automata Approximation (success)
Witness for Non-Confluence: <f(a) <- f(b) -> a>
Direct Methods: not CR

Combined result: not CR
695.trs: Success(not CR)
(12 msec.)