NO
af/ONE-SORTED/679.trs
Input rules:
   [ f(a) -> c,
     b -> c,
     b -> a ]
Sorts having no ground terms: 
Rules applicable to ground terms:
   [ f(a) -> c,
     b -> c,
     b -> a ]
Constructor pattern: [f(?x_1),a,c]
Defined pattern: [b]
Constructor subsystem:
   [ f(a) -> c ]
Modified Constructor subsystem:
   [ f(a) -> c ]
candidate for b:
   [ b -> c ]
   [ b -> a ]
Find a quasi-ordering ...
order successfully found
Precedence:
 b : Mul;
 c : Mul,  a : Mul;
 f : Mul;
Rules:
   [ b -> c,
     f(a) -> c ]
Check confluence of constructor subsystem...
Check Termination...
Terminating, WCR: CR
Conjectures:
   [ b = a ]
STEP 0
ES:
   [ b = a ]
HS:
   [ ]
ES0:
   [ c = a ]
HS0:
   [ ]
ES1:
   [ c = a ]
HS1:
   [ ]
: Success(not GCR)
(3 msec.)
0.02