Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487070246
details
property
value
status
complete
benchmark
Ex6_Luc98_C.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.295869 seconds
cpu usage
0.048395
user time
0.034015
system time
0.01438
max virtual memory
113188.0
max residence set size
9240.0
stage attributes
key
value
starexec-result
YES
output
YES Input TRS: 1: active(first(0(),X)) -> mark(nil()) 2: active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) 3: active(from(X)) -> mark(cons(X,from(s(X)))) 4: active(first(X1,X2)) -> first(active(X1),X2) 5: active(first(X1,X2)) -> first(X1,active(X2)) 6: active(s(X)) -> s(active(X)) 7: active(cons(X1,X2)) -> cons(active(X1),X2) 8: active(from(X)) -> from(active(X)) 9: first(mark(X1),X2) -> mark(first(X1,X2)) 10: first(X1,mark(X2)) -> mark(first(X1,X2)) 11: s(mark(X)) -> mark(s(X)) 12: cons(mark(X1),X2) -> mark(cons(X1,X2)) 13: from(mark(X)) -> mark(from(X)) 14: proper(first(X1,X2)) -> first(proper(X1),proper(X2)) 15: proper(0()) -> ok(0()) 16: proper(nil()) -> ok(nil()) 17: proper(s(X)) -> s(proper(X)) 18: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 19: proper(from(X)) -> from(proper(X)) 20: first(ok(X1),ok(X2)) -> ok(first(X1,X2)) 21: s(ok(X)) -> ok(s(X)) 22: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 23: from(ok(X)) -> ok(from(X)) 24: top(mark(X)) -> top(proper(X)) 25: top(ok(X)) -> top(active(X)) Number of strict rules: 25 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(first(s(X),cons(Y,Z))) -> #cons(Y,first(X,Z)) #2: #active(first(s(X),cons(Y,Z))) -> #first(X,Z) #3: #active(s(X)) -> #s(active(X)) #4: #active(s(X)) -> #active(X) #5: #from(mark(X)) -> #from(X) #6: #first(mark(X1),X2) -> #first(X1,X2) #7: #s(mark(X)) -> #s(X) #8: #top(mark(X)) -> #top(proper(X)) #9: #top(mark(X)) -> #proper(X) #10: #from(ok(X)) -> #from(X) #11: #cons(mark(X1),X2) -> #cons(X1,X2) #12: #proper(first(X1,X2)) -> #first(proper(X1),proper(X2)) #13: #proper(first(X1,X2)) -> #proper(X1) #14: #proper(first(X1,X2)) -> #proper(X2) #15: #top(ok(X)) -> #top(active(X)) #16: #top(ok(X)) -> #active(X) #17: #first(ok(X1),ok(X2)) -> #first(X1,X2) #18: #active(cons(X1,X2)) -> #cons(active(X1),X2) #19: #active(cons(X1,X2)) -> #active(X1) #20: #first(X1,mark(X2)) -> #first(X1,X2) #21: #active(first(X1,X2)) -> #first(X1,active(X2)) #22: #active(first(X1,X2)) -> #active(X2) #23: #cons(ok(X1),ok(X2)) -> #cons(X1,X2) #24: #proper(s(X)) -> #s(proper(X)) #25: #proper(s(X)) -> #proper(X) #26: #proper(from(X)) -> #from(proper(X)) #27: #proper(from(X)) -> #proper(X) #28: #s(ok(X)) -> #s(X) #29: #active(from(X)) -> #cons(X,from(s(X))) #30: #active(from(X)) -> #from(s(X)) #31: #active(from(X)) -> #s(X) #32: #active(from(X)) -> #from(active(X)) #33: #active(from(X)) -> #active(X) #34: #active(first(X1,X2)) -> #first(active(X1),X2) #35: #active(first(X1,X2)) -> #active(X1) #36: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #37: #proper(cons(X1,X2)) -> #proper(X1) #38: #proper(cons(X1,X2)) -> #proper(X2) Number of SCCs: 7, DPs: 22 SCC { #7 #28 } 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 from w: 0 #s w: x1 #first w: 0 nil w: 0 mark w: x1 + 1 first w: 0 #proper w: 0 #from w: 0 active w: 0 cons w: 0 #active w: 0 USABLE RULES: { } Removed DPs: #7 #28 Number of SCCs: 6, DPs: 20 SCC { #5 #10 } POLO(Sum)... succeeded. #cons w: 0 s w: 0 top w: 0 #top w: 0 proper w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard