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