/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: from(X) -> cons(X,n__from(n__s(X))) 2: 2ndspos(0(),Z) -> rnil() 3: 2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z))) 4: 2ndsneg(0(),Z) -> rnil() 5: 2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z))) 6: pi(X) -> 2ndspos(X,from(0())) 7: plus(0(),Y) -> Y 8: plus(s(X),Y) -> s(plus(X,Y)) 9: times(0(),Y) -> 0() 10: times(s(X),Y) -> plus(Y,times(X,Y)) 11: square(X) -> times(X,X) 12: from(X) -> n__from(X) 13: s(X) -> n__s(X) 14: cons(X1,X2) -> n__cons(X1,X2) 15: activate(n__from(X)) -> from(activate(X)) 16: activate(n__s(X)) -> s(activate(X)) 17: activate(n__cons(X1,X2)) -> cons(activate(X1),X2) 18: activate(X) -> X Number of strict rules: 18 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #pi(X) -> #2ndspos(X,from(0())) #2: #pi(X) -> #from(0()) #3: #square(X) -> #times(X,X) #4: #times(s(X),Y) -> #plus(Y,times(X,Y)) #5: #times(s(X),Y) -> #times(X,Y) #6: #2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> #activate(Y) #7: #2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> #2ndspos(N,activate(Z)) #8: #2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> #activate(Z) #9: #activate(n__cons(X1,X2)) -> #cons(activate(X1),X2) #10: #activate(n__cons(X1,X2)) -> #activate(X1) #11: #activate(n__s(X)) -> #s(activate(X)) #12: #activate(n__s(X)) -> #activate(X) #13: #2ndspos(s(N),cons(X,n__cons(Y,Z))) -> #activate(Y) #14: #2ndspos(s(N),cons(X,n__cons(Y,Z))) -> #2ndsneg(N,activate(Z)) #15: #2ndspos(s(N),cons(X,n__cons(Y,Z))) -> #activate(Z) #16: #from(X) -> #cons(X,n__from(n__s(X))) #17: #plus(s(X),Y) -> #s(plus(X,Y)) #18: #plus(s(X),Y) -> #plus(X,Y) #19: #activate(n__from(X)) -> #from(activate(X)) #20: #activate(n__from(X)) -> #activate(X) Number of SCCs: 4, DPs: 7 SCC { #5 } POLO(Sum)... succeeded. negrecip w: 0 #cons w: 0 s w: x1 + 1 2ndspos w: 0 activate w: 0 rnil w: 0 #plus w: 0 n__from w: 0 square w: 0 #activate w: 0 #square w: 0 pi w: 0 rcons w: 0 n__s w: 0 #times w: x1 0 w: 0 from w: 0 times w: 0 #s w: 0 n__cons w: 0 2ndsneg w: 0 plus w: 0 #2ndspos w: 0 #from w: 0 cons w: 0 #pi w: 0 #2ndsneg w: 0 posrecip w: 0 USABLE RULES: { } Removed DPs: #5 Number of SCCs: 3, DPs: 6 SCC { #18 } POLO(Sum)... succeeded. negrecip w: 0 #cons w: 0 s w: x1 + 1 2ndspos w: 0 activate w: 0 rnil w: 0 #plus w: x1 n__from w: 0 square w: 0 #activate w: 0 #square w: 0 pi w: 0 rcons w: 0 n__s w: 0 #times w: 0 0 w: 0 from w: 0 times w: 0 #s w: 0 n__cons w: 0 2ndsneg w: 0 plus w: 0 #2ndspos w: 0 #from w: 0 cons w: 0 #pi w: 0 #2ndsneg w: 0 posrecip w: 0 USABLE RULES: { } Removed DPs: #18 Number of SCCs: 2, DPs: 5 SCC { #10 #12 #20 } POLO(Sum)... succeeded. negrecip w: 0 #cons w: 0 s w: 1 2ndspos w: 0 activate w: 0 rnil w: 0 #plus w: 0 n__from w: x1 + 1 square w: 0 #activate w: x1 #square w: 0 pi w: 0 rcons w: 0 n__s w: x1 + 1 #times w: 0 0 w: 0 from w: 0 times w: 0 #s w: 0 n__cons w: x1 + 1 2ndsneg w: 0 plus w: 0 #2ndspos w: 0 #from w: 0 cons w: 0 #pi w: 0 #2ndsneg w: 0 posrecip w: 0 USABLE RULES: { } Removed DPs: #10 #12 #20 Number of SCCs: 1, DPs: 2 SCC { #7 #14 } POLO(Sum)... succeeded. negrecip w: 0 #cons w: 0 s w: x1 + 1 2ndspos w: 0 activate w: x1 + 1 rnil w: 0 #plus w: 0 n__from w: 1 square w: 0 #activate w: 0 #square w: 0 pi w: 0 rcons w: 0 n__s w: x1 + 1 #times w: 0 0 w: 0 from w: x1 + 2 times w: 0 #s w: 0 n__cons w: x1 + x2 + 1 2ndsneg w: 0 plus w: 0 #2ndspos w: x1 #from w: 0 cons w: x1 + x2 + 1 #pi w: 0 #2ndsneg w: x1 posrecip w: 0 USABLE RULES: { } Removed DPs: #7 #14 Number of SCCs: 0, DPs: 0