/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(2nd(cons(X,cons(Y,Z)))) -> mark(Y) 2: active(from(X)) -> mark(cons(X,from(s(X)))) 3: mark(2nd(X)) -> active(2nd(mark(X))) 4: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 5: mark(from(X)) -> active(from(mark(X))) 6: mark(s(X)) -> active(s(mark(X))) 7: 2nd(mark(X)) -> 2nd(X) 8: 2nd(active(X)) -> 2nd(X) 9: cons(mark(X1),X2) -> cons(X1,X2) 10: cons(X1,mark(X2)) -> cons(X1,X2) 11: cons(active(X1),X2) -> cons(X1,X2) 12: cons(X1,active(X2)) -> cons(X1,X2) 13: from(mark(X)) -> from(X) 14: from(active(X)) -> from(X) 15: s(mark(X)) -> s(X) 16: s(active(X)) -> s(X) Number of strict rules: 16 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(from(X)) -> #mark(cons(X,from(s(X)))) #2: #active(from(X)) -> #cons(X,from(s(X))) #3: #active(from(X)) -> #from(s(X)) #4: #active(from(X)) -> #s(X) #5: #mark(s(X)) -> #active(s(mark(X))) #6: #mark(s(X)) -> #s(mark(X)) #7: #mark(s(X)) -> #mark(X) #8: #from(mark(X)) -> #from(X) #9: #cons(mark(X1),X2) -> #cons(X1,X2) #10: #cons(active(X1),X2) -> #cons(X1,X2) #11: #cons(X1,active(X2)) -> #cons(X1,X2) #12: #from(active(X)) -> #from(X) #13: #2nd(mark(X)) -> #2nd(X) #14: #cons(X1,mark(X2)) -> #cons(X1,X2) #15: #mark(from(X)) -> #active(from(mark(X))) #16: #mark(from(X)) -> #from(mark(X)) #17: #mark(from(X)) -> #mark(X) #18: #s(active(X)) -> #s(X) #19: #mark(2nd(X)) -> #active(2nd(mark(X))) #20: #mark(2nd(X)) -> #2nd(mark(X)) #21: #mark(2nd(X)) -> #mark(X) #22: #active(2nd(cons(X,cons(Y,Z)))) -> #mark(Y) #23: #2nd(active(X)) -> #2nd(X) #24: #s(mark(X)) -> #s(X) #25: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #26: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #27: #mark(cons(X1,X2)) -> #mark(X1) Number of SCCs: 5, DPs: 18 SCC { #18 #24 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 2nd w: 0 #mark w: 0 from w: 0 #s w: x1 #2nd w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #18 #24 Number of SCCs: 4, DPs: 16 SCC { #8 #12 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 2nd w: 0 #mark w: 0 from w: 0 #s w: 0 #2nd w: 0 mark w: x1 + 1 #from w: x1 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #8 #12 Number of SCCs: 3, DPs: 14 SCC { #13 #23 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 2nd w: 0 #mark w: 0 from w: 0 #s w: 0 #2nd w: x1 mark w: x1 + 1 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #13 #23 Number of SCCs: 2, DPs: 12 SCC { #9..11 #14 } POLO(Sum)... succeeded. #cons w: x2 s w: 0 2nd w: 0 #mark w: 0 from w: 0 #s w: 0 #2nd w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #11 #14 Number of SCCs: 2, DPs: 10 SCC { #9 #10 } POLO(Sum)... succeeded. #cons w: x1 s w: 0 2nd w: 0 #mark w: 0 from w: 0 #s w: 0 #2nd w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #9 #10 Number of SCCs: 1, DPs: 8 SCC { #1 #7 #15 #17 #19 #21 #22 #27 } POLO(Sum)... POLO(max)... succeeded. #cons w: 0 s w: x1 2nd w: x1 + 1 #mark w: x1 from w: x1 + 2 #s w: 0 #2nd w: 0 mark w: x1 #from w: 0 active w: x1 cons w: max(x1 + 1, x2) #active w: x1 USABLE RULES: { 1..16 } Removed DPs: #17 #21 #22 #27 Number of SCCs: 1, DPs: 1 SCC { #7 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 + 1 2nd w: 1 #mark w: x1 + 1 from w: 1 #s w: 0 #2nd w: 0 mark w: 1 #from w: 0 active w: 1 cons w: 1 #active w: 0 USABLE RULES: { 1..6 9..14 } Removed DPs: #7 Number of SCCs: 0, DPs: 0