Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903251
details
property
value
status
complete
benchmark
MYNAT_nosorts_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
1.28817510605 seconds
cpu usage
5.03199
max memory
5.0098176E7
stage attributes
key
value
output-size
13441
starexec-result
WORST_CASE(Omega(n^1),O(n^2))
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^2)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^2)) + Considered Problem: - Strict TRS: activate(X) -> X and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) - Signature: {activate/1,and/2,plus/2,x/2} / {0/0,s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {activate,and,plus,x} and constructors {0,s,tt} + 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 and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) - Signature: {activate/1,and/2,plus/2,x/2} / {0/0,s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {activate,and,plus,x} and constructors {0,s,tt} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: plus(x,y){y -> s(y)} = plus(x,s(y)) ->^+ s(plus(x,y)) = C[plus(x,y) = plus(x,y){}] ** Step 1.b:1: NaturalPI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: activate(X) -> X and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) - Signature: {activate/1,and/2,plus/2,x/2} / {0/0,s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {activate,and,plus,x} and constructors {0,s,tt} + Applied Processor: NaturalPI {shape = Linear, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules} + Details: We apply a polynomial interpretation of kind constructor-based(linear): The following argument positions are considered usable: uargs(plus) = {1}, uargs(s) = {1} Following symbols are considered usable: all TcT has computed the following interpretation: p(0) = 0 p(activate) = 8 + x1 p(and) = 8 + x2 p(plus) = x1 p(s) = x1 p(tt) = 0 p(x) = 0 Following rules are strictly oriented: activate(X) = 8 + X > X = X Following rules are (at-least) weakly oriented: and(tt(),X) = 8 + X >= 8 + X = activate(X) plus(N,0()) = N >= N = N plus(N,s(M)) = N >= N = s(plus(N,M)) x(N,0()) = 0 >= 0 = 0()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127