1.02/1.03 MAYBE 1.02/1.04 Input TRS: 1.02/1.04 1: top(ok(queue(old(x),bot()))) -> top(check(queue(x,bot()))) 1.02/1.04 2: top(ok(queue(new(x),bot()))) -> top(check(queue(x,bot()))) 1.02/1.04 3: top(ok(queue(bot(),old(x)))) -> top(check(queue(bot(),x))) 1.02/1.04 4: top(ok(queue(bot(),new(x)))) -> top(check(queue(bot(),x))) 1.02/1.04 5: top(ok(queue(old(x),old(y)))) -> top(check(queue(x,y))) 1.02/1.04 6: top(ok(queue(old(x),new(y)))) -> top(check(queue(x,y))) 1.02/1.04 7: top(ok(queue(new(x),old(y)))) -> top(check(queue(x,y))) 1.02/1.04 8: top(ok(queue(new(x),new(y)))) -> top(check(queue(x,y))) 1.02/1.04 9: top(ok(queue(old(x),y))) ->= top(check(queue(x,y))) 1.02/1.04 10: top(ok(queue(new(x),y))) ->= top(check(queue(x,y))) 1.02/1.04 11: bot() ->= new(bot()) 1.02/1.04 12: check(old(x)) ->= ok(old(x)) 1.02/1.04 13: check(new(x)) ->= new(check(x)) 1.02/1.04 14: check(queue(x,y)) ->= queue(check(x),y) 1.02/1.04 15: check(queue(x,y)) ->= queue(x,check(y)) 1.02/1.04 16: old(ok(x)) ->= ok(old(x)) 1.02/1.04 17: new(ok(x)) ->= ok(new(x)) 1.02/1.04 18: queue(ok(x),y) ->= ok(queue(x,y)) 1.02/1.04 19: queue(x,ok(y)) ->= ok(queue(x,y)) 1.02/1.04 Number of strict rules: 8 1.02/1.04 Direct POLO(bPol) ... removes: 1 3 16 5 7 9 6 1.02/1.04 new w: x1 1.02/1.04 top w: 2 * x1 1.02/1.04 bot w: 1 1.02/1.04 queue w: x1 + x2 + 1 1.02/1.04 check w: x1 + 1 1.02/1.04 ok w: x1 + 1 1.02/1.04 old w: 2 * x1 + 1 1.02/1.04 Number of strict rules: 3 1.02/1.04 Direct POLO(bPol) ... failed. 1.02/1.04 Uncurrying ... failed. 1.02/1.04 Dependency Pairs: 1.02/1.04 #1: #top(ok(queue(new(x),bot()))) -> #top(check(queue(x,bot()))) 1.02/1.04 #2: #top(ok(queue(new(x),y))) ->? #top(check(queue(x,y))) 1.02/1.04 #3: #top(ok(queue(new(x),new(y)))) -> #top(check(queue(x,y))) 1.02/1.04 #4: #top(ok(queue(bot(),new(x)))) -> #top(check(queue(bot(),x))) 1.02/1.04 Number of SCCs: 1, DPs: 4 1.02/1.04 SCC { #1..4 } 1.02/1.04 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. 1.02/1.04 Finding a loop... failed. 1.02/1.04 EOF