0.00/0.08	NO
0.00/0.09	Input TRS:
0.00/0.09	    1: f(s(x),y) -> f(-(s(x),y),y)
0.00/0.09	    2: +(0(),y) ->= y
0.00/0.09	    3: +(s(x),y) ->= s(+(x,y))
0.00/0.09	    4: -(x,0()) ->= x
0.00/0.09	    5: -(0(),y) ->= 0()
0.00/0.09	    6: -(s(x),s(y)) ->= -(x,y)
0.00/0.09	    7: f(x,y) ->= f(x,+(x,y))
0.00/0.09	Number of strict rules: 1
0.00/0.09	Direct POLO(bPol) ... failed.
0.00/0.09	Uncurrying ... failed.
0.00/0.09	Dependency Pairs:
0.00/0.09	   #1: #f(x,y) ->? #f(x,+(x,y))
0.00/0.09	   #2: #f(s(x),y) -> #f(-(s(x),y),y)
0.00/0.09	Number of SCCs: 1, DPs: 2
0.00/0.09	  SCC { #1 #2 }
0.00/0.09	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.09	Finding a loop...  found duplicating loop.
0.00/0.09	  #f(x_{1},y)	-#1->
0.00/0.09	  #f(x_{1},+(x_{1},y))	--->*
0.00/0.09	  #f(x_{1},+(x_{1},y))
0.00/0.09	  Looping with: [ y := +(x_{1},y); x_{1} := x_{1}; ]
0.00/0.09	EOF