Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381717068
details
property
value
status
complete
benchmark
ExSec4_2_DLMMU04_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
2.00523805618 seconds
cpu usage
2.262161266
max memory
5.361664E7
stage attributes
key
value
output-size
28629
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) 2: active(fst(pair(XS,YS))) -> mark(XS) 3: active(snd(pair(XS,YS))) -> mark(YS) 4: active(splitAt(0(),XS)) -> mark(pair(nil(),XS)) 5: active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) 6: active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) 7: active(head(cons(N,XS))) -> mark(N) 8: active(tail(cons(N,XS))) -> mark(XS) 9: active(sel(N,XS)) -> mark(head(afterNth(N,XS))) 10: active(take(N,XS)) -> mark(fst(splitAt(N,XS))) 11: active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) 12: active(natsFrom(X)) -> natsFrom(active(X)) 13: active(cons(X1,X2)) -> cons(active(X1),X2) 14: active(s(X)) -> s(active(X)) 15: active(fst(X)) -> fst(active(X)) 16: active(pair(X1,X2)) -> pair(active(X1),X2) 17: active(pair(X1,X2)) -> pair(X1,active(X2)) 18: active(snd(X)) -> snd(active(X)) 19: active(splitAt(X1,X2)) -> splitAt(active(X1),X2) 20: active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) 21: active(u(X1,X2,X3,X4)) -> u(active(X1),X2,X3,X4) 22: active(head(X)) -> head(active(X)) 23: active(tail(X)) -> tail(active(X)) 24: active(sel(X1,X2)) -> sel(active(X1),X2) 25: active(sel(X1,X2)) -> sel(X1,active(X2)) 26: active(afterNth(X1,X2)) -> afterNth(active(X1),X2) 27: active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) 28: active(take(X1,X2)) -> take(active(X1),X2) 29: active(take(X1,X2)) -> take(X1,active(X2)) 30: natsFrom(mark(X)) -> mark(natsFrom(X)) 31: cons(mark(X1),X2) -> mark(cons(X1,X2)) 32: s(mark(X)) -> mark(s(X)) 33: fst(mark(X)) -> mark(fst(X)) 34: pair(mark(X1),X2) -> mark(pair(X1,X2)) 35: pair(X1,mark(X2)) -> mark(pair(X1,X2)) 36: snd(mark(X)) -> mark(snd(X)) 37: splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) 38: splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) 39: u(mark(X1),X2,X3,X4) -> mark(u(X1,X2,X3,X4)) 40: head(mark(X)) -> mark(head(X)) 41: tail(mark(X)) -> mark(tail(X)) 42: sel(mark(X1),X2) -> mark(sel(X1,X2)) 43: sel(X1,mark(X2)) -> mark(sel(X1,X2)) 44: afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) 45: afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) 46: take(mark(X1),X2) -> mark(take(X1,X2)) 47: take(X1,mark(X2)) -> mark(take(X1,X2)) 48: proper(natsFrom(X)) -> natsFrom(proper(X)) 49: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 50: proper(s(X)) -> s(proper(X)) 51: proper(fst(X)) -> fst(proper(X)) 52: proper(pair(X1,X2)) -> pair(proper(X1),proper(X2)) 53: proper(snd(X)) -> snd(proper(X)) 54: proper(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) 55: proper(0()) -> ok(0()) 56: proper(nil()) -> ok(nil()) 57: proper(u(X1,X2,X3,X4)) -> u(proper(X1),proper(X2),proper(X3),proper(X4)) 58: proper(head(X)) -> head(proper(X)) 59: proper(tail(X)) -> tail(proper(X)) 60: proper(sel(X1,X2)) -> sel(proper(X1),proper(X2)) 61: proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) 62: proper(take(X1,X2)) -> take(proper(X1),proper(X2)) 63: natsFrom(ok(X)) -> ok(natsFrom(X)) 64: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 65: s(ok(X)) -> ok(s(X)) 66: fst(ok(X)) -> ok(fst(X)) 67: pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) 68: snd(ok(X)) -> ok(snd(X)) 69: splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) 70: u(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(u(X1,X2,X3,X4)) 71: head(ok(X)) -> ok(head(X)) 72: tail(ok(X)) -> ok(tail(X)) 73: sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) 74: afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) 75: take(ok(X1),ok(X2)) -> ok(take(X1,X2)) 76: top(mark(X)) -> top(proper(X)) 77: top(ok(X)) -> top(active(X)) Number of strict rules: 77 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #sel(X1,mark(X2)) -> #sel(X1,X2) #2: #active(take(X1,X2)) -> #take(X1,active(X2)) #3: #active(take(X1,X2)) -> #active(X2) #4: #pair(X1,mark(X2)) -> #pair(X1,X2) #5: #fst(ok(X)) -> #fst(X) #6: #take(mark(X1),X2) -> #take(X1,X2) #7: #sel(mark(X1),X2) -> #sel(X1,X2) #8: #tail(mark(X)) -> #tail(X) #9: #splitAt(mark(X1),X2) -> #splitAt(X1,X2) #10: #sel(ok(X1),ok(X2)) -> #sel(X1,X2) #11: #take(X1,mark(X2)) -> #take(X1,X2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472