NO
af/ONE-SORTED/225.trs
Input rules:
   [ f(a) -> b,
     a -> a',
     f(b) -> c ]
Sorts having no ground terms: 
Rules applicable to ground terms:
   [ f(a) -> b,
     a -> a',
     f(b) -> c ]
Constructor pattern: [f(?x_1),b,a',c]
Defined pattern: [a]
Constructor subsystem:
   [ f(b) -> c ]
Modified Constructor subsystem:
   [ f(b) -> c ]
candidate for a:
   [ a -> a' ]
Find a quasi-ordering ...
order successfully found
Precedence:
 f : Mul;
 a : Mul;
 a' : Mul;
 c : Mul,  b : Mul;
Rules:
   [ a -> a',
     f(b) -> c ]
Check confluence of constructor subsystem...
Check Termination...
Terminating, WCR: CR
Conjectures:
   [ f(a) = b ]
STEP 0
ES:
   [ f(a) = b ]
HS:
   [ ]
ES0:
   [ f(a') = b ]
HS0:
   [ ]
ES1:
   [ f(a') = b ]
HS1:
   [ ]
No equation to expand
check Non-Ground-Confluence...
ground constructor terms for instantiation: {b,a',c,f(b),f(a'),f(c)}
ground terms for instantiation: {b:o,a':o,c:o,f(b):o,f(a'):o,f(c):o}
obtain 4 rules by 3 steps unfolding
obtain 3 candidates for checking non-joinability
check by TCAP-Approximation (success)
Witness for Non-Confluence: <f(a') <- f(a) -> b>
: Success(not GCR)
(3 msec.)
0.02