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

Combined result: not CR
694.trs: Success(not CR)
(33 msec.)