YES
(ignored inputs)COMMENT from experiments for [44] submitted by: Tsubasa Suzuki , Takahito Aoto , and Yoshihito Toyama
input TRS:
   [ a -> h(c),
     a -> h(f(c)),
     g(?x) -> g(?x),
     h(f(?x)) -> h(f(g(?x))) ]
TRS:
   [ a -> h(c),
     a -> h(f(c)),
     g(?x) -> g(?x),
     h(f(?x)) -> h(f(g(?x))) ]
New rules by rule reversing:
   [ a -> h(c),
     h(f(c)) -> a,
     g(?x) -> g(?x),
     h(f(?x)) -> h(f(?x)),
     h(f(g(?x))) -> h(f(?x)) ]
confluent TRS:
   [ a -> h(c),
     h(f(c)) -> a,
     g(?x) -> g(?x),
     h(f(?x)) -> h(f(?x)),
     h(f(g(?x))) -> h(f(?x)) ]
UNC Completion (Development Closed)
problems/242.trs: Success(UNC)
(0 msec.)