Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903424
details
property
value
status
complete
benchmark
Ex1_GL02a_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.309626818 seconds
cpu usage
638.361669477
max memory
2.750656512E9
stage attributes
key
value
output-size
3234
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: 0() -> n__0() activate(X) -> X activate(n__0()) -> 0() activate(n__inf(X)) -> inf(X) activate(n__length(X)) -> length(X) activate(n__s(X)) -> s(X) activate(n__take(X1,X2)) -> take(X1,X2) eq(X,Y) -> false() eq(n__0(),n__0()) -> true() eq(n__s(X),n__s(Y)) -> eq(activate(X),activate(Y)) inf(X) -> cons(X,n__inf(s(X))) inf(X) -> n__inf(X) length(X) -> n__length(X) length(cons(X,L)) -> s(n__length(activate(L))) length(nil()) -> 0() s(X) -> n__s(X) take(X1,X2) -> n__take(X1,X2) take(0(),X) -> nil() take(s(X),cons(Y,L)) -> cons(activate(Y),n__take(activate(X),activate(L))) - Signature: {0/0,activate/1,eq/2,inf/1,length/1,s/1,take/2} / {cons/2,false/0,n__0/0,n__inf/1,n__length/1,n__s/1 ,n__take/2,nil/0,true/0} - Obligation: runtime complexity wrt. defined symbols {0,activate,eq,inf,length,s,take} and constructors {cons,false,n__0 ,n__inf,n__length,n__s,n__take,nil,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: 0() -> n__0() activate(X) -> X activate(n__0()) -> 0() activate(n__inf(X)) -> inf(X) activate(n__length(X)) -> length(X) activate(n__s(X)) -> s(X) activate(n__take(X1,X2)) -> take(X1,X2) eq(X,Y) -> false() eq(n__0(),n__0()) -> true() eq(n__s(X),n__s(Y)) -> eq(activate(X),activate(Y)) inf(X) -> cons(X,n__inf(s(X))) inf(X) -> n__inf(X) length(X) -> n__length(X) length(cons(X,L)) -> s(n__length(activate(L))) length(nil()) -> 0() s(X) -> n__s(X) take(X1,X2) -> n__take(X1,X2) take(0(),X) -> nil() take(s(X),cons(Y,L)) -> cons(activate(Y),n__take(activate(X),activate(L))) - Signature: {0/0,activate/1,eq/2,inf/1,length/1,s/1,take/2} / {cons/2,false/0,n__0/0,n__inf/1,n__length/1,n__s/1 ,n__take/2,nil/0,true/0} - Obligation: runtime complexity wrt. defined symbols {0,activate,eq,inf,length,s,take} and constructors {cons,false,n__0 ,n__inf,n__length,n__s,n__take,nil,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: activate(z){z -> n__length(cons(x,z))} = activate(n__length(cons(x,z))) ->^+ s(n__length(activate(z))) = C[activate(z) = activate(z){}] 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