Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902341
details
property
value
status
complete
benchmark
jones4.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
Mixed_TRS
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.0136740207672 seconds
cpu usage
0.019851986
max memory
3551232.0
stage attributes
key
value
output-size
3179
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: p(m,n,s(r)) -> p(m,r,n) p(m,0(),0()) -> m p(m,s(n),0()) -> p(0(),n,m) - Signature: {p/3} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {p} and constructors {0,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: p(m,n,s(r)) -> p(m,r,n) p(m,0(),0()) -> m p(m,s(n),0()) -> p(0(),n,m) - Signature: {p/3} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {p} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: p(x,v,z){v -> s(v),z -> s(z)} = p(x,s(v),s(z)) ->^+ p(x,v,z) = C[p(x,v,z) = p(x,v,z){}] ** Step 1.b:1: ToInnermost WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: p(m,n,s(r)) -> p(m,r,n) p(m,0(),0()) -> m p(m,s(n),0()) -> p(0(),n,m) - Signature: {p/3} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {p} and constructors {0,s} + Applied Processor: ToInnermost + Details: switch to innermost, as the system is overlay and right linear and does not contain weak rules ** Step 1.b:2: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: p(m,n,s(r)) -> p(m,r,n) p(m,0(),0()) -> m p(m,s(n),0()) -> p(0(),n,m) - Signature: {p/3} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {p} and constructors {0,s} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 1. The enriched problem is compatible with follwoing automaton. 0_0() -> 1 0_0() -> 2 0_1() -> 1 0_1() -> 2 p_0(2,2,2) -> 1 p_1(2,2,2) -> 1 s_0(2) -> 1 s_0(2) -> 2 2 -> 1 ** Step 1.b:3: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: p(m,n,s(r)) -> p(m,r,n) p(m,0(),0()) -> m p(m,s(n),0()) -> p(0(),n,m) - Signature: {p/3} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {p} and constructors {0,s} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(Omega(n^1),O(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