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