Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715888
details
property
value
status
complete
benchmark
OvConsOS_nosorts_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n014.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
2.16897320747 seconds
cpu usage
2.272794637
max memory
3.7912576E7
stage attributes
key
value
output-size
5641
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: active(cons(X1,X2)) -> cons(active(X1),X2) 8: active(and(X1,X2)) -> and(active(X1),X2) 9: active(length(X)) -> length(active(X)) 10: active(s(X)) -> s(active(X)) 11: active(take(X1,X2)) -> take(active(X1),X2) 12: active(take(X1,X2)) -> take(X1,active(X2)) 13: cons(mark(X1),X2) -> mark(cons(X1,X2)) 14: and(mark(X1),X2) -> mark(and(X1,X2)) 15: length(mark(X)) -> mark(length(X)) 16: s(mark(X)) -> mark(s(X)) 17: take(mark(X1),X2) -> mark(take(X1,X2)) 18: take(X1,mark(X2)) -> mark(take(X1,X2)) 19: proper(zeros()) -> ok(zeros()) 20: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 21: proper(0()) -> ok(0()) 22: proper(and(X1,X2)) -> and(proper(X1),proper(X2)) 23: proper(tt()) -> ok(tt()) 24: proper(length(X)) -> length(proper(X)) 25: proper(nil()) -> ok(nil()) 26: proper(s(X)) -> s(proper(X)) 27: proper(take(X1,X2)) -> take(proper(X1),proper(X2)) 28: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 29: and(ok(X1),ok(X2)) -> ok(and(X1,X2)) 30: length(ok(X)) -> ok(length(X)) 31: s(ok(X)) -> ok(s(X)) 32: take(ok(X1),ok(X2)) -> ok(take(X1,X2)) 33: top(mark(X)) -> top(proper(X)) 34: top(ok(X)) -> top(active(X)) Number of strict rules: 34 Direct POLO(bPol) ... removes: 2 s w: 2 * x1 take w: x1 + x2 top w: x1 and w: x1 + 2 * x2 + 2 zeros w: 0 proper w: x1 ok w: x1 0 w: 0 nil w: 0 mark w: x1 active w: x1 cons w: x1 + 2 * x2 tt w: 1 length w: x1 Number of strict rules: 33 Direct POLO(bPol) ... removes: 3 5 s w: x1 take w: x1 + x2 + 3 top w: x1 and w: 2 * x1 + x2 + 1 zeros w: 0 proper w: x1 ok w: x1 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: 31 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #and(ok(X1),ok(X2)) -> #and(X1,X2) #2: #active(take(s(M),cons(N,IL))) -> #cons(N,take(M,IL)) #3: #active(take(s(M),cons(N,IL))) -> #take(M,IL) #4: #cons(mark(X1),X2) -> #cons(X1,X2) #5: #active(length(X)) -> #length(active(X)) #6: #active(length(X)) -> #active(X) #7: #active(take(X1,X2)) -> #take(active(X1),X2) #8: #active(take(X1,X2)) -> #active(X1) #9: #proper(length(X)) -> #length(proper(X)) #10: #proper(length(X)) -> #proper(X) #11: #active(take(X1,X2)) -> #take(X1,active(X2)) #12: #active(take(X1,X2)) -> #active(X2) #13: #s(ok(X)) -> #s(X) #14: #and(mark(X1),X2) -> #and(X1,X2) #15: #length(ok(X)) -> #length(X) #16: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #17: #proper(cons(X1,X2)) -> #proper(X1) #18: #proper(cons(X1,X2)) -> #proper(X2) #19: #active(cons(X1,X2)) -> #cons(active(X1),X2) #20: #active(cons(X1,X2)) -> #active(X1) #21: #active(s(X)) -> #s(active(X)) #22: #active(s(X)) -> #active(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472