Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903100
details
property
value
status
complete
benchmark
#3.24.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
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.015212059021 seconds
cpu usage
0.026680555
max memory
1.0063872E7
stage attributes
key
value
output-size
3213
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: f(0()) -> s(0()) f(s(0())) -> s(0()) f(s(s(x))) -> f(f(s(x))) - Signature: {f/1} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {f} 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: f(0()) -> s(0()) f(s(0())) -> s(0()) f(s(s(x))) -> f(f(s(x))) - Signature: {f/1} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {f} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: f(s(x)){x -> s(x)} = f(s(s(x))) ->^+ f(f(s(x))) = C[f(s(x)) = f(s(x)){}] ** Step 1.b:1: ToInnermost WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(0()) -> s(0()) f(s(0())) -> s(0()) f(s(s(x))) -> f(f(s(x))) - Signature: {f/1} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {f} 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: f(0()) -> s(0()) f(s(0())) -> s(0()) f(s(s(x))) -> f(f(s(x))) - Signature: {f/1} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f} and constructors {0,s} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. 0_0() -> 2 0_1() -> 3 0_2() -> 6 f_0(2) -> 1 f_1(4) -> 1 f_1(4) -> 4 f_1(5) -> 4 s_0(2) -> 2 s_1(2) -> 5 s_1(3) -> 1 s_1(3) -> 4 s_2(6) -> 1 s_2(6) -> 4 ** Step 1.b:3: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: f(0()) -> s(0()) f(s(0())) -> s(0()) f(s(s(x))) -> f(f(s(x))) - Signature: {f/1} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f} 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