0.00/0.07	MAYBE
0.00/0.07	Input TRS:
0.00/0.07	    1: n(s(x1)) -> s(x1)
0.00/0.07	    2: o(s(x1)) -> s(x1)
0.00/0.07	    3: t(x1) ->= t(c(n(x1)))
0.00/0.07	    4: c(n(x1)) ->= n(c(x1))
0.00/0.07	    5: c(o(x1)) ->= o(c(x1))
0.00/0.07	    6: c(o(x1)) ->= o(x1)
0.00/0.07	Number of strict rules: 2
0.00/0.07	Direct POLO(bPol) ... removes: 2
0.00/0.07	      s 	w: x1 + 1
0.00/0.07	      n 	w: x1
0.00/0.07	      t 	w: x1
0.00/0.07	      c 	w: x1
0.00/0.07	      o 	w: x1 + 1
0.00/0.07	Number of strict rules: 1
0.00/0.07	Direct POLO(bPol) ... failed.
0.00/0.07	Uncurrying ... failed.
0.00/0.07	Dependency Pairs:
0.00/0.07	   #1: #c(o(x1)) ->? #c(x1)
0.00/0.07	   #2: #t(x1) ->? #t(c(n(x1)))
0.00/0.07	   #3: #t(x1) ->? #c(n(x1))
0.00/0.07	   #4: #t(x1) ->? #n(x1)
0.00/0.07	   #5: #c(n(x1)) ->? #n(c(x1))
0.00/0.07	   #6: #c(n(x1)) ->? #c(x1)
0.00/0.07	Number of SCCs: 2, DPs: 3
0.00/0.07	  SCC { #2 }
0.00/0.07	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.07	Finding a loop...  failed.
0.00/0.07	EOF