Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903630
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nosorts-noand_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
74.9285130501 seconds
cpu usage
102.40116386
max memory
1.41234176E8
stage attributes
key
value
output-size
2106
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: U11(tt(),L) -> U12(tt(),activate(L)) U12(tt(),L) -> s(length(activate(L))) activate(X) -> X activate(n__zeros()) -> zeros() length(cons(N,L)) -> U11(tt(),activate(L)) length(nil()) -> 0() zeros() -> cons(0(),n__zeros()) zeros() -> n__zeros() - Signature: {U11/2,U12/2,activate/1,length/1,zeros/0} / {0/0,cons/2,n__zeros/0,nil/0,s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,activate,length,zeros} and constructors {0,cons,n__zeros ,nil,s,tt} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: U11(tt(),L) -> U12(tt(),activate(L)) U12(tt(),L) -> s(length(activate(L))) activate(X) -> X activate(n__zeros()) -> zeros() length(cons(N,L)) -> U11(tt(),activate(L)) length(nil()) -> 0() zeros() -> cons(0(),n__zeros()) zeros() -> n__zeros() - Signature: {U11/2,U12/2,activate/1,length/1,zeros/0} / {0/0,cons/2,n__zeros/0,nil/0,s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,activate,length,zeros} and constructors {0,cons,n__zeros ,nil,s,tt} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: U11(tt(),x){x -> cons(y,x)} = U11(tt(),cons(y,x)) ->^+ s(U11(tt(),x)) = C[U11(tt(),x) = U11(tt(),x){}] 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