Input TRS: 1: active(c()) -> mark(f(g(c()))) 2: active(f(g(X))) -> mark(g(X)) 3: proper(c()) -> ok(c()) 4: proper(f(X)) -> f(proper(X)) 5: proper(g(X)) -> g(proper(X)) 6: f(ok(X)) -> ok(f(X)) 7: g(ok(X)) -> ok(g(X)) 8: top(mark(X)) -> top(proper(X)) 9: top(ok(X)) -> top(active(X)) Number of strict rules: 9 Direct Order(PosReal,>,Poly) ... failed. Freezing ... failed. Dependency Pairs: #1: #f(ok(X)) -> #f(X) #2: #top(ok(X)) -> #top(active(X)) #3: #top(ok(X)) -> #active(X) #4: #g(ok(X)) -> #g(X) #5: #proper(g(X)) -> #g(proper(X)) #6: #proper(g(X)) -> #proper(X) #7: #active(c()) -> #f(g(c())) #8: #active(c()) -> #g(c()) #9: #top(mark(X)) -> #top(proper(X)) #10: #top(mark(X)) -> #proper(X) #11: #proper(f(X)) -> #f(proper(X)) #12: #proper(f(X)) -> #proper(X) Number of SCCs: 4, DPs: 6, edges: 8 SCC { #1 } Removing DPs: Order(PosReal,>,Sum)... succeeded. top(x1) weight: 0 #top(x1) weight: 0 c() weight: 0 f(x1) weight: 0 proper(x1) weight: 0 ok(x1) weight: (/ 1 2) + x1 mark(x1) weight: 0 #f(x1) weight: x1 #g(x1) weight: 0 #proper(x1) weight: 0 active(x1) weight: 0 #active(x1) weight: 0 g(x1) weight: 0 Usable rules: { } Removed DPs: #1 Number of SCCs: 3, DPs: 5, edges: 7 SCC { #4 } Removing DPs: Order(PosReal,>,Sum)... succeeded. top(x1) weight: 0 #top(x1) weight: 0 c() weight: 0 f(x1) weight: 0 proper(x1) weight: 0 ok(x1) weight: (/ 1 2) + x1 mark(x1) weight: 0 #f(x1) weight: 0 #g(x1) weight: x1 #proper(x1) weight: 0 active(x1) weight: 0 #active(x1) weight: 0 g(x1) weight: 0 Usable rules: { } Removed DPs: #4 Number of SCCs: 2, DPs: 4, edges: 6 SCC { #6 #12 } Removing DPs: Order(PosReal,>,Sum)... succeeded. top(x1) weight: 0 #top(x1) weight: 0 c() weight: 0 f(x1) weight: (/ 1 2) + x1 proper(x1) weight: 0 ok(x1) weight: (/ 1 2) mark(x1) weight: 0 #f(x1) weight: 0 #g(x1) weight: 0 #proper(x1) weight: x1 active(x1) weight: 0 #active(x1) weight: 0 g(x1) weight: (/ 1 2) + x1 Usable rules: { } Removed DPs: #6 #12 Number of SCCs: 1, DPs: 2, edges: 2 SCC { #2 #9 } Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... succeeded. top(x1) weight: 0 #top(x1) weight: x1 c() weight: (/ 5 4) f(x1) weight: (/ 3 4) proper(x1) weight: (/ 1 4) + x1 ok(x1) weight: x1 mark(x1) weight: (/ 1 2) + x1 #f(x1) weight: 0 #g(x1) weight: 0 #proper(x1) weight: 0 active(x1) weight: x1 #active(x1) weight: 0 g(x1) weight: (/ 1 4) Usable rules: { 1..7 } Removed DPs: #9 Number of SCCs: 0, DPs: 0, edges: 0 YES