YES
af/ONE-SORTED/111.trs
Input rules:
   [ a -> b,
     a -> c,
     a -> e,
     b -> d,
     c -> a,
     d -> a,
     d -> e,
     g(?x:o) -> h(a),
     h(?x:o) -> e ]
Sorts having no ground terms: 
Rules applicable to ground terms:
   [ a -> b,
     a -> c,
     a -> e,
     b -> d,
     c -> a,
     d -> a,
     d -> e,
     g(?x:o) -> h(a),
     h(?x:o) -> e ]
Constructor pattern: [e]
Defined pattern: [h(?x_1),g(?x_1),d,c,b,a]
Constructor subsystem:
   [ ]
Modified Constructor subsystem:
   [ ]
candidate for h(?x_1):
   [ h(?x) -> e ]
candidate for g(?x_1):
   [ g(?x) -> h(a) ]
candidate for d:
   [ d -> a ]
   [ d -> e ]
candidate for c:
   [ c -> a ]
candidate for b:
   [ b -> d ]
candidate for a:
   [ a -> b ]
   [ a -> c ]
   [ a -> e ]
Find a quasi-ordering ...
order successfully found
Precedence:
 c : Mul;
 g : Mul;
 b : Mul,  a : Mul;
 d : Mul;
 h : Mul;
 e : Mul;
Rules:
   [ h(?x) -> e,
     g(?x) -> h(a),
     d -> e,
     c -> a,
     b -> d,
     a -> e ]
Conjectures:
   [ a = b,
     a = c,
     d = a ]
STEP 0
ES:
   [ a = b,
     a = c,
     d = a ]
HS:
   [ ]
ES0:
   [ e = e,
     e = e,
     e = e ]
HS0:
   [ ]
ES1:
   [ ]
HS1:
   [ ]
: Success(GCR)
(5 msec.)
0.02