Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381717073
details
property
value
status
complete
benchmark
OvConsOS_nosorts_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.911860942841 seconds
cpu usage
1.015693876
max memory
3.2669696E7
stage attributes
key
value
output-size
8869
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: active(zeros()) -> mark(cons(0(),zeros())) 2: active(and(tt(),X)) -> mark(X) 3: active(length(nil())) -> mark(0()) 4: active(length(cons(N,L))) -> mark(s(length(L))) 5: active(take(0(),IL)) -> mark(nil()) 6: active(take(s(M),cons(N,IL))) -> mark(cons(N,take(M,IL))) 7: mark(zeros()) -> active(zeros()) 8: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 9: mark(0()) -> active(0()) 10: mark(and(X1,X2)) -> active(and(mark(X1),X2)) 11: mark(tt()) -> active(tt()) 12: mark(length(X)) -> active(length(mark(X))) 13: mark(nil()) -> active(nil()) 14: mark(s(X)) -> active(s(mark(X))) 15: mark(take(X1,X2)) -> active(take(mark(X1),mark(X2))) 16: cons(mark(X1),X2) -> cons(X1,X2) 17: cons(X1,mark(X2)) -> cons(X1,X2) 18: cons(active(X1),X2) -> cons(X1,X2) 19: cons(X1,active(X2)) -> cons(X1,X2) 20: and(mark(X1),X2) -> and(X1,X2) 21: and(X1,mark(X2)) -> and(X1,X2) 22: and(active(X1),X2) -> and(X1,X2) 23: and(X1,active(X2)) -> and(X1,X2) 24: length(mark(X)) -> length(X) 25: length(active(X)) -> length(X) 26: s(mark(X)) -> s(X) 27: s(active(X)) -> s(X) 28: take(mark(X1),X2) -> take(X1,X2) 29: take(X1,mark(X2)) -> take(X1,X2) 30: take(active(X1),X2) -> take(X1,X2) 31: take(X1,active(X2)) -> take(X1,X2) Number of strict rules: 31 Direct POLO(bPol) ... removes: 3 5 2 s w: x1 take w: x1 + x2 + 2 and w: x1 + x2 + 4 zeros w: 1 0 w: 0 nil w: 1 mark w: x1 active w: x1 cons w: x1 + x2 tt w: 1 length w: x1 + 1 Number of strict rules: 28 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #take(X1,mark(X2)) -> #take(X1,X2) #2: #active(take(s(M),cons(N,IL))) -> #mark(cons(N,take(M,IL))) #3: #active(take(s(M),cons(N,IL))) -> #cons(N,take(M,IL)) #4: #active(take(s(M),cons(N,IL))) -> #take(M,IL) #5: #mark(nil()) -> #active(nil()) #6: #mark(0()) -> #active(0()) #7: #mark(tt()) -> #active(tt()) #8: #length(mark(X)) -> #length(X) #9: #and(X1,active(X2)) -> #and(X1,X2) #10: #mark(length(X)) -> #active(length(mark(X))) #11: #mark(length(X)) -> #length(mark(X)) #12: #mark(length(X)) -> #mark(X) #13: #take(X1,active(X2)) -> #take(X1,X2) #14: #mark(s(X)) -> #active(s(mark(X))) #15: #mark(s(X)) -> #s(mark(X)) #16: #mark(s(X)) -> #mark(X) #17: #take(active(X1),X2) -> #take(X1,X2) #18: #length(active(X)) -> #length(X) #19: #and(mark(X1),X2) -> #and(X1,X2) #20: #mark(zeros()) -> #active(zeros()) #21: #mark(and(X1,X2)) -> #active(and(mark(X1),X2)) #22: #mark(and(X1,X2)) -> #and(mark(X1),X2) #23: #mark(and(X1,X2)) -> #mark(X1) #24: #take(mark(X1),X2) -> #take(X1,X2) #25: #and(active(X1),X2) -> #and(X1,X2) #26: #s(active(X)) -> #s(X) #27: #cons(X1,mark(X2)) -> #cons(X1,X2) #28: #cons(X1,active(X2)) -> #cons(X1,X2) #29: #s(mark(X)) -> #s(X) #30: #and(X1,mark(X2)) -> #and(X1,X2) #31: #cons(mark(X1),X2) -> #cons(X1,X2) #32: #active(zeros()) -> #mark(cons(0(),zeros())) #33: #active(zeros()) -> #cons(0(),zeros()) #34: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #35: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #36: #mark(cons(X1,X2)) -> #mark(X1) #37: #mark(take(X1,X2)) -> #active(take(mark(X1),mark(X2))) #38: #mark(take(X1,X2)) -> #take(mark(X1),mark(X2)) #39: #mark(take(X1,X2)) -> #mark(X1) #40: #mark(take(X1,X2)) -> #mark(X2) #41: #active(length(cons(N,L))) -> #mark(s(length(L))) #42: #active(length(cons(N,L))) -> #s(length(L)) #43: #active(length(cons(N,L))) -> #length(L) #44: #cons(active(X1),X2) -> #cons(X1,X2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472