Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902826
details
property
value
status
complete
benchmark
4.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Secret_06_TRS
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.0885229110718 seconds
cpu usage
0.376940211
max memory
3.5659776E7
stage attributes
key
value
output-size
2197
starexec-result
WORST_CASE(?,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(?,O(n^1)) * Step 1: Sum WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a(0(),x) -> c(c(x)) c(c(x)) -> b(c(b(c(x)))) c(c(b(c(x)))) -> b(a(0(),c(x))) - Signature: {a/2,c/1} / {0/0,b/1} - Obligation: runtime complexity wrt. defined symbols {a,c} and constructors {0,b} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a(0(),x) -> c(c(x)) c(c(x)) -> b(c(b(c(x)))) c(c(b(c(x)))) -> b(a(0(),c(x))) - Signature: {a/2,c/1} / {0/0,b/1} - Obligation: runtime complexity wrt. defined symbols {a,c} and constructors {0,b} + Applied Processor: Bounds {initialAutomaton = perSymbol, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. 0_0() -> 1 a_0(1,1) -> 2 a_0(1,3) -> 2 a_0(3,1) -> 2 a_0(3,3) -> 2 b_0(1) -> 3 b_0(3) -> 3 b_2(6) -> 2 b_2(8) -> 7 c_0(1) -> 4 c_0(3) -> 4 c_1(1) -> 5 c_1(3) -> 5 c_1(5) -> 2 c_2(1) -> 8 c_2(3) -> 8 c_2(7) -> 6 * Step 3: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: a(0(),x) -> c(c(x)) c(c(x)) -> b(c(b(c(x)))) c(c(b(c(x)))) -> b(a(0(),c(x))) - Signature: {a/2,c/1} / {0/0,b/1} - Obligation: runtime complexity wrt. defined symbols {a,c} and constructors {0,b} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,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