2.18/2.12	MAYBE
2.18/2.13	Input TRS:
2.18/2.13	    1: top(ok(left(car(x,y),z))) -> top(check(right(y,z)))
2.18/2.13	    2: top(ok(right(x,car(y,z)))) -> top(check(left(x,z)))
2.18/2.13	    3: top(ok(left(bot(),x))) -> top(check(right(bot(),x)))
2.18/2.13	    4: top(ok(right(x,bot()))) -> top(check(left(x,bot())))
2.18/2.13	    5: top(ok(left(car(x,y),z))) ->= top(check(left(y,z)))
2.18/2.13	    6: top(ok(right(x,car(y,z)))) ->= top(check(right(x,z)))
2.18/2.13	    7: bot() ->= car(new(),bot())
2.18/2.13	    8: check(old()) ->= ok(old())
2.18/2.13	    9: check(car(x,y)) ->= car(check(x),y)
2.18/2.13	    10: check(car(x,y)) ->= car(x,check(y))
2.18/2.13	    11: check(left(x,y)) ->= left(check(x),y)
2.18/2.13	    12: check(left(x,y)) ->= left(x,check(y))
2.18/2.13	    13: check(right(x,y)) ->= right(check(x),y)
2.18/2.13	    14: check(right(x,y)) ->= right(x,check(y))
2.18/2.13	    15: car(ok(x),y) ->= ok(car(x,y))
2.18/2.13	    16: car(x,ok(y)) ->= ok(car(x,y))
2.18/2.13	    17: left(ok(x),y) ->= ok(left(x,y))
2.18/2.13	    18: left(x,ok(y)) ->= ok(left(x,y))
2.18/2.13	    19: right(ok(x),y) ->= ok(right(x,y))
2.18/2.13	    20: right(x,ok(y)) ->= ok(right(x,y))
2.18/2.13	Number of strict rules: 4
2.18/2.13	Direct POLO(bPol) ... failed.
2.18/2.13	Uncurrying ... failed.
2.18/2.13	Dependency Pairs:
2.18/2.13	   #1: #top(ok(right(x,car(y,z)))) -> #top(check(left(x,z)))
2.18/2.13	   #2: #top(ok(right(x,car(y,z)))) ->? #top(check(right(x,z)))
2.18/2.13	   #3: #top(ok(left(car(x,y),z))) ->? #top(check(left(y,z)))
2.18/2.13	   #4: #top(ok(left(bot(),x))) -> #top(check(right(bot(),x)))
2.18/2.13	   #5: #top(ok(left(car(x,y),z))) -> #top(check(right(y,z)))
2.18/2.13	   #6: #top(ok(right(x,bot()))) -> #top(check(left(x,bot())))
2.18/2.13	Number of SCCs: 1, DPs: 6
2.18/2.13	  SCC { #1..6 }
2.18/2.13	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
2.18/2.13	Finding a loop...  failed.
2.18/2.13	EOF