Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922023
details
property
value
status
complete
benchmark
direct.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
Endrullis_06
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
7.8282430172 seconds
cpu usage
14.438765132
max memory
1.4569472E8
stage attributes
key
value
output-size
2006
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: h(x,c(y,z)) -> h(c(s(y),x),z) h(c(s(x),c(s(0()),y)),z) -> h(y,c(s(0()),c(x,z))) - Signature: {h/2} / {0/0,c/2,s/1} - Obligation: derivational complexity wrt. signature {0,c,h,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() -> 7 c_0(1,1) -> 1 c_1(1,1) -> 6 c_1(1,4) -> 6 c_1(3,1) -> 2 c_1(3,2) -> 2 c_1(3,10) -> 2 c_1(5,4) -> 4 c_1(5,6) -> 4 c_2(9,1) -> 8 c_2(9,2) -> 8 c_2(9,8) -> 8 c_2(9,10) -> 8 c_2(11,8) -> 10 h_0(1,1) -> 1 h_1(1,4) -> 1 h_1(2,1) -> 1 h_1(2,4) -> 1 h_1(8,4) -> 1 h_1(10,4) -> 1 h_2(8,4) -> 1 h_2(8,6) -> 1 h_2(10,1) -> 1 h_2(10,4) -> 1 s_0(1) -> 1 s_1(1) -> 3 s_1(7) -> 5 s_2(1) -> 11 s_2(5) -> 9 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: h(x,c(y,z)) -> h(c(s(y),x),z) h(c(s(x),c(s(0()),y)),z) -> h(y,c(s(0()),c(x,z))) - Signature: {h/2} / {0/0,c/2,s/1} - Obligation: derivational complexity wrt. signature {0,c,h,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