(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 -> f(h(f(f(b)),c)),
     h(h(c,c),b) -> c,
     h(f(a),b) -> b ]
Apply Direct Methods...
Inner CPs:
   [ h(h(c,c),f(h(f(f(b)),c))) = c,
     h(f(a),f(h(f(f(b)),c))) = b ]
Outer CPs:
   [  ]
not Overlay, check Termination...
unknown/not Terminating
unknown Knuth & Bendix
Linear
unknown Development Closed
unknown Strongly Closed
unknown Weakly-Non-Overlapping & Non-Collapsing & Shallow
inner CP cond (upside-parallel)
innter CP Cond (outside)
unknown Upside-Parallel-Closed/Outside-Closed
(inner) Parallel CPs: (not computed)
unknown Toyama (Parallel CPs)
Simultaneous CPs:
   [ c = h(h(c,c),f(h(f(f(b)),c))),
     b = h(f(a),f(h(f(f(b)),c))),
     h(h(c,c),f(h(f(f(b)),c))) = c,
     h(f(a),f(h(f(f(b)),c))) = b ]
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 <h(h(c,c),f(h(f(f(b)),c))), c> by Rules <0, 1> preceded by [(h,2)]
unknown Diagram Decreasing
check Non-Confluence...
obtain 10 rules by 3 steps unfolding
obtain 59 candidates for checking non-joinability
check by TCAP-Approximation (success)
Witness for Non-Confluence: <h(h(c,c),f(h(f(f(b)),c))) <- h(h(c,c),h(f(a),b)) -> c>
Direct Methods: not CR

Combined result: not CR
661.trs: Success(not CR)
NO
(8 msec.)