Input TRS: 1: active(zeros()) -> mark(cons(0(),zeros())) 2: active(tail(cons(X,XS))) -> mark(XS) 3: mark(zeros()) -> active(zeros()) 4: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 5: mark(0()) -> active(0()) 6: mark(tail(X)) -> active(tail(mark(X))) 7: cons(mark(X1),X2) -> cons(X1,X2) 8: cons(X1,mark(X2)) -> cons(X1,X2) 9: cons(active(X1),X2) -> cons(X1,X2) 10: cons(X1,active(X2)) -> cons(X1,X2) 11: tail(mark(X)) -> tail(X) 12: tail(active(X)) -> tail(X) Number of strict rules: 12 Direct Order(PosReal,>,Poly) ... removes: 2 zeros() weight: 0 tail(x1) weight: 28101 + x1 0() weight: 0 mark(x1) weight: x1 active(x1) weight: x1 cons(x1,x2) weight: x1 + x2 Number of strict rules: 11 Direct Order(PosReal,>,Poly) ... removes: 6 zeros() weight: 0 tail(x1) weight: (/ 1 4) + x1 0() weight: 0 mark(x1) weight: 2 * x1 active(x1) weight: x1 cons(x1,x2) weight: x1 + x2 Number of strict rules: 10 Direct Order(PosReal,>,Poly) ... failed. Freezing ... failed. Dependency Pairs: #1: #cons(active(X1),X2) -> #cons(X1,X2) #2: #tail(mark(X)) -> #tail(X) #3: #tail(active(X)) -> #tail(X) #4: #cons(mark(X1),X2) -> #cons(X1,X2) #5: #cons(X1,active(X2)) -> #cons(X1,X2) #6: #mark(0()) -> #active(0()) #7: #mark(zeros()) -> #active(zeros()) #8: #active(zeros()) -> #mark(cons(0(),zeros())) #9: #active(zeros()) -> #cons(0(),zeros()) #10: #cons(X1,mark(X2)) -> #cons(X1,X2) #11: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #12: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #13: #mark(cons(X1,X2)) -> #mark(X1) Number of SCCs: 3, DPs: 9, edges: 24 SCC { #2 #3 } Removing DPs: Order(PosReal,>,Sum)... succeeded. #cons(x1,x2) weight: 0 zeros() weight: 0 tail(x1) weight: 0 #mark(x1) weight: 0 0() weight: 0 #tail(x1) weight: x1 mark(x1) weight: (/ 1 2) + x1 active(x1) weight: (/ 1 2) + x1 cons(x1,x2) weight: 0 #active(x1) weight: 0 Usable rules: { } Removed DPs: #2 #3 Number of SCCs: 2, DPs: 7, edges: 20 SCC { #7 #8 #13 } Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... succeeded. #cons(x1,x2) weight: 0 zeros() weight: (/ 1 2) tail(x1) weight: 0 #mark(x1) weight: x1 0() weight: 0 #tail(x1) weight: 0 mark(x1) weight: 0 active(x1) weight: 0 cons(x1,x2) weight: max{x2, (/ 1 4) + x1} #active(x1) weight: (/ 1 2) Usable rules: { } Removed DPs: #13 Number of SCCs: 1, DPs: 4, edges: 16 SCC { #1 #4 #5 #10 } Removing DPs: Order(PosReal,>,Sum)... succeeded. #cons(x1,x2) weight: x1 zeros() weight: 0 tail(x1) weight: 0 #mark(x1) weight: 0 0() weight: 0 #tail(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 active(x1) weight: (/ 1 2) + x1 cons(x1,x2) weight: 0 #active(x1) weight: 0 Usable rules: { } Removed DPs: #1 #4 Number of SCCs: 1, DPs: 2, edges: 4 SCC { #5 #10 } Removing DPs: Order(PosReal,>,Sum)... succeeded. #cons(x1,x2) weight: x2 zeros() weight: 0 tail(x1) weight: 0 #mark(x1) weight: 0 0() weight: 0 #tail(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 active(x1) weight: (/ 1 2) + x1 cons(x1,x2) weight: 0 #active(x1) weight: 0 Usable rules: { } Removed DPs: #5 #10 Number of SCCs: 0, DPs: 0, edges: 0 YES