/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(f(f(a()))) -> mark(c(f(g(f(a()))))) 2: active(f(X)) -> f(active(X)) 3: active(g(X)) -> g(active(X)) 4: f(mark(X)) -> mark(f(X)) 5: g(mark(X)) -> mark(g(X)) 6: proper(f(X)) -> f(proper(X)) 7: proper(a()) -> ok(a()) 8: proper(c(X)) -> c(proper(X)) 9: proper(g(X)) -> g(proper(X)) 10: f(ok(X)) -> ok(f(X)) 11: c(ok(X)) -> ok(c(X)) 12: g(ok(X)) -> ok(g(X)) 13: top(mark(X)) -> top(proper(X)) 14: top(ok(X)) -> top(active(X)) Number of strict rules: 14 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(f(X)) -> #f(active(X)) #2: #active(f(X)) -> #active(X) #3: #proper(f(X)) -> #f(proper(X)) #4: #proper(f(X)) -> #proper(X) #5: #top(mark(X)) -> #top(proper(X)) #6: #top(mark(X)) -> #proper(X) #7: #proper(g(X)) -> #g(proper(X)) #8: #proper(g(X)) -> #proper(X) #9: #c(ok(X)) -> #c(X) #10: #g(ok(X)) -> #g(X) #11: #top(ok(X)) -> #top(active(X)) #12: #top(ok(X)) -> #active(X) #13: #f(ok(X)) -> #f(X) #14: #g(mark(X)) -> #g(X) #15: #active(g(X)) -> #g(active(X)) #16: #active(g(X)) -> #active(X) #17: #active(f(f(a()))) -> #c(f(g(f(a())))) #18: #active(f(f(a()))) -> #f(g(f(a()))) #19: #active(f(f(a()))) -> #g(f(a())) #20: #proper(c(X)) -> #c(proper(X)) #21: #proper(c(X)) -> #proper(X) #22: #f(mark(X)) -> #f(X) Number of SCCs: 6, DPs: 12 SCC { #9 } POLO(Sum)... succeeded. a w: 0 top w: 0 #top w: 0 c w: 0 f w: 0 proper w: 0 ok w: x1 + 1 mark w: 0 #f w: 0 #g w: 0 #proper w: 0 #c w: x1 active w: 0 #active w: 0 g w: 0 USABLE RULES: { } Removed DPs: #9 Number of SCCs: 5, DPs: 11 SCC { #2 #16 } POLO(Sum)... succeeded. a w: 0 top w: 0 #top w: 0 c w: 0 f w: x1 + 1 proper w: 0 ok w: 1 mark w: 0 #f w: 0 #g w: 0 #proper w: 0 #c w: 0 active w: 0 #active w: x1 g w: x1 + 1 USABLE RULES: { } Removed DPs: #2 #16 Number of SCCs: 4, DPs: 9 SCC { #13 #22 } POLO(Sum)... succeeded. a w: 0 top w: 0 #top w: 0 c w: 0 f w: 1 proper w: 0 ok w: x1 + 1 mark w: x1 + 1 #f w: x1 #g w: 0 #proper w: 0 #c w: 0 active w: 0 #active w: 0 g w: 1 USABLE RULES: { } Removed DPs: #13 #22 Number of SCCs: 3, DPs: 7 SCC { #10 #14 } POLO(Sum)... succeeded. a w: 0 top w: 0 #top w: 0 c w: 0 f w: 1 proper w: 0 ok w: x1 + 1 mark w: x1 + 1 #f w: 0 #g w: x1 #proper w: 0 #c w: 0 active w: 0 #active w: 0 g w: 1 USABLE RULES: { } Removed DPs: #10 #14 Number of SCCs: 2, DPs: 5 SCC { #5 #11 } POLO(Sum)... succeeded. a w: 1 top w: 0 #top w: x1 c w: 1 f w: x1 + 1 proper w: x1 + 1 ok w: x1 mark w: x1 + 2 #f w: 0 #g w: 0 #proper w: 0 #c w: 0 active w: x1 #active w: 0 g w: x1 + 1 USABLE RULES: { 1..12 } Removed DPs: #5 Number of SCCs: 2, DPs: 4 SCC { #11 } POLO(Sum)... succeeded. a w: 1 top w: 0 #top w: x1 c w: x1 + 1 f w: x1 + 1 proper w: x1 + 1 ok w: x1 + 1 mark w: 2 #f w: 0 #g w: 0 #proper w: 0 #c w: 0 active w: x1 #active w: 0 g w: x1 + 1 USABLE RULES: { 1..12 } Removed DPs: #11 Number of SCCs: 1, DPs: 3 SCC { #4 #8 #21 } POLO(Sum)... succeeded. a w: 1 top w: 0 #top w: x1 c w: x1 + 1 f w: x1 + 1 proper w: x1 + 1 ok w: x1 + 1 mark w: 2 #f w: 0 #g w: 0 #proper w: x1 #c w: 0 active w: x1 #active w: 0 g w: x1 + 1 USABLE RULES: { 1..12 } Removed DPs: #4 #8 #21 Number of SCCs: 0, DPs: 0