Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715000
details
property
value
status
complete
benchmark
Ex7_BLR02_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.690896987915 seconds
cpu usage
0.80831608
max memory
3.231744E7
stage attributes
key
value
output-size
13129
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(from(X)) -> mark(cons(X,from(s(X)))) 2: active(head(cons(X,XS))) -> mark(X) 3: active(2nd(cons(X,XS))) -> mark(head(XS)) 4: active(take(0(),XS)) -> mark(nil()) 5: active(take(s(N),cons(X,XS))) -> mark(cons(X,take(N,XS))) 6: active(sel(0(),cons(X,XS))) -> mark(X) 7: active(sel(s(N),cons(X,XS))) -> mark(sel(N,XS)) 8: active(from(X)) -> from(active(X)) 9: active(cons(X1,X2)) -> cons(active(X1),X2) 10: active(s(X)) -> s(active(X)) 11: active(head(X)) -> head(active(X)) 12: active(2nd(X)) -> 2nd(active(X)) 13: active(take(X1,X2)) -> take(active(X1),X2) 14: active(take(X1,X2)) -> take(X1,active(X2)) 15: active(sel(X1,X2)) -> sel(active(X1),X2) 16: active(sel(X1,X2)) -> sel(X1,active(X2)) 17: from(mark(X)) -> mark(from(X)) 18: cons(mark(X1),X2) -> mark(cons(X1,X2)) 19: s(mark(X)) -> mark(s(X)) 20: head(mark(X)) -> mark(head(X)) 21: 2nd(mark(X)) -> mark(2nd(X)) 22: take(mark(X1),X2) -> mark(take(X1,X2)) 23: take(X1,mark(X2)) -> mark(take(X1,X2)) 24: sel(mark(X1),X2) -> mark(sel(X1,X2)) 25: sel(X1,mark(X2)) -> mark(sel(X1,X2)) 26: proper(from(X)) -> from(proper(X)) 27: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 28: proper(s(X)) -> s(proper(X)) 29: proper(head(X)) -> head(proper(X)) 30: proper(2nd(X)) -> 2nd(proper(X)) 31: proper(take(X1,X2)) -> take(proper(X1),proper(X2)) 32: proper(0()) -> ok(0()) 33: proper(nil()) -> ok(nil()) 34: proper(sel(X1,X2)) -> sel(proper(X1),proper(X2)) 35: from(ok(X)) -> ok(from(X)) 36: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 37: s(ok(X)) -> ok(s(X)) 38: head(ok(X)) -> ok(head(X)) 39: 2nd(ok(X)) -> ok(2nd(X)) 40: take(ok(X1),ok(X2)) -> ok(take(X1,X2)) 41: sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) 42: top(mark(X)) -> top(proper(X)) 43: top(ok(X)) -> top(active(X)) Number of strict rules: 43 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #top(ok(X)) -> #top(active(X)) #2: #top(ok(X)) -> #active(X) #3: #proper(head(X)) -> #head(proper(X)) #4: #proper(head(X)) -> #proper(X) #5: #from(ok(X)) -> #from(X) #6: #top(mark(X)) -> #top(proper(X)) #7: #top(mark(X)) -> #proper(X) #8: #sel(ok(X1),ok(X2)) -> #sel(X1,X2) #9: #s(ok(X)) -> #s(X) #10: #head(ok(X)) -> #head(X) #11: #take(ok(X1),ok(X2)) -> #take(X1,X2) #12: #active(take(X1,X2)) -> #take(active(X1),X2) #13: #active(take(X1,X2)) -> #active(X1) #14: #active(cons(X1,X2)) -> #cons(active(X1),X2) #15: #active(cons(X1,X2)) -> #active(X1) #16: #active(head(X)) -> #head(active(X)) #17: #active(head(X)) -> #active(X) #18: #sel(mark(X1),X2) -> #sel(X1,X2) #19: #take(X1,mark(X2)) -> #take(X1,X2) #20: #active(2nd(X)) -> #2nd(active(X)) #21: #active(2nd(X)) -> #active(X) #22: #proper(take(X1,X2)) -> #take(proper(X1),proper(X2)) #23: #proper(take(X1,X2)) -> #proper(X1) #24: #proper(take(X1,X2)) -> #proper(X2) #25: #active(take(X1,X2)) -> #take(X1,active(X2)) #26: #active(take(X1,X2)) -> #active(X2) #27: #proper(2nd(X)) -> #2nd(proper(X)) #28: #proper(2nd(X)) -> #proper(X) #29: #sel(X1,mark(X2)) -> #sel(X1,X2) #30: #head(mark(X)) -> #head(X) #31: #active(sel(s(N),cons(X,XS))) -> #sel(N,XS) #32: #2nd(ok(X)) -> #2nd(X) #33: #active(s(X)) -> #s(active(X)) #34: #active(s(X)) -> #active(X) #35: #active(take(s(N),cons(X,XS))) -> #cons(X,take(N,XS)) #36: #active(take(s(N),cons(X,XS))) -> #take(N,XS) #37: #proper(s(X)) -> #s(proper(X)) #38: #proper(s(X)) -> #proper(X) #39: #take(mark(X1),X2) -> #take(X1,X2) #40: #proper(sel(X1,X2)) -> #sel(proper(X1),proper(X2)) #41: #proper(sel(X1,X2)) -> #proper(X1) #42: #proper(sel(X1,X2)) -> #proper(X2) #43: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #44: #proper(cons(X1,X2)) -> #proper(X1) #45: #proper(cons(X1,X2)) -> #proper(X2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472