details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.278897 seconds
cpu usage	0.090339
user time	0.056312
system time	0.034027
max virtual memory	113188.0
max residence set size	6760.0

stage attributes

key	value
starexec-result	NO

output

NO Input TRS: 1: sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) 2: sel(0(),cons(X,Z)) -> X 3: first(0(),Z) -> nil() 4: first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) 5: from(X) -> cons(X,n__from(s(X))) 6: sel1(s(X),cons(Y,Z)) -> sel1(X,activate(Z)) 7: sel1(0(),cons(X,Z)) -> quote(X) 8: first1(0(),Z) -> nil1() 9: first1(s(X),cons(Y,Z)) -> cons1(quote(Y),first1(X,activate(Z))) 10: quote(n__0()) -> 01() 11: quote1(n__cons(X,Z)) -> cons1(quote(activate(X)),quote1(activate(Z))) 12: quote1(n__nil()) -> nil1() 13: quote(n__s(X)) -> s1(quote(activate(X))) 14: quote(n__sel(X,Z)) -> sel1(activate(X),activate(Z)) 15: quote1(n__first(X,Z)) -> first1(activate(X),activate(Z)) 16: unquote(01()) -> 0() 17: unquote(s1(X)) -> s(unquote(X)) 18: unquote1(nil1()) -> nil() 19: unquote1(cons1(X,Z)) -> fcons(unquote(X),unquote1(Z)) 20: fcons(X,Z) -> cons(X,Z) 21: first(X1,X2) -> n__first(X1,X2) 22: from(X) -> n__from(X) 23: 0() -> n__0() 24: cons(X1,X2) -> n__cons(X1,X2) 25: nil() -> n__nil() 26: s(X) -> n__s(X) 27: sel(X1,X2) -> n__sel(X1,X2) 28: activate(n__first(X1,X2)) -> first(X1,X2) 29: activate(n__from(X)) -> from(X) 30: activate(n__0()) -> 0() 31: activate(n__cons(X1,X2)) -> cons(X1,X2) 32: activate(n__nil()) -> nil() 33: activate(n__s(X)) -> s(X) 34: activate(n__sel(X1,X2)) -> sel(X1,X2) 35: activate(X) -> X Number of strict rules: 35 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #activate(n__from(X)) -> #from(X) #2: #sel1(s(X),cons(Y,Z)) -> #sel1(X,activate(Z)) #3: #sel1(s(X),cons(Y,Z)) -> #activate(Z) #4: #quote(n__s(X)) -> #quote(activate(X)) #5: #quote(n__s(X)) -> #activate(X) #6: #first1(s(X),cons(Y,Z)) -> #quote(Y) #7: #first1(s(X),cons(Y,Z)) -> #first1(X,activate(Z)) #8: #first1(s(X),cons(Y,Z)) -> #activate(Z) #9: #quote1(n__cons(X,Z)) -> #quote(activate(X)) #10: #quote1(n__cons(X,Z)) -> #activate(X) #11: #quote1(n__cons(X,Z)) -> #quote1(activate(Z)) #12: #quote1(n__cons(X,Z)) -> #activate(Z) #13: #activate(n__cons(X1,X2)) -> #cons(X1,X2) #14: #quote(n__sel(X,Z)) -> #sel1(activate(X),activate(Z)) #15: #quote(n__sel(X,Z)) -> #activate(X) #16: #quote(n__sel(X,Z)) -> #activate(Z) #17: #activate(n__0()) -> #0() #18: #fcons(X,Z) -> #cons(X,Z) #19: #sel1(0(),cons(X,Z)) -> #quote(X) #20: #activate(n__s(X)) -> #s(X) #21: #from(X) -> #cons(X,n__from(s(X))) #22: #from(X) -> #s(X) #23: #activate(n__first(X1,X2)) -> #first(X1,X2) #24: #activate(n__sel(X1,X2)) -> #sel(X1,X2) #25: #unquote(s1(X)) -> #s(unquote(X)) #26: #unquote(s1(X)) -> #unquote(X) #27: #activate(n__nil()) -> #nil() #28: #unquote1(cons1(X,Z)) -> #fcons(unquote(X),unquote1(Z)) #29: #unquote1(cons1(X,Z)) -> #unquote(X) #30: #unquote1(cons1(X,Z)) -> #unquote1(Z) #31: #unquote(01()) -> #0() #32: #first(0(),Z) -> #nil() #33: #sel(s(X),cons(Y,Z)) -> #sel(X,activate(Z)) #34: #sel(s(X),cons(Y,Z)) -> #activate(Z) #35: #quote1(n__first(X,Z)) -> #first1(activate(X),activate(Z)) #36: #quote1(n__first(X,Z)) -> #activate(X) #37: #quote1(n__first(X,Z)) -> #activate(Z) #38: #first(s(X),cons(Y,Z)) -> #cons(Y,n__first(X,activate(Z))) #39: #first(s(X),cons(Y,Z)) -> #activate(Z) #40: #unquote1(nil1()) -> #nil() Number of SCCs: 6, DPs: 13 SCC { #26 } POLO(Sum)... succeeded. #0 w: 0 01 w: 0 #cons w: 0 s w: 0 unquote1 w: 0 #quote1 w: 0 n__first w: 0 activate w: 0 #unquote1 w: 0 n__from w: 0 #activate w: 0 #fcons w: 0 #first1 w: 0 n__nil w: 0 n__s w: 0 cons1 w: 0 popout

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

job log

popout

actions

all output return to TRS Standard