Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487070191
details
property
value
status
complete
benchmark
Ex4_Zan97_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n181.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.489972 seconds
cpu usage
0.143806
user time
0.093949
system time
0.049857
max virtual memory
113188.0
max residence set size
6976.0
stage attributes
key
value
starexec-result
YES
output
YES Input TRS: 1: active(f(X)) -> mark(cons(X,f(g(X)))) 2: active(g(0())) -> mark(s(0())) 3: active(g(s(X))) -> mark(s(s(g(X)))) 4: active(sel(0(),cons(X,Y))) -> mark(X) 5: active(sel(s(X),cons(Y,Z))) -> mark(sel(X,Z)) 6: mark(f(X)) -> active(f(mark(X))) 7: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 8: mark(g(X)) -> active(g(mark(X))) 9: mark(0()) -> active(0()) 10: mark(s(X)) -> active(s(mark(X))) 11: mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2))) 12: f(mark(X)) -> f(X) 13: f(active(X)) -> f(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: g(mark(X)) -> g(X) 19: g(active(X)) -> g(X) 20: s(mark(X)) -> s(X) 21: s(active(X)) -> s(X) 22: sel(mark(X1),X2) -> sel(X1,X2) 23: sel(X1,mark(X2)) -> sel(X1,X2) 24: sel(active(X1),X2) -> sel(X1,X2) 25: sel(X1,active(X2)) -> sel(X1,X2) Number of strict rules: 25 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(g(0())) -> #mark(s(0())) #2: #active(g(0())) -> #s(0()) #3: #mark(f(X)) -> #active(f(mark(X))) #4: #mark(f(X)) -> #f(mark(X)) #5: #mark(f(X)) -> #mark(X) #6: #f(active(X)) -> #f(X) #7: #mark(0()) -> #active(0()) #8: #mark(sel(X1,X2)) -> #active(sel(mark(X1),mark(X2))) #9: #mark(sel(X1,X2)) -> #sel(mark(X1),mark(X2)) #10: #mark(sel(X1,X2)) -> #mark(X1) #11: #mark(sel(X1,X2)) -> #mark(X2) #12: #sel(active(X1),X2) -> #sel(X1,X2) #13: #sel(X1,mark(X2)) -> #sel(X1,X2) #14: #f(mark(X)) -> #f(X) #15: #cons(mark(X1),X2) -> #cons(X1,X2) #16: #sel(X1,active(X2)) -> #sel(X1,X2) #17: #s(mark(X)) -> #s(X) #18: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #19: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #20: #mark(cons(X1,X2)) -> #mark(X1) #21: #mark(s(X)) -> #active(s(mark(X))) #22: #mark(s(X)) -> #s(mark(X)) #23: #mark(s(X)) -> #mark(X) #24: #active(sel(s(X),cons(Y,Z))) -> #mark(sel(X,Z)) #25: #active(sel(s(X),cons(Y,Z))) -> #sel(X,Z) #26: #sel(mark(X1),X2) -> #sel(X1,X2) #27: #cons(X1,active(X2)) -> #cons(X1,X2) #28: #g(active(X)) -> #g(X) #29: #s(active(X)) -> #s(X) #30: #cons(active(X1),X2) -> #cons(X1,X2) #31: #active(g(s(X))) -> #mark(s(s(g(X)))) #32: #active(g(s(X))) -> #s(s(g(X))) #33: #active(g(s(X))) -> #s(g(X)) #34: #active(g(s(X))) -> #g(X) #35: #active(f(X)) -> #mark(cons(X,f(g(X)))) #36: #active(f(X)) -> #cons(X,f(g(X))) #37: #active(f(X)) -> #f(g(X)) #38: #active(f(X)) -> #g(X) #39: #mark(g(X)) -> #active(g(mark(X))) #40: #mark(g(X)) -> #g(mark(X)) #41: #mark(g(X)) -> #mark(X) #42: #cons(X1,mark(X2)) -> #cons(X1,X2) #43: #active(sel(0(),cons(X,Y))) -> #mark(X) #44: #g(mark(X)) -> #g(X) Number of SCCs: 6, DPs: 28 SCC { #6 #14 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 f w: 0 #mark w: 0 0 w: 0 #sel w: 0 sel w: 0 #s w: 0 mark w: x1 + 1 #f w: x1 #g w: 0 active w: x1 + 1 cons w: 0 #active w: 0 g w: 0 USABLE RULES: { } Removed DPs: #6 #14 Number of SCCs: 5, DPs: 26 SCC { #17 #29 } POLO(Sum)... succeeded. #cons w: 0 s w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard