Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715268
details
property
value
status
complete
benchmark
Ex5_DLMMU04_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n088.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.982558012009 seconds
cpu usage
1.007983168
max memory
1.368064E7
stage attributes
key
value
output-size
16546
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(pairNs()) -> mark(cons(0(),incr(oddNs()))) 2: active(oddNs()) -> mark(incr(pairNs())) 3: active(incr(cons(X,XS))) -> mark(cons(s(X),incr(XS))) 4: active(take(0(),XS)) -> mark(nil()) 5: active(take(s(N),cons(X,XS))) -> mark(cons(X,take(N,XS))) 6: active(zip(nil(),XS)) -> mark(nil()) 7: active(zip(X,nil())) -> mark(nil()) 8: active(zip(cons(X,XS),cons(Y,YS))) -> mark(cons(pair(X,Y),zip(XS,YS))) 9: active(tail(cons(X,XS))) -> mark(XS) 10: active(repItems(nil())) -> mark(nil()) 11: active(repItems(cons(X,XS))) -> mark(cons(X,cons(X,repItems(XS)))) 12: active(cons(X1,X2)) -> cons(active(X1),X2) 13: active(incr(X)) -> incr(active(X)) 14: active(s(X)) -> s(active(X)) 15: active(take(X1,X2)) -> take(active(X1),X2) 16: active(take(X1,X2)) -> take(X1,active(X2)) 17: active(zip(X1,X2)) -> zip(active(X1),X2) 18: active(zip(X1,X2)) -> zip(X1,active(X2)) 19: active(pair(X1,X2)) -> pair(active(X1),X2) 20: active(pair(X1,X2)) -> pair(X1,active(X2)) 21: active(tail(X)) -> tail(active(X)) 22: active(repItems(X)) -> repItems(active(X)) 23: cons(mark(X1),X2) -> mark(cons(X1,X2)) 24: incr(mark(X)) -> mark(incr(X)) 25: s(mark(X)) -> mark(s(X)) 26: take(mark(X1),X2) -> mark(take(X1,X2)) 27: take(X1,mark(X2)) -> mark(take(X1,X2)) 28: zip(mark(X1),X2) -> mark(zip(X1,X2)) 29: zip(X1,mark(X2)) -> mark(zip(X1,X2)) 30: pair(mark(X1),X2) -> mark(pair(X1,X2)) 31: pair(X1,mark(X2)) -> mark(pair(X1,X2)) 32: tail(mark(X)) -> mark(tail(X)) 33: repItems(mark(X)) -> mark(repItems(X)) 34: proper(pairNs()) -> ok(pairNs()) 35: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 36: proper(0()) -> ok(0()) 37: proper(incr(X)) -> incr(proper(X)) 38: proper(oddNs()) -> ok(oddNs()) 39: proper(s(X)) -> s(proper(X)) 40: proper(take(X1,X2)) -> take(proper(X1),proper(X2)) 41: proper(nil()) -> ok(nil()) 42: proper(zip(X1,X2)) -> zip(proper(X1),proper(X2)) 43: proper(pair(X1,X2)) -> pair(proper(X1),proper(X2)) 44: proper(tail(X)) -> tail(proper(X)) 45: proper(repItems(X)) -> repItems(proper(X)) 46: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 47: incr(ok(X)) -> ok(incr(X)) 48: s(ok(X)) -> ok(s(X)) 49: take(ok(X1),ok(X2)) -> ok(take(X1,X2)) 50: zip(ok(X1),ok(X2)) -> ok(zip(X1,X2)) 51: pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) 52: tail(ok(X)) -> ok(tail(X)) 53: repItems(ok(X)) -> ok(repItems(X)) 54: top(mark(X)) -> top(proper(X)) 55: top(ok(X)) -> top(active(X)) Number of strict rules: 55 Direct POLO(bPol) ... removes: 10 repItems w: 2 * x1 + 1 incr w: x1 s w: x1 take w: x1 + x2 + 1 top w: x1 pair w: x1 + x2 tail w: x1 proper w: x1 ok w: x1 0 w: 0 nil w: 1 mark w: x1 pairNs w: 1 oddNs w: 1 active w: x1 cons w: x1 + x2 zip w: x1 + x2 Number of strict rules: 54 Direct POLO(bPol) ... removes: 4 9 repItems w: 2 * x1 + 1 incr w: x1 s w: x1 take w: x1 + x2 + 2 top w: x1 pair w: x1 + x2 tail w: 2 * x1 + 1 proper w: x1 ok w: x1 0 w: 0 nil w: 1 mark w: x1 pairNs w: 1 oddNs w: 1 active w: x1 cons w: 2 * x1 + x2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472