YES
Input:
   [ f(g(h(a)),?y) -> ?y ]

Make it flat:
   [ f(!cl_1,?y) -> ?y,
     g(!cl_0) -> !cl_1,
     h(a) -> !cl_0 ]
Time: 0.000 [s]

Make it Complete (R^):
   [ f(!cl_1,!cl_0) = !cl_0,
     h(a) = f(!cl_1,!cl_0),
     f(!cl_1,!cl_1) = !cl_1,
     g(!cl_0) = f(!cl_1,!cl_1),
     f(!cl_1,?y) = ?y,
     g(!cl_0) = !cl_1,
     h(a) = !cl_0 ]
Time: 0.001 [s]

CPNF:
   [ !cl_1 … !cl_1,
     a … a,
     !cl_0 … !cl_0 ]
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.001 [s]

problems/r7.trs: Success(UNC)
real 0.04
user 0.01
sys 0.01