0.00/0.05	MAYBE
0.00/0.05	Input TRS:
0.00/0.05	    1: T(I(x),y) -> T(x,y)
0.00/0.05	    2: T(x,y) ->= T(x,I(y))
0.00/0.05	Number of strict rules: 1
0.00/0.05	Direct POLO(bPol) ... failed.
0.00/0.05	Uncurrying ... failed.
0.00/0.05	Dependency Pairs:
0.00/0.05	   #1: #T(x,y) ->? #T(x,I(y))
0.00/0.05	   #2: #T(I(x),y) -> #T(x,y)
0.00/0.05	Number of SCCs: 1, DPs: 2
0.00/0.05	  SCC { #1 #2 }
0.00/0.05	POLO(Sum)... succeeded.
0.00/0.05	      #T 	w: x1
0.00/0.05	      T 	w: 0
0.00/0.05	      I 	w: x1 + 1
0.00/0.05	    USABLE RULES: { }
0.00/0.05	    Removed DPs: #2
0.00/0.05	Number of SCCs: 1, DPs: 1
0.00/0.05	  SCC { #1 }
0.00/0.05	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.05	Finding a loop...  failed.
0.00/0.05	EOF