NO
(ignored inputs)COMMENT [120] Example 3 submitted by: Aart Middeldorp
input TRS:
   [ g(?x) -> h(k(?x)),
     g(?x) -> ?x,
     h(k(?x)) -> f(?x),
     f(?x) -> ?x,
     k(c) -> c,
     f(c) -> g(c) ]
TRS:
   [ g(?x) -> h(k(?x)),
     g(?x) -> ?x,
     h(k(?x)) -> f(?x),
     f(?x) -> ?x,
     k(c) -> c,
     f(c) -> g(c) ]
New rules by rule reversing:
   [ h(k(?x)) -> g(?x),
     g(?x) -> ?x,
     h(k(?x)) -> f(?x),
     f(?x) -> ?x,
     k(c) -> c,
     f(c) -> g(c) ]
constructed TRS:
   [ h(k(?x)) -> g(?x),
     g(?x) -> ?x,
     h(k(?x)) -> f(?x),
     f(?x) -> ?x,
     k(c) -> c,
     f(c) -> g(c),
     g(c) -> h(c),
     f(c) -> h(c) ]
convertible distinct normal forms: h(c) = c
UNC Completion (Strongly Closed)
problems/544.trs: Success(not UNC)
(0 msec.)