Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902105
details
property
value
status
complete
benchmark
10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
Secret_06_TRS
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.163033008575 seconds
cpu usage
0.589143325
max memory
5.203968E7
stage attributes
key
value
output-size
2693
starexec-result
WORST_CASE(?,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(?,O(n^1)) * Step 1: Sum WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: c(y) -> y c(a(a(0(),x),y)) -> a(c(c(c(0()))),y) c(c(c(y))) -> c(c(a(y,0()))) - Signature: {c/1} / {0/0,a/2} - Obligation: runtime complexity wrt. defined symbols {c} and constructors {0,a} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: c(y) -> y c(a(a(0(),x),y)) -> a(c(c(c(0()))),y) c(c(c(y))) -> c(c(a(y,0()))) - Signature: {c/1} / {0/0,a/2} - Obligation: runtime complexity wrt. defined symbols {c} and constructors {0,a} + 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 0_0() -> 3 0_1() -> 4 0_1() -> 5 0_1() -> 6 0_1() -> 7 0_2() -> 10 a_0(1,1) -> 2 a_0(1,1) -> 3 a_0(1,2) -> 2 a_0(1,2) -> 3 a_0(2,1) -> 2 a_0(2,1) -> 3 a_0(2,2) -> 2 a_0(2,2) -> 3 a_1(4,1) -> 3 a_1(4,2) -> 3 a_2(7,10) -> 4 a_2(7,10) -> 8 a_2(7,10) -> 9 c_0(1) -> 3 c_0(2) -> 3 c_1(5) -> 4 c_1(6) -> 4 c_1(6) -> 5 c_1(7) -> 4 c_1(7) -> 5 c_1(7) -> 6 c_2(8) -> 4 c_2(9) -> 4 c_2(9) -> 8 1 -> 3 2 -> 3 5 -> 4 6 -> 4 6 -> 5 7 -> 4 7 -> 5 7 -> 6 8 -> 4 9 -> 4 9 -> 8 * Step 3: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: c(y) -> y c(a(a(0(),x),y)) -> a(c(c(c(0()))),y) c(c(c(y))) -> c(c(a(y,0()))) - Signature: {c/1} / {0/0,a/2} - Obligation: runtime complexity wrt. defined symbols {c} and constructors {0,a} + 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