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