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