Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487070701
details
property
value
status
complete
benchmark
ExIntrod_GM99_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n186.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.198386 seconds
cpu usage
0.04092
user time
0.02273
system time
0.01819
max virtual memory
113188.0
max residence set size
7780.0
stage attributes
key
value
starexec-result
YES
output
YES Input TRS: 1: a__primes() -> a__sieve(a__from(s(s(0())))) 2: a__from(X) -> cons(mark(X),from(s(X))) 3: a__head(cons(X,Y)) -> mark(X) 4: a__tail(cons(X,Y)) -> mark(Y) 5: a__if(true(),X,Y) -> mark(X) 6: a__if(false(),X,Y) -> mark(Y) 7: a__filter(s(s(X)),cons(Y,Z)) -> a__if(divides(s(s(mark(X))),mark(Y)),filter(s(s(X)),Z),cons(Y,filter(X,sieve(Y)))) 8: a__sieve(cons(X,Y)) -> cons(mark(X),filter(X,sieve(Y))) 9: mark(primes()) -> a__primes() 10: mark(sieve(X)) -> a__sieve(mark(X)) 11: mark(from(X)) -> a__from(mark(X)) 12: mark(head(X)) -> a__head(mark(X)) 13: mark(tail(X)) -> a__tail(mark(X)) 14: mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3) 15: mark(filter(X1,X2)) -> a__filter(mark(X1),mark(X2)) 16: mark(s(X)) -> s(mark(X)) 17: mark(0()) -> 0() 18: mark(cons(X1,X2)) -> cons(mark(X1),X2) 19: mark(true()) -> true() 20: mark(false()) -> false() 21: mark(divides(X1,X2)) -> divides(mark(X1),mark(X2)) 22: a__primes() -> primes() 23: a__sieve(X) -> sieve(X) 24: a__from(X) -> from(X) 25: a__head(X) -> head(X) 26: a__tail(X) -> tail(X) 27: a__if(X1,X2,X3) -> if(X1,X2,X3) 28: a__filter(X1,X2) -> filter(X1,X2) Number of strict rules: 28 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #a__from(X) -> #mark(X) #2: #a__if(false(),X,Y) -> #mark(Y) #3: #mark(tail(X)) -> #a__tail(mark(X)) #4: #mark(tail(X)) -> #mark(X) #5: #mark(primes()) -> #a__primes() #6: #mark(from(X)) -> #a__from(mark(X)) #7: #mark(from(X)) -> #mark(X) #8: #mark(head(X)) -> #a__head(mark(X)) #9: #mark(head(X)) -> #mark(X) #10: #mark(if(X1,X2,X3)) -> #a__if(mark(X1),X2,X3) #11: #mark(if(X1,X2,X3)) -> #mark(X1) #12: #a__filter(s(s(X)),cons(Y,Z)) -> #a__if(divides(s(s(mark(X))),mark(Y)),filter(s(s(X)),Z),cons(Y,filter(X,sieve(Y)))) #13: #a__filter(s(s(X)),cons(Y,Z)) -> #mark(X) #14: #a__filter(s(s(X)),cons(Y,Z)) -> #mark(Y) #15: #mark(sieve(X)) -> #a__sieve(mark(X)) #16: #mark(sieve(X)) -> #mark(X) #17: #a__if(true(),X,Y) -> #mark(X) #18: #mark(divides(X1,X2)) -> #mark(X1) #19: #mark(divides(X1,X2)) -> #mark(X2) #20: #mark(s(X)) -> #mark(X) #21: #a__head(cons(X,Y)) -> #mark(X) #22: #a__primes() -> #a__sieve(a__from(s(s(0())))) #23: #a__primes() -> #a__from(s(s(0()))) #24: #a__sieve(cons(X,Y)) -> #mark(X) #25: #mark(filter(X1,X2)) -> #a__filter(mark(X1),mark(X2)) #26: #mark(filter(X1,X2)) -> #mark(X1) #27: #mark(filter(X1,X2)) -> #mark(X2) #28: #a__tail(cons(X,Y)) -> #mark(Y) #29: #mark(cons(X1,X2)) -> #mark(X1) Number of SCCs: 1, DPs: 28 SCC { #1..11 #13..29 } POLO(Sum)... POLO(max)... succeeded. s w: x1 #a__head w: x1 #a__from w: x1 + 19267 a__from w: x1 + 12333 false w: 2332 #a__filter w: max(x1 + 6936, x2 + 6934) a__sieve w: x1 + 3 true w: 20682 tail w: x1 + 2 #mark w: x1 + 6935 0 w: 1 if w: max(x1 + 1, x2, x3) #a__primes w: 19271 from w: x1 + 12333 mark w: x1 sieve w: x1 + 3 #a__if w: max(x2 + 6935, x3 + 6935) head w: x1 + 11650 cons w: max(x1 + 12333, x2) a__primes w: 12337 filter w: max(x1 + 2, x2) primes w: 12337 #a__sieve w: x1 + 6936 divides w: max(x1 + 1, x2 + 2) a__tail w: x1 + 2 a__filter w: max(x1 + 2, x2) #a__tail w: x1 + 6936 a__if w: max(x1 + 1, x2, x3) a__head w: x1 + 11650 USABLE RULES: { 1..28 } Removed DPs: #1 #3..9 #11 #13..16 #18 #19 #21..26 #28 #29 Number of SCCs: 1, DPs: 5 SCC { #2 #10 #17 #20 #27 } POLO(Sum)... succeeded.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard