YES
(ignored inputs)COMMENT doi:10.1007/978-3-642-12251-4_20 [32] Example 3.2
Input:
   [ a -> b,
     a -> c,
     a -> e,
     b -> d,
     c -> a,
     d -> a,
     d -> e,
     g(?x) -> h(a),
     h(?x) -> e ]

Make it flat:
   [ a -> b,
     a -> c,
     a -> e,
     b -> d,
     c -> a,
     d -> a,
     d -> e,
     g(?x) -> h(a),
     h(?x) -> e ]
Time: 0.000 [s]

Make it Complete (R^):
   [ a = b,
     h(c) = g(?x),
     h(c) = h(?x_1),
     h(c) = e,
     h(c) = d,
     c = d,
     c = h(?x),
     h(c) = a,
     c = h(a),
     c = h(d),
     h(c) = h(d),
     h(c) = h(e),
     c = h(e),
     c = g(?x),
     h(c) = h(b),
     c = h(b),
     c = h(c),
     h(c) = b,
     h(c) = h(a),
     c = b,
     c = e,
     a = c,
     a = e,
     b = e,
     b = g(?x),
     b = h(a),
     b = h(?x),
     h(b) = a,
     h(b) = h(a),
     b = h(e),
     h(b) = h(e),
     b = h(d),
     b = h(b),
     h(b) = d,
     h(b) = e,
     h(b) = h(?x_1),
     h(b) = h(d),
     h(b) = g(?x),
     b = d,
     h(d) = g(?x),
     h(d) = h(?x_1),
     h(d) = e,
     h(d) = d,
     a = g(?x),
     h(e) = a,
     h(d) = h(e),
     h(e) = e,
     h(e) = h(?x_1),
     h(e) = g(?x_1),
     h(e) = d,
     h(e) = h(a),
     h(d) = h(a),
     h(d) = a,
     a = h(a),
     a = h(?x),
     d = a,
     d = h(?x),
     d = h(a),
     d = g(?x),
     d = e,
     g(?x) = e,
     h(a) = e,
     h(?x_1) = h(a),
     g(?x) = h(?x_1),
     g(?x) = g(?x_1),
     g(?x) = h(a),
     h(?x) = h(?x_1),
     h(?x) = e ]
Time: 0.053 [s]

CPNF:
   [ a … e ]
Time: 0.000 [s]

Now checking all the pairs in CW...

Time to check pairs: 0.000 [s]

The TRS has Uniqueness of Normal Forms.
Total Time: 0.054 [s]

problems/111.trs: Success(UNC)
real 0.07
user 0.06
sys 0.00