/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(f(0())) -> mark(cons(0(),f(s(0())))) 2: active(f(s(0()))) -> mark(f(p(s(0())))) 3: active(p(s(X))) -> mark(X) 4: active(f(X)) -> f(active(X)) 5: active(cons(X1,X2)) -> cons(active(X1),X2) 6: active(s(X)) -> s(active(X)) 7: active(p(X)) -> p(active(X)) 8: f(mark(X)) -> mark(f(X)) 9: cons(mark(X1),X2) -> mark(cons(X1,X2)) 10: s(mark(X)) -> mark(s(X)) 11: p(mark(X)) -> mark(p(X)) 12: proper(f(X)) -> f(proper(X)) 13: proper(0()) -> ok(0()) 14: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 15: proper(s(X)) -> s(proper(X)) 16: proper(p(X)) -> p(proper(X)) 17: f(ok(X)) -> ok(f(X)) 18: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 19: s(ok(X)) -> ok(s(X)) 20: p(ok(X)) -> ok(p(X)) 21: top(mark(X)) -> top(proper(X)) 22: top(ok(X)) -> top(active(X)) Number of strict rules: 22 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(f(s(0()))) -> #f(p(s(0()))) #2: #active(f(s(0()))) -> #p(s(0())) #3: #active(s(X)) -> #s(active(X)) #4: #active(s(X)) -> #active(X) #5: #cons(mark(X1),X2) -> #cons(X1,X2) #6: #p(mark(X)) -> #p(X) #7: #proper(f(X)) -> #f(proper(X)) #8: #proper(f(X)) -> #proper(X) #9: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #10: #proper(cons(X1,X2)) -> #proper(X1) #11: #proper(cons(X1,X2)) -> #proper(X2) #12: #p(ok(X)) -> #p(X) #13: #active(p(X)) -> #p(active(X)) #14: #active(p(X)) -> #active(X) #15: #s(mark(X)) -> #s(X) #16: #active(cons(X1,X2)) -> #cons(active(X1),X2) #17: #active(cons(X1,X2)) -> #active(X1) #18: #top(ok(X)) -> #top(active(X)) #19: #top(ok(X)) -> #active(X) #20: #f(ok(X)) -> #f(X) #21: #s(ok(X)) -> #s(X) #22: #top(mark(X)) -> #top(proper(X)) #23: #top(mark(X)) -> #proper(X) #24: #proper(p(X)) -> #p(proper(X)) #25: #proper(p(X)) -> #proper(X) #26: #active(f(0())) -> #cons(0(),f(s(0()))) #27: #active(f(0())) -> #f(s(0())) #28: #active(f(0())) -> #s(0()) #29: #f(mark(X)) -> #f(X) #30: #proper(s(X)) -> #s(proper(X)) #31: #proper(s(X)) -> #proper(X) #32: #active(f(X)) -> #f(active(X)) #33: #active(f(X)) -> #active(X) #34: #cons(ok(X1),ok(X2)) -> #cons(X1,X2) Number of SCCs: 7, DPs: 19 SCC { #6 #12 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 top w: 0 #top w: 0 #p w: x1 f w: 0 p w: 0 proper w: 0 ok w: x1 + 1 0 w: 0 #s w: 0 mark w: x1 + 1 #f w: 0 #proper w: 0 active w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #6 #12 Number of SCCs: 6, DPs: 17 SCC { #15 #21 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 top w: 0 #top w: 0 #p w: 0 f w: 0 p w: 0 proper w: 0 ok w: x1 + 1 0 w: 0 #s w: x1 mark w: x1 + 1 #f w: 0 #proper w: 0 active w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #15 #21 Number of SCCs: 5, DPs: 15 SCC { #20 #29 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 top w: 0 #top w: 0 #p w: 0 f w: 0 p w: 0 proper w: 0 ok w: x1 + 1 0 w: 0 #s w: 0 mark w: x1 + 1 #f w: x1 #proper w: 0 active w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #20 #29 Number of SCCs: 4, DPs: 13 SCC { #18 #22 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded. #cons w: [0;0] s w: [0,1;1,0] * x1 + [1;1] top w: [0;0] #top w: x1 #p w: [0;0] f w: [1,0;1,0] * x1 + [3;3] p w: [0,1;1,0] * x1 + [1;1] proper w: x1 + [1;1] ok w: x1 + [1;1] 0 w: [0;3] #s w: [0;0] mark w: x1 + [2;2] #f w: [0;0] #proper w: [0;0] active w: x1 cons w: [1,0;1,0] * x1 + [1;1] #active w: [0;0] USABLE RULES: { 1..20 } Removed DPs: #18 #22 Number of SCCs: 3, DPs: 11 SCC { #5 #34 } POLO(Sum)... succeeded. #cons w: x2 s w: x1 + 1 top w: 0 #top w: 0 #p w: 0 f w: 2 p w: x1 + 2 proper w: 1 ok w: x1 + 1 0 w: 1 #s w: 0 mark w: 4 #f w: 0 #proper w: 0 active w: x1 + 1 cons w: x1 + 1 #active w: 0 USABLE RULES: { } Removed DPs: #34 Number of SCCs: 3, DPs: 10 SCC { #5 } POLO(Sum)... succeeded. #cons w: x1 s w: x1 + 1 top w: 0 #top w: 0 #p w: 0 f w: 2 p w: x1 + 2 proper w: 1 ok w: x1 + 1 0 w: 1 #s w: 0 mark w: x1 + 2 #f w: 0 #proper w: 0 active w: x1 + 1 cons w: x1 + 1 #active w: 0 USABLE RULES: { } Removed DPs: #5 Number of SCCs: 2, DPs: 9 SCC { #4 #14 #17 #33 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 + 1 top w: 0 #top w: 0 #p w: 0 f w: x1 + 1 p w: x1 + 2 proper w: 1 ok w: x1 + 1 0 w: 1 #s w: 0 mark w: x1 + 2 #f w: 0 #proper w: 0 active w: x1 + 1 cons w: x1 + 1 #active w: x1 USABLE RULES: { } Removed DPs: #4 #14 #17 #33 Number of SCCs: 1, DPs: 5 SCC { #8 #10 #11 #25 #31 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 + 1 top w: 0 #top w: 0 #p w: 0 f w: x1 + 1 p w: x1 + 2 proper w: 1 ok w: x1 + 1 0 w: 1 #s w: 0 mark w: x1 + 2 #f w: 0 #proper w: x1 active w: x1 + 1 cons w: x1 + x2 + 1 #active w: 0 USABLE RULES: { } Removed DPs: #8 #10 #11 #25 #31 Number of SCCs: 0, DPs: 0