NO
(ignored inputs)COMMENT from experiments for [44] submitted by: Tsubasa Suzuki , Takahito Aoto , and Yoshihito Toyama
Rewrite Rules:
   [ a -> h(g(b)),
     a -> h(c),
     b -> g(b),
     h(g(?x)) -> g(h(?x)),
     g(?x) -> h(?x) ]
Apply Direct Methods...
Inner CPs:
   [ h(h(?x_1)) = g(h(?x_1)) ]
Outer CPs:
   [ h(g(b)) = h(c) ]
not Overlay, check Termination...
unknown/not 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:
   [ h(c) = h(g(b)),
     h(g(b)) = h(c),
     h(h(?x)) = g(h(?x)),
     g(h(?x)) = h(h(?x)) ]
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(?x_1)), g(h(?x_1))> by Rules <4, 3> preceded by [(h,1)]
 joinable by a reduction of rules <[], [([],4)]>
Critical Pair <h(c), h(g(b))> by Rules <1, 0> 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: <g(h(b)) <- a -> h(c)>
Direct Methods: not CR

Combined result: not CR
243.trs: Success(not CR)
(57 msec.)