Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903592
details
property
value
status
complete
benchmark
OvConsOS_nosorts_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n036.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.817461967468 seconds
cpu usage
3.199263754
max memory
8.5696512E7
stage attributes
key
value
output-size
19005
starexec-result
WORST_CASE(Omega(n^1),O(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),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: active(and(X1,X2)) -> and(active(X1),X2) active(and(tt(),X)) -> mark(X) active(cons(X1,X2)) -> cons(active(X1),X2) active(length(X)) -> length(active(X)) active(length(cons(N,L))) -> mark(s(length(L))) active(length(nil())) -> mark(0()) active(s(X)) -> s(active(X)) active(take(X1,X2)) -> take(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(0(),IL)) -> mark(nil()) active(take(s(M),cons(N,IL))) -> mark(cons(N,take(M,IL))) active(zeros()) -> mark(cons(0(),zeros())) and(mark(X1),X2) -> mark(and(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) length(mark(X)) -> mark(length(X)) length(ok(X)) -> ok(length(X)) proper(0()) -> ok(0()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(length(X)) -> length(proper(X)) proper(nil()) -> ok(nil()) proper(s(X)) -> s(proper(X)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(zeros()) -> ok(zeros()) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) take(X1,mark(X2)) -> mark(take(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,and/2,cons/2,length/1,proper/1,s/1,take/2,top/1} / {0/0,mark/1,nil/0,ok/1,tt/0,zeros/0} - Obligation: runtime complexity wrt. defined symbols {active,and,cons,length,proper,s,take,top} and constructors {0,mark ,nil,ok,tt,zeros} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: active(and(X1,X2)) -> and(active(X1),X2) active(and(tt(),X)) -> mark(X) active(cons(X1,X2)) -> cons(active(X1),X2) active(length(X)) -> length(active(X)) active(length(cons(N,L))) -> mark(s(length(L))) active(length(nil())) -> mark(0()) active(s(X)) -> s(active(X)) active(take(X1,X2)) -> take(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(0(),IL)) -> mark(nil()) active(take(s(M),cons(N,IL))) -> mark(cons(N,take(M,IL))) active(zeros()) -> mark(cons(0(),zeros())) and(mark(X1),X2) -> mark(and(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) length(mark(X)) -> mark(length(X)) length(ok(X)) -> ok(length(X)) proper(0()) -> ok(0()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(length(X)) -> length(proper(X)) proper(nil()) -> ok(nil()) proper(s(X)) -> s(proper(X)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(zeros()) -> ok(zeros()) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) take(X1,mark(X2)) -> mark(take(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,and/2,cons/2,length/1,proper/1,s/1,take/2,top/1} / {0/0,mark/1,nil/0,ok/1,tt/0,zeros/0} - Obligation: runtime complexity wrt. defined symbols {active,and,cons,length,proper,s,take,top} and constructors {0,mark ,nil,ok,tt,zeros} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: and(x,y){x -> mark(x)} =
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127