details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.094507932663 seconds
cpu usage	0.103602084
max memory	8695808.0

stage attributes

key	value
output-size	7926
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(eq(0(),0())) -> mark(true()) 2: active(eq(s(X),s(Y))) -> mark(eq(X,Y)) 3: active(eq(X,Y)) -> mark(false()) 4: active(inf(X)) -> mark(cons(X,inf(s(X)))) 5: active(take(0(),X)) -> mark(nil()) 6: active(take(s(X),cons(Y,L))) -> mark(cons(Y,take(X,L))) 7: active(length(nil())) -> mark(0()) 8: active(length(cons(X,L))) -> mark(s(length(L))) 9: mark(eq(X1,X2)) -> active(eq(X1,X2)) 10: mark(0()) -> active(0()) 11: mark(true()) -> active(true()) 12: mark(s(X)) -> active(s(X)) 13: mark(false()) -> active(false()) 14: mark(inf(X)) -> active(inf(mark(X))) 15: mark(cons(X1,X2)) -> active(cons(X1,X2)) 16: mark(take(X1,X2)) -> active(take(mark(X1),mark(X2))) 17: mark(nil()) -> active(nil()) 18: mark(length(X)) -> active(length(mark(X))) 19: eq(mark(X1),X2) -> eq(X1,X2) 20: eq(X1,mark(X2)) -> eq(X1,X2) 21: eq(active(X1),X2) -> eq(X1,X2) 22: eq(X1,active(X2)) -> eq(X1,X2) 23: s(mark(X)) -> s(X) 24: s(active(X)) -> s(X) 25: inf(mark(X)) -> inf(X) 26: inf(active(X)) -> inf(X) 27: cons(mark(X1),X2) -> cons(X1,X2) 28: cons(X1,mark(X2)) -> cons(X1,X2) 29: cons(active(X1),X2) -> cons(X1,X2) 30: cons(X1,active(X2)) -> cons(X1,X2) 31: take(mark(X1),X2) -> take(X1,X2) 32: take(X1,mark(X2)) -> take(X1,X2) 33: take(active(X1),X2) -> take(X1,X2) 34: take(X1,active(X2)) -> take(X1,X2) 35: length(mark(X)) -> length(X) 36: length(active(X)) -> length(X) Number of strict rules: 36 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(eq(s(X),s(Y))) -> #mark(eq(X,Y)) #2: #active(eq(s(X),s(Y))) -> #eq(X,Y) #3: #cons(active(X1),X2) -> #cons(X1,X2) #4: #length(mark(X)) -> #length(X) #5: #active(take(s(X),cons(Y,L))) -> #mark(cons(Y,take(X,L))) #6: #active(take(s(X),cons(Y,L))) -> #cons(Y,take(X,L)) #7: #active(take(s(X),cons(Y,L))) -> #take(X,L) #8: #mark(false()) -> #active(false()) #9: #mark(eq(X1,X2)) -> #active(eq(X1,X2)) #10: #mark(true()) -> #active(true()) #11: #s(active(X)) -> #s(X) #12: #s(mark(X)) -> #s(X) #13: #mark(s(X)) -> #active(s(X)) #14: #take(mark(X1),X2) -> #take(X1,X2) #15: #mark(inf(X)) -> #active(inf(mark(X))) #16: #mark(inf(X)) -> #inf(mark(X)) #17: #mark(inf(X)) -> #mark(X) #18: #cons(X1,active(X2)) -> #cons(X1,X2) #19: #inf(mark(X)) -> #inf(X) #20: #eq(X1,mark(X2)) -> #eq(X1,X2) #21: #active(length(nil())) -> #mark(0()) #22: #mark(0()) -> #active(0()) #23: #take(active(X1),X2) -> #take(X1,X2) #24: #active(take(0(),X)) -> #mark(nil()) #25: #cons(X1,mark(X2)) -> #cons(X1,X2) #26: #eq(X1,active(X2)) -> #eq(X1,X2) #27: #take(X1,active(X2)) -> #take(X1,X2) #28: #cons(mark(X1),X2) -> #cons(X1,X2) #29: #mark(nil()) -> #active(nil()) #30: #take(X1,mark(X2)) -> #take(X1,X2) #31: #eq(mark(X1),X2) -> #eq(X1,X2) #32: #inf(active(X)) -> #inf(X) #33: #length(active(X)) -> #length(X) #34: #eq(active(X1),X2) -> #eq(X1,X2) #35: #mark(take(X1,X2)) -> #active(take(mark(X1),mark(X2))) #36: #mark(take(X1,X2)) -> #take(mark(X1),mark(X2)) #37: #mark(take(X1,X2)) -> #mark(X1) #38: #mark(take(X1,X2)) -> #mark(X2) #39: #active(eq(X,Y)) -> #mark(false()) #40: #active(eq(0(),0())) -> #mark(true()) #41: #active(length(cons(X,L))) -> #mark(s(length(L))) #42: #active(length(cons(X,L))) -> #s(length(L)) #43: #active(length(cons(X,L))) -> #length(L) #44: #mark(cons(X1,X2)) -> #active(cons(X1,X2)) #45: #active(inf(X)) -> #mark(cons(X,inf(s(X)))) #46: #active(inf(X)) -> #cons(X,inf(s(X))) #47: #active(inf(X)) -> #inf(s(X)) #48: #active(inf(X)) -> #s(X) #49: #mark(length(X)) -> #active(length(mark(X))) #50: #mark(length(X)) -> #length(mark(X)) #51: #mark(length(X)) -> #mark(X) Number of SCCs: 8, DPs: 24 popout

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

job log

popout

actions

all output return to TRS Stand 20472