Input TRS: 1: top(U(x,y)) -> top(check(D(x,y))) 2: D(x,B()) -> U(x,B()) 3: F(x,U(O(y),z)) -> U(x,F(y,z)) 4: F(x,U(N(y),z)) -> U(x,F(y,z)) 5: D(O(x),F(y,z)) -> F(x,D(y,z)) 6: D(N(x),F(y,z)) -> F(x,D(y,z)) 7: F(x,U(E(),y)) -> U(x,F(E(),y)) 8: D(E(),F(x,y)) -> F(E(),D(x,y)) e1: E() ->= N(E()) [relative] e2: check(O(x)) ->= O(x) [relative] e3: check(U(x,y)) ->= U(check(x),y) [relative] e4: check(U(x,y)) ->= U(x,check(y)) [relative] e5: check(D(x,y)) ->= D(check(x),y) [relative] e6: check(D(x,y)) ->= D(x,check(y)) [relative] e7: check(F(x,y)) ->= F(check(x),y) [relative] e8: check(F(x,y)) ->= F(x,check(y)) [relative] e9: check(O(x)) ->= O(check(x)) [relative] e10: check(N(x)) ->= N(check(x)) [relative] Number of Rules: 8 Direct POLO(Sum) ... removes: 3 5 I(F) = x1 + x2 I(top) = x1 I(E) = 0 I(D) = x1 + x2 I(O) = x1 + 1 I(B) = 0 I(check) = x1 I(N) = x1 I(U) = x1 + x2 Number of Rules: 6 Direct POLO(Sum) ...Direct Mat2b ... failed. Dependency Pairs: #1: # D(N(x),F(y,z)) -> # F(x,D(y,z)) #2: # D(N(x),F(y,z)) -> # D(y,z) #3: # check(D(x,y)) -> # D(check(x),y) [relative] #4: # check(D(x,y)) -> # check(x) [relative] #5: # check(D(x,y)) -> # D(x,check(y)) [relative] #6: # check(D(x,y)) -> # check(y) [relative] #7: # check(F(x,y)) -> # F(check(x),y) [relative] #8: # check(F(x,y)) -> # check(x) [relative] #9: # check(U(x,y)) -> # check(x) [relative] #10: # check(U(x,y)) -> # check(y) [relative] #11: # F(x,U(E(),y)) -> # F(E(),y) #12: # check(F(x,y)) -> # F(x,check(y)) [relative] #13: # check(F(x,y)) -> # check(y) [relative] #14: # check(N(x)) -> # check(x) [relative] #15: # top(U(x,y)) -> # top(check(D(x,y))) #16: # top(U(x,y)) -> # check(D(x,y)) #17: # top(U(x,y)) -> # D(x,y) #18: # D(E(),F(x,y)) -> # F(E(),D(x,y)) #19: # D(E(),F(x,y)) -> # D(x,y) #20: # check(O(x)) -> # check(x) [relative] #21: # F(x,U(N(y),z)) -> # F(y,z) Number of SCCs: 4 SCC { #15 } POLO(Sum)... QLPOS... QWPOpS(mSum)... Mat2b... failed.