Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903796
details
property
value
status
complete
benchmark
Ex4_7_56_Bor03_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.20448494 seconds
cpu usage
752.703067542
max memory
9.64349952E8
stage attributes
key
value
output-size
3697
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: active(after(X1,X2)) -> after(X1,active(X2)) active(after(X1,X2)) -> after(active(X1),X2) active(after(0(),XS)) -> mark(XS) active(after(s(N),cons(X,XS))) -> mark(after(N,XS)) active(cons(X1,X2)) -> cons(active(X1),X2) active(from(X)) -> from(active(X)) active(from(X)) -> mark(cons(X,from(s(X)))) active(s(X)) -> s(active(X)) after(X1,mark(X2)) -> mark(after(X1,X2)) after(mark(X1),X2) -> mark(after(X1,X2)) after(ok(X1),ok(X2)) -> ok(after(X1,X2)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(mark(X)) -> mark(from(X)) from(ok(X)) -> ok(from(X)) proper(0()) -> ok(0()) proper(after(X1,X2)) -> after(proper(X1),proper(X2)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) proper(s(X)) -> s(proper(X)) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,after/2,cons/2,from/1,proper/1,s/1,top/1} / {0/0,mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,after,cons,from,proper,s,top} and constructors {0,mark,ok} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: active(after(X1,X2)) -> after(X1,active(X2)) active(after(X1,X2)) -> after(active(X1),X2) active(after(0(),XS)) -> mark(XS) active(after(s(N),cons(X,XS))) -> mark(after(N,XS)) active(cons(X1,X2)) -> cons(active(X1),X2) active(from(X)) -> from(active(X)) active(from(X)) -> mark(cons(X,from(s(X)))) active(s(X)) -> s(active(X)) after(X1,mark(X2)) -> mark(after(X1,X2)) after(mark(X1),X2) -> mark(after(X1,X2)) after(ok(X1),ok(X2)) -> ok(after(X1,X2)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(mark(X)) -> mark(from(X)) from(ok(X)) -> ok(from(X)) proper(0()) -> ok(0()) proper(after(X1,X2)) -> after(proper(X1),proper(X2)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) proper(s(X)) -> s(proper(X)) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,after/2,cons/2,from/1,proper/1,s/1,top/1} / {0/0,mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,after,cons,from,proper,s,top} and constructors {0,mark,ok} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: after(x,y){y -> mark(y)} = after(x,mark(y)) ->^+ mark(after(x,y)) = C[after(x,y) = after(x,y){}] WORST_CASE(Omega(n^1),?)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127