Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715968
details
property
value
status
complete
benchmark
ExIntrod_GM99_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n023.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
2.4665350914 seconds
cpu usage
3.224057931
max memory
8.6278144E7
stage attributes
key
value
output-size
14983
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: active(primes()) -> mark(sieve(from(s(s(0()))))) 2: active(from(X)) -> mark(cons(X,from(s(X)))) 3: active(head(cons(X,Y))) -> mark(X) 4: active(tail(cons(X,Y))) -> mark(Y) 5: active(if(true(),X,Y)) -> mark(X) 6: active(if(false(),X,Y)) -> mark(Y) 7: active(filter(s(s(X)),cons(Y,Z))) -> mark(if(divides(s(s(X)),Y),filter(s(s(X)),Z),cons(Y,filter(X,sieve(Y))))) 8: active(sieve(cons(X,Y))) -> mark(cons(X,filter(X,sieve(Y)))) 9: mark(primes()) -> active(primes()) 10: mark(sieve(X)) -> active(sieve(mark(X))) 11: mark(from(X)) -> active(from(mark(X))) 12: mark(s(X)) -> active(s(mark(X))) 13: mark(0()) -> active(0()) 14: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 15: mark(head(X)) -> active(head(mark(X))) 16: mark(tail(X)) -> active(tail(mark(X))) 17: mark(if(X1,X2,X3)) -> active(if(mark(X1),X2,X3)) 18: mark(true()) -> active(true()) 19: mark(false()) -> active(false()) 20: mark(filter(X1,X2)) -> active(filter(mark(X1),mark(X2))) 21: mark(divides(X1,X2)) -> active(divides(mark(X1),mark(X2))) 22: sieve(mark(X)) -> sieve(X) 23: sieve(active(X)) -> sieve(X) 24: from(mark(X)) -> from(X) 25: from(active(X)) -> from(X) 26: s(mark(X)) -> s(X) 27: s(active(X)) -> s(X) 28: cons(mark(X1),X2) -> cons(X1,X2) 29: cons(X1,mark(X2)) -> cons(X1,X2) 30: cons(active(X1),X2) -> cons(X1,X2) 31: cons(X1,active(X2)) -> cons(X1,X2) 32: head(mark(X)) -> head(X) 33: head(active(X)) -> head(X) 34: tail(mark(X)) -> tail(X) 35: tail(active(X)) -> tail(X) 36: if(mark(X1),X2,X3) -> if(X1,X2,X3) 37: if(X1,mark(X2),X3) -> if(X1,X2,X3) 38: if(X1,X2,mark(X3)) -> if(X1,X2,X3) 39: if(active(X1),X2,X3) -> if(X1,X2,X3) 40: if(X1,active(X2),X3) -> if(X1,X2,X3) 41: if(X1,X2,active(X3)) -> if(X1,X2,X3) 42: filter(mark(X1),X2) -> filter(X1,X2) 43: filter(X1,mark(X2)) -> filter(X1,X2) 44: filter(active(X1),X2) -> filter(X1,X2) 45: filter(X1,active(X2)) -> filter(X1,X2) 46: divides(mark(X1),X2) -> divides(X1,X2) 47: divides(X1,mark(X2)) -> divides(X1,X2) 48: divides(active(X1),X2) -> divides(X1,X2) 49: divides(X1,active(X2)) -> divides(X1,X2) Number of strict rules: 49 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(from(X)) -> #mark(cons(X,from(s(X)))) #2: #active(from(X)) -> #cons(X,from(s(X))) #3: #active(from(X)) -> #from(s(X)) #4: #active(from(X)) -> #s(X) #5: #filter(X1,mark(X2)) -> #filter(X1,X2) #6: #cons(X1,mark(X2)) -> #cons(X1,X2) #7: #tail(active(X)) -> #tail(X) #8: #divides(mark(X1),X2) -> #divides(X1,X2) #9: #filter(mark(X1),X2) -> #filter(X1,X2) #10: #if(X1,X2,active(X3)) -> #if(X1,X2,X3) #11: #if(X1,mark(X2),X3) -> #if(X1,X2,X3) #12: #divides(X1,mark(X2)) -> #divides(X1,X2) #13: #divides(active(X1),X2) -> #divides(X1,X2) #14: #if(X1,X2,mark(X3)) -> #if(X1,X2,X3) #15: #active(if(false(),X,Y)) -> #mark(Y) #16: #if(X1,active(X2),X3) -> #if(X1,X2,X3) #17: #mark(0()) -> #active(0()) #18: #mark(primes()) -> #active(primes()) #19: #mark(from(X)) -> #active(from(mark(X))) #20: #mark(from(X)) -> #from(mark(X)) #21: #mark(from(X)) -> #mark(X) #22: #from(mark(X)) -> #from(X) #23: #sieve(active(X)) -> #sieve(X) #24: #filter(X1,active(X2)) -> #filter(X1,X2) #25: #mark(s(X)) -> #active(s(mark(X))) #26: #mark(s(X)) -> #s(mark(X)) #27: #mark(s(X)) -> #mark(X) #28: #cons(X1,active(X2)) -> #cons(X1,X2) #29: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #30: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #31: #mark(cons(X1,X2)) -> #mark(X1) #32: #cons(active(X1),X2) -> #cons(X1,X2) #33: #divides(X1,active(X2)) -> #divides(X1,X2) #34: #from(active(X)) -> #from(X) #35: #mark(filter(X1,X2)) -> #active(filter(mark(X1),mark(X2))) #36: #mark(filter(X1,X2)) -> #filter(mark(X1),mark(X2)) #37: #mark(filter(X1,X2)) -> #mark(X1) #38: #mark(filter(X1,X2)) -> #mark(X2) #39: #active(filter(s(s(X)),cons(Y,Z))) -> #mark(if(divides(s(s(X)),Y),filter(s(s(X)),Z),cons(Y,filter(X,sieve(Y)))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472