0.00/0.28	MAYBE
0.00/0.29	Input TRS:
0.00/0.29	    1: le(0(),y) -> true()
0.00/0.29	    2: le(s(x),0()) -> false()
0.00/0.29	    3: le(s(x),s(y)) -> le(x,y)
0.00/0.29	    4: pred(s(x)) -> x
0.00/0.29	    5: minus(x,0()) -> x
0.00/0.29	    6: minus(x,s(y)) -> pred(minus(x,y))
0.00/0.29	    7: gcd(0(),y) -> y
0.00/0.29	    8: gcd(s(x),0()) -> s(x)
0.00/0.29	    9: gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y))
0.00/0.29	    10: if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y))
0.00/0.29	    11: if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x))
0.00/0.29	    12: rand(x) ->= x
0.00/0.29	    13: rand(x) ->= rand(s(x))
0.00/0.29	Number of strict rules: 11
0.00/0.29	Direct POLO(bPol) ... failed.
0.00/0.29	Uncurrying ... failed.
0.00/0.29	Dependency Pairs:
0.00/0.29	   #1: #minus(x,s(y)) -> #pred(minus(x,y))
0.00/0.29	   #2: #minus(x,s(y)) -> #minus(x,y)
0.00/0.29	   #3: #gcd(s(x),s(y)) -> #if_gcd(le(y,x),s(x),s(y))
0.00/0.29	   #4: #gcd(s(x),s(y)) -> #le(y,x)
0.00/0.29	   #5: #if_gcd(false(),s(x),s(y)) -> #gcd(minus(y,x),s(x))
0.00/0.29	   #6: #if_gcd(false(),s(x),s(y)) -> #minus(y,x)
0.00/0.29	   #7: #if_gcd(true(),s(x),s(y)) -> #gcd(minus(x,y),s(y))
0.00/0.29	   #8: #if_gcd(true(),s(x),s(y)) -> #minus(x,y)
0.00/0.29	   #9: #le(s(x),s(y)) -> #le(x,y)
0.00/0.29	Number of SCCs: 3, DPs: 5
0.00/0.29	  SCC { #2 }
0.00/0.29	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
0.00/0.29	      le	s: []	p: 0	w: 0
0.00/0.29	      s 	s: [1]	p: 1	w: x1
0.00/0.29	      #le	s: []	p: 0	w: max(x1 + 1)
0.00/0.29	      minus	s: 1
0.00/0.29	      gcd	s: []	p: 2	w: max(x1 + 1, x2 + 1)
0.00/0.29	      false	s: []	p: 0	w: 0
0.00/0.29	      true	s: []	p: 0	w: 0
0.00/0.29	      pred	s: 1
0.00/0.29	      rand	s: []	p: 0	w: x1 + 1
0.00/0.29	      0 	s: []	p: 0	w: 1
0.00/0.29	      #minus	s: [2]	p: 2	w: max(x1 + 2, x2 + 1)
0.00/0.29	      #pred	s: []	p: 0	w: 1
0.00/0.29	      if_gcd	s: []	p: 2	w: max(x1 + 1, x2 + 1, x3 + 1)
0.00/0.29	      #if_gcd	s: [1,3]	p: 0	w: max(x1, x3 + 1)
0.00/0.29	      #gcd	s: []	p: 0	w: max(x2)
0.00/0.29	    Removed DPs: #2
0.00/0.29	Number of SCCs: 2, DPs: 4
0.00/0.29	  SCC { #9 }
0.00/0.29	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
0.00/0.29	      le	s: []	p: 0	w: 0
0.00/0.29	      s 	s: [1]	p: 1	w: x1
0.00/0.29	      #le	s: [1]	p: 2	w: max(x1 + 1)
0.00/0.29	      minus	s: 1
0.00/0.29	      gcd	s: []	p: 2	w: max(x1 + 1, x2 + 1)
0.00/0.29	      false	s: []	p: 0	w: 0
0.00/0.29	      true	s: []	p: 0	w: 0
0.00/0.29	      pred	s: 1
0.00/0.29	      rand	s: []	p: 0	w: x1 + 1
0.00/0.29	      0 	s: []	p: 0	w: 1
0.00/0.29	      #minus	s: [2]	p: 2	w: max(x1 + 2, x2 + 1)
0.00/0.29	      #pred	s: []	p: 0	w: 1
0.00/0.29	      if_gcd	s: []	p: 2	w: max(x1 + 1, x2 + 1, x3 + 1)
0.00/0.29	      #if_gcd	s: [1,3]	p: 0	w: max(x1, x3 + 1)
0.00/0.29	      #gcd	s: []	p: 0	w: max(x2)
0.00/0.29	    Removed DPs: #9
0.00/0.29	Number of SCCs: 1, DPs: 3
0.00/0.29	  SCC { #3 #5 #7 }
0.00/0.29	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.29	Finding a loop...  failed.
0.00/0.29	EOF