Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922639
details
property
value
status
complete
benchmark
z048.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
294.029900074 seconds
cpu usage
1035.2877401
max memory
1.3673791488E10
stage attributes
key
value
output-size
2550
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: b(a(b(a(c(b(a(x1))))))) -> a(b(a(c(b(b(a(b(a(c(x1)))))))))) - Signature: {b/1} / {a/1,c/1} - Obligation: derivational complexity wrt. signature {a,b,c} + Applied Processor: Bounds {initialAutomaton = perSymbol, enrichment = match} + Details: The problem is match-bounded by 3. The enriched problem is compatible with follwoing automaton. a_0(1) -> 1 a_0(2) -> 1 a_0(3) -> 1 a_1(4) -> 2 a_1(4) -> 8 a_1(6) -> 5 a_1(10) -> 9 a_1(12) -> 11 a_2(13) -> 7 a_2(15) -> 14 a_2(19) -> 18 a_2(21) -> 20 a_2(22) -> 8 a_2(22) -> 17 a_2(24) -> 23 a_2(28) -> 27 a_2(30) -> 29 a_3(31) -> 17 a_3(33) -> 32 a_3(37) -> 36 a_3(39) -> 38 b_0(1) -> 2 b_0(2) -> 2 b_0(3) -> 2 b_1(5) -> 4 b_1(8) -> 7 b_1(9) -> 8 b_1(11) -> 10 b_2(14) -> 13 b_2(17) -> 16 b_2(18) -> 17 b_2(20) -> 19 b_2(23) -> 22 b_2(26) -> 25 b_2(27) -> 26 b_2(29) -> 28 b_3(32) -> 31 b_3(35) -> 34 b_3(36) -> 35 b_3(38) -> 37 c_0(1) -> 3 c_0(2) -> 3 c_0(3) -> 3 c_1(1) -> 12 c_1(2) -> 12 c_1(3) -> 12 c_1(4) -> 12 c_1(7) -> 6 c_1(22) -> 12 c_2(4) -> 21 c_2(6) -> 30 c_2(16) -> 15 c_2(22) -> 21 c_2(24) -> 30 c_2(25) -> 24 c_3(24) -> 39 c_3(34) -> 33 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: b(a(b(a(c(b(a(x1))))))) -> a(b(a(c(b(b(a(b(a(c(x1)))))))))) - Signature: {b/1} / {a/1,c/1} - Obligation: derivational complexity wrt. signature {a,b,c} + 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