Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922467
details
property
value
status
complete
benchmark
Ex4_7_15_Bor03_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
0.730396032333 seconds
cpu usage
2.802908392
max memory
6.1300736E7
stage attributes
key
value
output-size
2085
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__f(X)) -> f(X) f(X) -> n__f(X) f(0()) -> cons(0(),n__f(s(0()))) f(s(0())) -> f(p(s(0()))) p(s(0())) -> 0() - Signature: {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1} - Obligation: derivational complexity wrt. signature {0,activate,cons,f,n__f,p,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() -> 1 0_1() -> 1 0_1() -> 2 0_1() -> 5 0_2() -> 1 activate_0(1) -> 1 cons_0(1,1) -> 1 cons_1(2,3) -> 1 cons_2(1,6) -> 1 f_0(1) -> 1 f_1(1) -> 1 n__f_0(1) -> 1 n__f_1(1) -> 1 n__f_1(4) -> 3 n__f_2(1) -> 1 n__f_2(7) -> 6 p_0(1) -> 1 p_1(4) -> 1 s_0(1) -> 1 s_1(5) -> 4 s_2(1) -> 7 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: activate(X) -> X activate(n__f(X)) -> f(X) f(X) -> n__f(X) f(0()) -> cons(0(),n__f(s(0()))) f(s(0())) -> f(p(s(0()))) p(s(0())) -> 0() - Signature: {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1} - Obligation: derivational complexity wrt. signature {0,activate,cons,f,n__f,p,s} + 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 Deriv Compl Full Rewri 33144