/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(from(X)) -> mark(cons(X,from(s(X)))) 2: active(length(nil())) -> mark(0()) 3: active(length(cons(X,Y))) -> mark(s(length1(Y))) 4: active(length1(X)) -> mark(length(X)) 5: active(from(X)) -> from(active(X)) 6: active(cons(X1,X2)) -> cons(active(X1),X2) 7: active(s(X)) -> s(active(X)) 8: from(mark(X)) -> mark(from(X)) 9: cons(mark(X1),X2) -> mark(cons(X1,X2)) 10: s(mark(X)) -> mark(s(X)) 11: proper(from(X)) -> from(proper(X)) 12: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 13: proper(s(X)) -> s(proper(X)) 14: proper(length(X)) -> length(proper(X)) 15: proper(nil()) -> ok(nil()) 16: proper(0()) -> ok(0()) 17: proper(length1(X)) -> length1(proper(X)) 18: from(ok(X)) -> ok(from(X)) 19: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 20: s(ok(X)) -> ok(s(X)) 21: length(ok(X)) -> ok(length(X)) 22: length1(ok(X)) -> ok(length1(X)) 23: top(mark(X)) -> top(proper(X)) 24: top(ok(X)) -> top(active(X)) Number of strict rules: 24 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(cons(X1,X2)) -> #cons(active(X1),X2) #2: #active(cons(X1,X2)) -> #active(X1) #3: #proper(s(X)) -> #s(proper(X)) #4: #proper(s(X)) -> #proper(X) #5: #cons(mark(X1),X2) -> #cons(X1,X2) #6: #proper(from(X)) -> #from(proper(X)) #7: #proper(from(X)) -> #proper(X) #8: #top(ok(X)) -> #top(active(X)) #9: #top(ok(X)) -> #active(X) #10: #top(mark(X)) -> #top(proper(X)) #11: #top(mark(X)) -> #proper(X) #12: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #13: #proper(cons(X1,X2)) -> #proper(X1) #14: #proper(cons(X1,X2)) -> #proper(X2) #15: #proper(length(X)) -> #length(proper(X)) #16: #proper(length(X)) -> #proper(X) #17: #s(ok(X)) -> #s(X) #18: #active(s(X)) -> #s(active(X)) #19: #active(s(X)) -> #active(X) #20: #s(mark(X)) -> #s(X) #21: #active(from(X)) -> #from(active(X)) #22: #active(from(X)) -> #active(X) #23: #length1(ok(X)) -> #length1(X) #24: #proper(length1(X)) -> #length1(proper(X)) #25: #proper(length1(X)) -> #proper(X) #26: #cons(ok(X1),ok(X2)) -> #cons(X1,X2) #27: #length(ok(X)) -> #length(X) #28: #active(length(cons(X,Y))) -> #s(length1(Y)) #29: #active(length(cons(X,Y))) -> #length1(Y) #30: #active(from(X)) -> #cons(X,from(s(X))) #31: #active(from(X)) -> #from(s(X)) #32: #active(from(X)) -> #s(X) #33: #from(mark(X)) -> #from(X) #34: #active(length1(X)) -> #length(X) #35: #from(ok(X)) -> #from(X) Number of SCCs: 8, DPs: 19 SCC { #23 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #length1 w: x1 top w: 0 length1 w: 0 #top w: 0 proper w: 0 ok w: x1 + 1 0 w: 0 from w: 0 #s w: 0 nil w: 0 mark w: 0 #proper w: 0 #from w: 0 active w: 0 cons w: 0 #active w: 0 length w: 0 #length w: 0 USABLE RULES: { } Removed DPs: #23 Number of SCCs: 7, DPs: 18 SCC { #27 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #length1 w: 0 top w: 0 length1 w: 0 #top w: 0 proper w: 0 ok w: x1 + 1 0 w: 0 from w: 0 #s w: 0 nil w: 0 mark w: 0 #proper w: 0 #from w: 0 active w: 0 cons w: 0 #active w: 0 length w: 0 #length w: x1 USABLE RULES: { } Removed DPs: #27 Number of SCCs: 6, DPs: 17 SCC { #33 #35 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #length1 w: 0 top w: 0 length1 w: 0 #top w: 0 proper w: 0 ok w: x1 + 1 0 w: 0 from w: 0 #s w: 0 nil w: 0 mark w: x1 + 1 #proper w: 0 #from w: x1 active w: 0 cons w: 0 #active w: 0 length w: 0 #length w: 0 USABLE RULES: { } Removed DPs: #33 #35 Number of SCCs: 5, DPs: 15 SCC { #17 #20 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #length1 w: 0 top w: 0 length1 w: 0 #top w: 0 proper w: 0 ok w: x1 + 1 0 w: 0 from w: 0 #s w: x1 nil w: 0 mark w: x1 + 1 #proper w: 0 #from w: 0 active w: 0 cons w: 0 #active w: 0 length w: 0 #length w: 0 USABLE RULES: { } Removed DPs: #17 #20 Number of SCCs: 4, DPs: 13 SCC { #8 #10 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded. #cons w: [0;0] s w: [0,1;0,1] * x1 + [1;1] #length1 w: [0;0] top w: [0;0] length1 w: [0,1;1,0] * x1 + [1;3] #top w: [0,1;0,1] * x1 proper w: x1 + [2;2] ok w: x1 + [2;2] 0 w: [1;1] from w: x1 + [1;3] #s w: [0;0] nil w: [2;1] mark w: [0,0;0,1] * x1 + [1;3] #proper w: [0;0] #from w: [0;0] active w: x1 + [1;1] cons w: [0,0;0,1] * x1 + [1,0;0,0] * x2 + [5;1] #active w: [0;0] length w: [1,0;1,0] * x1 + [1;1] #length w: [0;0] USABLE RULES: { 1..22 } Removed DPs: #8 #10 Number of SCCs: 3, DPs: 11 SCC { #5 #26 } POLO(Sum)... succeeded. #cons w: x1 + x2 s w: x1 + 1 #length1 w: 0 top w: 0 length1 w: 2 #top w: 0 proper w: x1 + 1 ok w: x1 + 2 0 w: 1 from w: 2 #s w: 0 nil w: 1 mark w: x1 + 1 #proper w: 0 #from w: 0 active w: 1 cons w: x1 + 1 #active w: 0 length w: 1 #length w: 0 USABLE RULES: { } Removed DPs: #5 #26 Number of SCCs: 2, DPs: 9 SCC { #2 #19 #22 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 + 1 #length1 w: 0 top w: 0 length1 w: 2 #top w: 0 proper w: x1 + 1 ok w: x1 + 2 0 w: 1 from w: x1 + 2 #s w: 0 nil w: 1 mark w: x1 + 1 #proper w: 0 #from w: 0 active w: 1 cons w: x1 + 1 #active w: x1 length w: 1 #length w: 0 USABLE RULES: { } Removed DPs: #2 #19 #22 Number of SCCs: 1, DPs: 6 SCC { #4 #7 #13 #14 #16 #25 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 + 1 #length1 w: 0 top w: 0 length1 w: x1 + 2 #top w: 0 proper w: x1 + 1 ok w: x1 + 2 0 w: 2 from w: x1 + 2 #s w: 0 nil w: 1 mark w: x1 + 1 #proper w: x1 #from w: 0 active w: 1 cons w: x1 + x2 + 1 #active w: 0 length w: x1 + 1 #length w: 0 USABLE RULES: { } Removed DPs: #4 #7 #13 #14 #16 #25 Number of SCCs: 0, DPs: 0