details

property	value
status	complete
benchmark	Ex3_12_Luc96a_C.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.497955 seconds
cpu usage	0.119808
user time	0.075782
system time	0.044026
max virtual memory	113188.0
max residence set size	8020.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to TRS Standard