Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903738
details
property
value
status
complete
benchmark
Ex4_Zan97_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.176255941 seconds
cpu usage
738.131607995
max memory
7.7494272E8
stage attributes
key
value
output-size
4061
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: active(cons(X1,X2)) -> cons(active(X1),X2) active(f(X)) -> f(active(X)) active(f(X)) -> mark(cons(X,f(g(X)))) active(g(X)) -> g(active(X)) active(g(0())) -> mark(s(0())) active(g(s(X))) -> mark(s(s(g(X)))) active(s(X)) -> s(active(X)) active(sel(X1,X2)) -> sel(X1,active(X2)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(0(),cons(X,Y))) -> mark(X) active(sel(s(X),cons(Y,Z))) -> mark(sel(X,Z)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) g(mark(X)) -> mark(g(X)) g(ok(X)) -> ok(g(X)) proper(0()) -> ok(0()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(f(X)) -> f(proper(X)) proper(g(X)) -> g(proper(X)) proper(s(X)) -> s(proper(X)) proper(sel(X1,X2)) -> sel(proper(X1),proper(X2)) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,cons/2,f/1,g/1,proper/1,s/1,sel/2,top/1} / {0/0,mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,cons,f,g,proper,s,sel,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(cons(X1,X2)) -> cons(active(X1),X2) active(f(X)) -> f(active(X)) active(f(X)) -> mark(cons(X,f(g(X)))) active(g(X)) -> g(active(X)) active(g(0())) -> mark(s(0())) active(g(s(X))) -> mark(s(s(g(X)))) active(s(X)) -> s(active(X)) active(sel(X1,X2)) -> sel(X1,active(X2)) active(sel(X1,X2)) -> sel(active(X1),X2) active(sel(0(),cons(X,Y))) -> mark(X) active(sel(s(X),cons(Y,Z))) -> mark(sel(X,Z)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) g(mark(X)) -> mark(g(X)) g(ok(X)) -> ok(g(X)) proper(0()) -> ok(0()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(f(X)) -> f(proper(X)) proper(g(X)) -> g(proper(X)) proper(s(X)) -> s(proper(X)) proper(sel(X1,X2)) -> sel(proper(X1),proper(X2)) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) sel(X1,mark(X2)) -> mark(sel(X1,X2)) sel(mark(X1),X2) -> mark(sel(X1,X2)) sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,cons/2,f/1,g/1,proper/1,s/1,sel/2,top/1} / {0/0,mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,cons,f,g,proper,s,sel,top} and constructors {0,mark,ok} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: cons(x,y){x -> mark(x)} = cons(mark(x),y) ->^+ mark(cons(x,y)) = C[cons(x,y) = cons(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