0.00/0.22	MAYBE
0.00/0.22	Input TRS:
0.00/0.22	    1: b(q(b(x1))) -> b(p(b(x1)))
0.00/0.22	    2: 0(p(0(x1))) ->= q(x1)
0.00/0.22	    3: 1(p(1(x1))) ->= q(x1)
0.00/0.22	    4: 0(q(0(x1))) ->= q(x1)
0.00/0.22	    5: 1(q(1(x1))) ->= q(x1)
0.00/0.22	    6: p(x1) ->= 1(p(1(0(1(x1)))))
0.00/0.22	Number of strict rules: 1
0.00/0.22	Direct POLO(bPol) ... failed.
0.00/0.22	Uncurrying ... failed.
0.00/0.22	Dependency Pairs:
0.00/0.22	   #1: #b(q(b(x1))) -> #b(p(b(x1)))
0.00/0.22	Number of SCCs: 1, DPs: 1
0.00/0.22	  SCC { #1 }
0.00/0.22	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.22	Finding a loop...  failed.
0.00/0.22	EOF