details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.107688 seconds
cpu usage	0.039719
user time	0.024324
system time	0.015395
max virtual memory	113188.0
max residence set size	6972.0

stage attributes

key	value
starexec-result	YES

output

YES Input TRS: 1: active(from(X)) -> mark(cons(X,from(s(X)))) 2: active(length(nil())) -> mark(0()) 3: active(length(cons(X,Y))) -> mark(s(length1(Y))) 4: active(length1(X)) -> mark(length(X)) 5: mark(from(X)) -> active(from(mark(X))) 6: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 7: mark(s(X)) -> active(s(mark(X))) 8: mark(length(X)) -> active(length(X)) 9: mark(nil()) -> active(nil()) 10: mark(0()) -> active(0()) 11: mark(length1(X)) -> active(length1(X)) 12: from(mark(X)) -> from(X) 13: from(active(X)) -> from(X) 14: cons(mark(X1),X2) -> cons(X1,X2) 15: cons(X1,mark(X2)) -> cons(X1,X2) 16: cons(active(X1),X2) -> cons(X1,X2) 17: cons(X1,active(X2)) -> cons(X1,X2) 18: s(mark(X)) -> s(X) 19: s(active(X)) -> s(X) 20: length(mark(X)) -> length(X) 21: length(active(X)) -> length(X) 22: length1(mark(X)) -> length1(X) 23: length1(active(X)) -> length1(X) Number of strict rules: 23 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(length(nil())) -> #mark(0()) #2: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #3: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #4: #mark(cons(X1,X2)) -> #mark(X1) #5: #from(active(X)) -> #from(X) #6: #mark(nil()) -> #active(nil()) #7: #mark(length1(X)) -> #active(length1(X)) #8: #length1(active(X)) -> #length1(X) #9: #from(mark(X)) -> #from(X) #10: #cons(mark(X1),X2) -> #cons(X1,X2) #11: #length(mark(X)) -> #length(X) #12: #mark(s(X)) -> #active(s(mark(X))) #13: #mark(s(X)) -> #s(mark(X)) #14: #mark(s(X)) -> #mark(X) #15: #mark(0()) -> #active(0()) #16: #mark(from(X)) -> #active(from(mark(X))) #17: #mark(from(X)) -> #from(mark(X)) #18: #mark(from(X)) -> #mark(X) #19: #length1(mark(X)) -> #length1(X) #20: #cons(X1,active(X2)) -> #cons(X1,X2) #21: #s(active(X)) -> #s(X) #22: #length(active(X)) -> #length(X) #23: #cons(active(X1),X2) -> #cons(X1,X2) #24: #active(length(cons(X,Y))) -> #mark(s(length1(Y))) #25: #active(length(cons(X,Y))) -> #s(length1(Y)) #26: #active(length(cons(X,Y))) -> #length1(Y) #27: #active(from(X)) -> #mark(cons(X,from(s(X)))) #28: #active(from(X)) -> #cons(X,from(s(X))) #29: #active(from(X)) -> #from(s(X)) #30: #active(from(X)) -> #s(X) #31: #mark(length(X)) -> #active(length(X)) #32: #cons(X1,mark(X2)) -> #cons(X1,X2) #33: #active(length1(X)) -> #mark(length(X)) #34: #active(length1(X)) -> #length(X) #35: #s(mark(X)) -> #s(X) Number of SCCs: 6, DPs: 21 SCC { #5 #9 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #length1 w: 0 length1 w: 0 #mark w: 0 0 w: 0 from w: 0 #s w: 0 nil w: 0 mark w: x1 + 1 #from w: x1 active w: x1 + 1 cons w: 0 #active w: 0 length w: 0 #length w: 0 USABLE RULES: { } Removed DPs: #5 #9 Number of SCCs: 5, DPs: 19 SCC { #8 #19 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 #length1 w: x1 length1 w: 0 #mark w: 0 0 w: 0 from w: 0 #s w: 0 nil w: 0 mark w: x1 + 1 #from w: 0 active w: x1 + 1 popout

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

job log

popout

actions

all output return to TRS Standard