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