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