/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: primes() -> sieve(from(s(s(0())))) 2: from(X) -> cons(X,n__from(n__s(X))) 3: head(cons(X,Y)) -> X 4: tail(cons(X,Y)) -> activate(Y) 5: if(true(),X,Y) -> activate(X) 6: if(false(),X,Y) -> activate(Y) 7: filter(s(s(X)),cons(Y,Z)) -> if(divides(s(s(X)),Y),n__filter(n__s(n__s(X)),activate(Z)),n__cons(Y,n__filter(X,n__sieve(Y)))) 8: sieve(cons(X,Y)) -> cons(X,n__filter(X,n__sieve(activate(Y)))) 9: from(X) -> n__from(X) 10: s(X) -> n__s(X) 11: filter(X1,X2) -> n__filter(X1,X2) 12: cons(X1,X2) -> n__cons(X1,X2) 13: sieve(X) -> n__sieve(X) 14: activate(n__from(X)) -> from(activate(X)) 15: activate(n__s(X)) -> s(activate(X)) 16: activate(n__filter(X1,X2)) -> filter(activate(X1),activate(X2)) 17: activate(n__cons(X1,X2)) -> cons(activate(X1),X2) 18: activate(n__sieve(X)) -> sieve(activate(X)) 19: activate(X) -> X Number of strict rules: 19 Direct POLO(bPol) ... failed. Uncurrying if 1: primes() -> sieve(from(s(s(0())))) 2: from(X) -> cons(X,n__from(n__s(X))) 3: head(cons(X,Y)) -> X 4: tail(cons(X,Y)) -> activate(Y) 5: if^1_true(X,Y) -> activate(X) 6: if^1_false(X,Y) -> activate(Y) 7: filter(s(s(X)),cons(Y,Z)) -> if^1_divides(s(s(X)),Y,n__filter(n__s(n__s(X)),activate(Z)),n__cons(Y,n__filter(X,n__sieve(Y)))) 8: sieve(cons(X,Y)) -> cons(X,n__filter(X,n__sieve(activate(Y)))) 9: from(X) -> n__from(X) 10: s(X) -> n__s(X) 11: filter(X1,X2) -> n__filter(X1,X2) 12: cons(X1,X2) -> n__cons(X1,X2) 13: sieve(X) -> n__sieve(X) 14: activate(n__from(X)) -> from(activate(X)) 15: activate(n__s(X)) -> s(activate(X)) 16: activate(n__filter(X1,X2)) -> filter(activate(X1),activate(X2)) 17: activate(n__cons(X1,X2)) -> cons(activate(X1),X2) 18: activate(n__sieve(X)) -> sieve(activate(X)) 19: activate(X) -> X 20: if(false(),_2,_3) ->= if^1_false(_2,_3) 21: if(divides(_1,_2),_4,_5) ->= if^1_divides(_1,_2,_4,_5) 22: if(true(),_2,_3) ->= if^1_true(_2,_3) Number of strict rules: 19 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #from(X) -> #cons(X,n__from(n__s(X))) #2: #if^1_false(X,Y) -> #activate(Y) #3: #activate(n__from(X)) -> #from(activate(X)) #4: #activate(n__from(X)) -> #activate(X) #5: #if(false(),_2,_3) ->? #if^1_false(_2,_3) #6: #filter(s(s(X)),cons(Y,Z)) -> #activate(Z) #7: #if^1_true(X,Y) -> #activate(X) #8: #if(true(),_2,_3) ->? #if^1_true(_2,_3) #9: #activate(n__cons(X1,X2)) -> #cons(activate(X1),X2) #10: #activate(n__cons(X1,X2)) -> #activate(X1) #11: #activate(n__filter(X1,X2)) -> #filter(activate(X1),activate(X2)) #12: #activate(n__filter(X1,X2)) -> #activate(X1) #13: #activate(n__filter(X1,X2)) -> #activate(X2) #14: #primes() -> #sieve(from(s(s(0())))) #15: #primes() -> #from(s(s(0()))) #16: #primes() -> #s(s(0())) #17: #primes() -> #s(0()) #18: #sieve(cons(X,Y)) -> #cons(X,n__filter(X,n__sieve(activate(Y)))) #19: #sieve(cons(X,Y)) -> #activate(Y) #20: #activate(n__s(X)) -> #s(activate(X)) #21: #activate(n__s(X)) -> #activate(X) #22: #tail(cons(X,Y)) -> #activate(Y) #23: #activate(n__sieve(X)) -> #sieve(activate(X)) #24: #activate(n__sieve(X)) -> #activate(X) Number of SCCs: 1, DPs: 10 SCC { #4 #6 #10..13 #19 #21 #23 #24 } POLO(Sum)... POLO(max)... succeeded. #cons w: 0 s w: x1 #if^1_false w: 0 if^1_divides w: max(x3) activate w: x1 #filter w: max(x2 + 1) n__from w: x1 + 1 #activate w: x1 + 1 false w: 0 #head w: 0 #primes w: 0 true w: 0 n__s w: x1 if^1_false w: 0 tail w: 0 0 w: 0 if w: 0 from w: x1 + 1 #s w: 0 n__cons w: max(x1 + 1, x2) n__filter w: max(x1, x2) #tail w: 0 sieve w: x1 n__sieve w: x1 #from w: 0 head w: 0 cons w: max(x1 + 1, x2) #if w: 0 filter w: max(x1, x2) primes w: 0 #sieve w: x1 + 1 #if^1_true w: 0 divides w: 0 if^1_true w: 0 USABLE RULES: { 2 7..19 } Removed DPs: #4 #10 Number of SCCs: 1, DPs: 8 SCC { #6 #11..13 #19 #21 #23 #24 } POLO(Sum)... POLO(max)... succeeded. #cons w: 0 s w: x1 #if^1_false w: 0 if^1_divides w: 0 activate w: x1 #filter w: max(x1 + 2, x2 + 1) n__from w: x1 + 3 #activate w: x1 + 1 false w: 0 #head w: 0 #primes w: 0 true w: 0 n__s w: x1 if^1_false w: 0 tail w: 0 0 w: 0 if w: 0 from w: x1 + 3 #s w: 0 n__cons w: max(x1 + 3, x2) n__filter w: max(x1 + 2, x2) #tail w: 0 sieve w: x1 + 2 n__sieve w: x1 + 2 #from w: 0 head w: 0 cons w: max(x1 + 3, x2) #if w: 0 filter w: max(x1 + 2, x2) primes w: 0 #sieve w: x1 + 2 #if^1_true w: 0 divides w: 0 if^1_true w: 0 USABLE RULES: { 2 7..19 } Removed DPs: #12 #19 #23 #24 Number of SCCs: 1, DPs: 4 SCC { #6 #11 #13 #21 } POLO(Sum)... succeeded. #cons w: 0 s w: x1 + 1 #if^1_false w: 0 if^1_divides w: 0 activate w: x1 #filter w: x2 + 1 n__from w: 1 #activate w: x1 + 1 false w: 0 #head w: 0 #primes w: 0 true w: 0 n__s w: x1 + 1 if^1_false w: 0 tail w: 0 0 w: 0 if w: 0 from w: 1 #s w: 0 n__cons w: x2 n__filter w: x2 #tail w: 0 sieve w: 1 n__sieve w: 1 #from w: 0 head w: 0 cons w: x2 #if w: 0 filter w: x2 primes w: 0 #sieve w: 2 #if^1_true w: 0 divides w: 0 if^1_true w: 0 USABLE RULES: { 2 7..19 } Removed DPs: #21 Number of SCCs: 1, DPs: 3 SCC { #6 #11 #13 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #if^1_false w: 0 if^1_divides w: x4 activate w: x1 + 1 #filter w: x2 + 1 n__from w: x1 + 1 #activate w: x1 + 1 false w: 0 #head w: 0 #primes w: 0 true w: 0 n__s w: 0 if^1_false w: 0 tail w: 0 0 w: 0 if w: 0 from w: x1 + 1 #s w: 0 n__cons w: x2 n__filter w: x2 + 1 #tail w: 0 sieve w: 1 n__sieve w: 0 #from w: 0 head w: 0 cons w: x2 #if w: 0 filter w: x2 + 1 primes w: 0 #sieve w: 2 #if^1_true w: 0 divides w: 0 if^1_true w: 0 USABLE RULES: { 2 7..19 } Removed DPs: #13 Number of SCCs: 1, DPs: 2 SCC { #6 #11 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.