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:
   [ f(f(f(f(a)))) -> a,
     c -> h(f(f(c)),f(f(h(f(f(a)),h(h(b,h(c,c)),f(c)))))),
     f(a) -> c,
     b -> f(a),
     f(a) -> f(c) ]
Apply Direct Methods...
Inner CPs:
   [ f(f(f(c))) = a,
     f(f(f(f(c)))) = a ]
Outer CPs:
   [ c = f(c) ]
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:
   [ f(f(f(c))) = a,
     f(f(f(f(c)))) = a,
     f(c) = c,
     a = f(f(f(c))),
     c = f(c),
     a = f(f(f(f(c)))) ]
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(f(f(c))), a> by Rules <2, 0> preceded by [(f,1),(f,1),(f,1)]
unknown Diagram Decreasing
check Non-Confluence...
obtain 11 rules by 3 steps unfolding
obtain 100 candidates for checking non-joinability
check by TCAP-Approximation (success)
Witness for Non-Confluence: <f(f(f(h(f(f(c)),f(f(h(f(c),h(h(b,h(c,c)),f(c))))))))) <- f(f(f(b))) -> a>
Direct Methods: not CR

Combined result: not CR
658.trs: Success(not CR)
(462 msec.)