(ignored inputs)COMMENT Cops #647 - #721: generated ground TRSs; evenly distributed in the UNR/UNC/NFP/CR hierarchy submitted by: Bertram Felgenhauer
Rewrite Rules:
   [ b -> a,
     b -> c,
     b -> h(h(c,a),f(f(b))),
     a -> f(a),
     b -> h(a,a) ]
Apply Direct Methods...
Inner CPs:
   [  ]
Outer CPs:
   [ a = c,
     a = h(h(c,a),f(f(b))),
     a = h(a,a),
     c = h(h(c,a),f(f(b))),
     c = h(a,a),
     h(h(c,a),f(f(b))) = h(a,a) ]
Overlay, check Innermost Termination...
unknown Innermost 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:
   [ c = a,
     h(h(c,a),f(f(b))) = a,
     h(a,a) = a,
     a = c,
     h(h(c,a),f(f(b))) = c,
     h(a,a) = c,
     a = h(h(c,a),f(f(b))),
     c = h(h(c,a),f(f(b))),
     h(a,a) = h(h(c,a),f(f(b))),
     a = h(a,a),
     c = h(a,a),
     h(h(c,a),f(f(b))) = h(a,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 <c, a> by Rules <1, 0> preceded by []
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(a) <- b -> c>
Direct Methods: not CR

Combined result: not CR
678.trs: Success(not CR)
NO
(3 msec.)