YES
(ignored inputs)COMMENT doi:10.1007/978-3-642-40885-4_22 [44] Example 9 submitted by: Tsubasa Suzuki , Takahito Aoto , and Yoshihito Toyama
input TRS:
   [ a -> f(c),
     a -> h(c),
     f(?x) -> h(g(?x)),
     h(?x) -> f(g(?x)) ]
TRS:
   [ a -> f(c),
     a -> h(c),
     f(?x) -> h(g(?x)),
     h(?x) -> f(g(?x)) ]
New rules by rule reversing:
   [ a -> a,
     f(c) -> a,
     a -> a,
     h(c) -> a,
     f(?x) -> f(?x),
     h(g(?x)) -> f(?x),
     h(?x) -> h(?x),
     f(g(?x)) -> h(?x) ]
confluent TRS:
   [ a -> a,
     f(c) -> a,
     a -> a,
     h(c) -> a,
     f(?x) -> f(?x),
     h(g(?x)) -> f(?x),
     h(?x) -> h(?x),
     f(g(?x)) -> h(?x) ]
UNC Completion (Strongly Closed)
problems/247.trs: Success(UNC)
(0 msec.)