(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(b),
     f(a) -> f(h(h(h(h(c,b),a),f(c)),c)),
     c -> h(f(c),f(h(c,a))),
     c -> f(b) ]
Apply Direct Methods...
Inner CPs:
   [  ]
Outer CPs:
   [ h(f(c),f(h(c,a))) = f(b) ]
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:
   [ f(b) = h(f(c),f(h(c,a))),
     h(f(c),f(h(c,a))) = f(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 <f(b), h(f(c),f(h(c,a)))> by Rules <3, 2> preceded by []
unknown Diagram Decreasing
check Non-Confluence...
obtain 12 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: <h(f(c),f(h(c,a))) <- c -> f(b)>
Direct Methods: not CR

Combined result: not CR
660.trs: Success(not CR)
NO
(441 msec.)