Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922319
details
property
value
status
complete
benchmark
matchbox2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
Secret_05_SRS
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
83.2060041428 seconds
cpu usage
224.504186961
max memory
6.678740992E9
stage attributes
key
value
output-size
6758
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: a(l(x1)) -> a(t(x1)) n(s(x1)) -> a(l(a(t(x1)))) o(m(a(x1))) -> t(e(n(x1))) s(a(x1)) -> l(a(t(o(m(a(t(e(x1)))))))) t(e(x1)) -> n(s(x1)) t(o(x1)) -> m(a(x1)) - Signature: {a/1,n/1,o/1,s/1,t/1} / {e/1,l/1,m/1} - Obligation: derivational complexity wrt. signature {a,e,l,m,n,o,s,t} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 8. The enriched problem is compatible with follwoing automaton. a_0(1) -> 1 a_1(1) -> 15 a_1(2) -> 1 a_1(2) -> 4 a_1(2) -> 15 a_1(6) -> 5 a_1(10) -> 9 a_2(8) -> 16 a_2(17) -> 1 a_2(17) -> 2 a_2(17) -> 4 a_2(17) -> 15 a_2(17) -> 17 a_2(17) -> 21 a_2(18) -> 15 a_2(28) -> 27 a_2(32) -> 31 a_3(19) -> 10 a_3(21) -> 1 a_3(21) -> 2 a_3(21) -> 4 a_3(21) -> 15 a_3(21) -> 17 a_3(21) -> 20 a_3(21) -> 21 a_3(22) -> 1 a_3(24) -> 23 a_3(30) -> 44 a_3(35) -> 34 a_3(39) -> 38 a_4(37) -> 45 a_4(46) -> 10 a_4(47) -> 1 a_4(48) -> 32 a_4(50) -> 49 a_4(51) -> 7 a_4(53) -> 52 a_4(62) -> 61 a_4(66) -> 65 a_5(54) -> 39 a_5(56) -> 55 a_5(64) -> 71 a_5(72) -> 32 a_5(73) -> 7 a_5(75) -> 29 a_5(77) -> 76 a_6(74) -> 39 a_6(78) -> 66 a_6(80) -> 79 a_6(81) -> 36 a_6(83) -> 82 a_6(87) -> 29 a_7(88) -> 66 a_7(89) -> 36 a_7(90) -> 63 a_7(92) -> 91 a_8(93) -> 63 e_0(1) -> 1 e_1(1) -> 11 e_1(2) -> 11 e_1(4) -> 3 e_1(17) -> 11 e_1(21) -> 11 e_1(22) -> 11 e_1(47) -> 11 e_2(2) -> 33 e_2(17) -> 33 e_2(21) -> 33 e_2(22) -> 33 e_2(26) -> 25 e_2(47) -> 33 e_3(17) -> 40 e_3(21) -> 40 e_3(22) -> 40 e_3(47) -> 40
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144