Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903742
details
property
value
status
complete
benchmark
Ex6_Luc98_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
1.02958202362 seconds
cpu usage
4.229939034
max memory
1.1399168E8
stage attributes
key
value
output-size
12809
starexec-result
WORST_CASE(Omega(n^1),O(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),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) first(X1,X2) -> n__first(X1,X2) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) - Signature: {activate/1,first/2,from/1} / {0/0,cons/2,n__first/2,n__from/1,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {activate,first,from} and constructors {0,cons,n__first,n__from,nil ,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) first(X1,X2) -> n__first(X1,X2) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) - Signature: {activate/1,first/2,from/1} / {0/0,cons/2,n__first/2,n__from/1,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {activate,first,from} and constructors {0,cons,n__first,n__from,nil ,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: activate(v){v -> n__first(s(x),cons(z,v))} = activate(n__first(s(x),cons(z,v))) ->^+ cons(z,n__first(x,activate(v))) = C[activate(v) = activate(v){}] ** Step 1.b:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) first(X1,X2) -> n__first(X1,X2) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) - Signature: {activate/1,first/2,from/1} / {0/0,cons/2,n__first/2,n__from/1,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {activate,first,from} and constructors {0,cons,n__first,n__from,nil ,s} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(cons) = {2}, uargs(n__first) = {2} Following symbols are considered usable: all TcT has computed the following interpretation: p(0) = [0] p(activate) = [4] x1 + [9] p(cons) = [1] x2 + [2] p(first) = [4] x2 + [6] p(from) = [13] p(n__first) = [1] x2 + [3] p(n__from) = [1] p(nil) = [1] p(s) = [2] Following rules are strictly oriented: activate(X) = [4] X + [9] > [1] X + [0] = X activate(n__first(X1,X2)) = [4] X2 + [21] > [4] X2 + [6] = first(X1,X2) first(X1,X2) = [4] X2 + [6] > [1] X2 + [3] = n__first(X1,X2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127