details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.135426 seconds
cpu usage	0.036919
user time	0.01262
system time	0.024299
max virtual memory	113188.0
max residence set size	7908.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to TRS Standard