details

property	value
status	complete
benchmark	ExIntrod_GM99_C.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n005.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	28.781498909 seconds
cpu usage	30.544396019
max memory	2.27065856E8

stage attributes

key	value
output-size	10723
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: active(sieve(X)) -> sieve(active(X)) 10: active(from(X)) -> from(active(X)) 11: active(s(X)) -> s(active(X)) 12: active(cons(X1,X2)) -> cons(active(X1),X2) 13: active(head(X)) -> head(active(X)) 14: active(tail(X)) -> tail(active(X)) 15: active(if(X1,X2,X3)) -> if(active(X1),X2,X3) 16: active(filter(X1,X2)) -> filter(active(X1),X2) 17: active(filter(X1,X2)) -> filter(X1,active(X2)) 18: active(divides(X1,X2)) -> divides(active(X1),X2) 19: active(divides(X1,X2)) -> divides(X1,active(X2)) 20: sieve(mark(X)) -> mark(sieve(X)) 21: from(mark(X)) -> mark(from(X)) 22: s(mark(X)) -> mark(s(X)) 23: cons(mark(X1),X2) -> mark(cons(X1,X2)) 24: head(mark(X)) -> mark(head(X)) 25: tail(mark(X)) -> mark(tail(X)) 26: if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) 27: filter(mark(X1),X2) -> mark(filter(X1,X2)) 28: filter(X1,mark(X2)) -> mark(filter(X1,X2)) 29: divides(mark(X1),X2) -> mark(divides(X1,X2)) 30: divides(X1,mark(X2)) -> mark(divides(X1,X2)) 31: proper(primes()) -> ok(primes()) 32: proper(sieve(X)) -> sieve(proper(X)) 33: proper(from(X)) -> from(proper(X)) 34: proper(s(X)) -> s(proper(X)) 35: proper(0()) -> ok(0()) 36: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 37: proper(head(X)) -> head(proper(X)) 38: proper(tail(X)) -> tail(proper(X)) 39: proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) 40: proper(true()) -> ok(true()) 41: proper(false()) -> ok(false()) 42: proper(filter(X1,X2)) -> filter(proper(X1),proper(X2)) 43: proper(divides(X1,X2)) -> divides(proper(X1),proper(X2)) 44: sieve(ok(X)) -> ok(sieve(X)) 45: from(ok(X)) -> ok(from(X)) 46: s(ok(X)) -> ok(s(X)) 47: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 48: head(ok(X)) -> ok(head(X)) 49: tail(ok(X)) -> ok(tail(X)) 50: if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) 51: filter(ok(X1),ok(X2)) -> ok(filter(X1,X2)) 52: divides(ok(X1),ok(X2)) -> ok(divides(X1,X2)) 53: top(mark(X)) -> top(proper(X)) 54: top(ok(X)) -> top(active(X)) Number of strict rules: 54 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #active(from(X)) -> #cons(X,from(s(X))) #2: #active(from(X)) -> #from(s(X)) #3: #active(from(X)) -> #s(X) #4: #proper(divides(X1,X2)) -> #divides(proper(X1),proper(X2)) #5: #proper(divides(X1,X2)) -> #proper(X1) #6: #proper(divides(X1,X2)) -> #proper(X2) #7: #divides(mark(X1),X2) -> #divides(X1,X2) #8: #s(ok(X)) -> #s(X) #9: #proper(filter(X1,X2)) -> #filter(proper(X1),proper(X2)) #10: #proper(filter(X1,X2)) -> #proper(X1) #11: #proper(filter(X1,X2)) -> #proper(X2) #12: #proper(head(X)) -> #head(proper(X)) #13: #proper(head(X)) -> #proper(X) #14: #cons(ok(X1),ok(X2)) -> #cons(X1,X2) #15: #top(mark(X)) -> #top(proper(X)) #16: #top(mark(X)) -> #proper(X) #17: #head(ok(X)) -> #head(X) #18: #proper(tail(X)) -> #tail(proper(X)) #19: #proper(tail(X)) -> #proper(X) #20: #filter(ok(X1),ok(X2)) -> #filter(X1,X2) #21: #active(head(X)) -> #head(active(X)) #22: #active(head(X)) -> #active(X) #23: #active(sieve(X)) -> #sieve(active(X)) #24: #active(sieve(X)) -> #active(X) #25: #active(s(X)) -> #s(active(X)) #26: #active(s(X)) -> #active(X) #27: #head(mark(X)) -> #head(X) #28: #cons(mark(X1),X2) -> #cons(X1,X2) #29: #from(ok(X)) -> #from(X) #30: #active(cons(X1,X2)) -> #cons(active(X1),X2) #31: #active(cons(X1,X2)) -> #active(X1) #32: #active(tail(X)) -> #tail(active(X)) #33: #active(tail(X)) -> #active(X) #34: #divides(X1,mark(X2)) -> #divides(X1,X2) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard