0.00/0.12	MAYBE
0.00/0.12	Input TRS:
0.00/0.12	    1: a(b(a(x1))) -> a(b(b(a(x1))))
0.00/0.12	    2: b(a(b(x1))) -> b(a(a(b(x1))))
0.00/0.12	    3: a(x1) ->= a(a(a(x1)))
0.00/0.12	    4: b(x1) ->= b(b(b(x1)))
0.00/0.12	Number of strict rules: 2
0.00/0.12	Direct POLO(bPol) ... failed.
0.00/0.12	Uncurrying ... failed.
0.00/0.12	Dependency Pairs:
0.00/0.12	   #1: #b(a(b(x1))) -> #b(a(a(b(x1))))
0.00/0.12	   #2: #b(a(b(x1))) -> #a(a(b(x1)))
0.00/0.12	   #3: #a(x1) ->? #a(a(a(x1)))
0.00/0.12	   #4: #a(x1) ->? #a(a(x1))
0.00/0.12	   #5: #a(x1) ->? #a(x1)
0.00/0.12	   #6: #a(b(a(x1))) -> #a(b(b(a(x1))))
0.00/0.12	   #7: #a(b(a(x1))) -> #b(b(a(x1)))
0.00/0.12	   #8: #b(x1) ->? #b(b(b(x1)))
0.00/0.12	   #9: #b(x1) ->? #b(b(x1))
0.00/0.12	   #10: #b(x1) ->? #b(x1)
0.00/0.12	Number of SCCs: 1, DPs: 10
0.00/0.12	  SCC { #1..10 }
0.00/0.12	POLO(Sum)... succeeded.
0.00/0.12	      a 	w: 0
0.00/0.12	      b 	w: 2
0.00/0.12	      #a 	w: x1
0.00/0.12	      #b 	w: 1
0.00/0.12	    USABLE RULES: { 1..4 }
0.00/0.12	    Removed DPs: #2 #7
0.00/0.12	Number of SCCs: 2, DPs: 8
0.00/0.12	  SCC { #3..6 }
0.00/0.12	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
0.00/0.12	      a 	w: [0;1]
0.00/0.12	      b 	w: [0,1;1,0] * x1
0.00/0.12	      #a 	w: [1,0;0,0] * x1
0.00/0.12	      #b 	w: [0;0]
0.00/0.12	    USABLE RULES: { 1..4 }
0.00/0.12	    Removed DPs: #6
0.00/0.12	Number of SCCs: 2, DPs: 7
0.00/0.12	  SCC { #3..5 }
0.00/0.12	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.12	Finding a loop...  failed.
0.00/0.12	EOF