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: [ a -> c, f(f(c)) -> h(a,h(h(c,c),b)), f(f(a)) -> b, b -> f(f(b)) ] Apply Direct Methods... Inner CPs: [ f(f(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: [ b = f(f(c)), f(f(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 by Rules <0, 2> preceded by [(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 (failure) check by Ordering(rpo), check by Tree-Automata Approximation (success) Witness for Non-Confluence: b> Direct Methods: not CR Combined result: not CR 717.trs: Success(not CR) (37 msec.)