NO
(ignored inputs)COMMENT generated by FORT -f "a:0 b:0 f:2" -r 4 "UN & ~UNC & ~SN" submitted by: Franziska Rapp
Input:
   [ a -> a,
     a -> b,
     f(b,b) -> f(a,b),
     f(?x,a) -> f(a,b) ]

Make it flat:
   [ a -> a,
     a -> b,
     f(b,b) -> f(a,b),
     f(?x,a) -> f(a,b) ]
Time: 0.000 [s]

Make it Complete (R^):
   [ f(a,a) = f(?x,a),
     f(a,a) = f(b,b),
     f(b,a) = f(a,b),
     f(b,a) = f(?x_1,a),
     f(?x,b) = f(a,b),
     f(?x_1,b) = f(?x,a),
     f(a,a) = f(a,b),
     f(a,a) = f(b,a),
     f(a,a) = f(?x_1,b),
     f(b,a) = f(b,b),
     f(b,a) = f(?x_1,b),
     f(?x_1,b) = f(?x_3,b),
     f(?x_1,b) = f(b,b),
     a = b,
     f(b,b) = f(?x_1,a),
     f(b,b) = f(a,b),
     f(?x,a) = f(?x_1,a),
     f(?x,a) = f(a,b) ]
Time: 0.014 [s]

CPNF:
   [ a … b ]
Time: 0.000 [s]

Now checking all the pairs in CW...

Time to check pairs: 0.000 [s]

The TRS doesn't have Uniqueness of Normal Forms.
Counter Example: 
     f(?x_1,b)
<->* f(?x,b)

proof:
     f(?x_1,b)
->R^ f(?x_1,a)
->R^ f(?!,a)

     f(?x,b)
->R^ f(?x,a)
->R^ f(?!,a)
Total Time: 0.014 [s]

problems/731.trs: Success(not UNC)
real 0.04
user 0.02
sys 0.01