Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922126
details
property
value
status
complete
benchmark
test829.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
67.3326189518 seconds
cpu usage
70.791369712
max memory
6.6527232E7
stage attributes
key
value
output-size
2648
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: f(c(X,s(Y))) -> f(c(s(X),Y)) g(c(s(X),Y)) -> f(c(X,s(Y))) - Signature: {f/1,g/1} / {c/2,s/1} - Obligation: derivational complexity wrt. signature {c,f,g,s} + Applied Processor: Bounds {initialAutomaton = perSymbol, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. c_0(1,1) -> 1 c_0(1,2) -> 1 c_0(1,3) -> 1 c_0(1,4) -> 1 c_0(2,1) -> 1 c_0(2,2) -> 1 c_0(2,3) -> 1 c_0(2,4) -> 1 c_0(3,1) -> 1 c_0(3,2) -> 1 c_0(3,3) -> 1 c_0(3,4) -> 1 c_0(4,1) -> 1 c_0(4,2) -> 1 c_0(4,3) -> 1 c_0(4,4) -> 1 c_1(1,6) -> 7 c_1(2,6) -> 7 c_1(3,6) -> 7 c_1(4,6) -> 7 c_1(6,1) -> 5 c_1(6,2) -> 5 c_1(6,3) -> 5 c_1(6,4) -> 5 c_1(10,1) -> 7 c_1(10,2) -> 7 c_1(10,3) -> 7 c_1(10,4) -> 7 c_2(9,1) -> 8 c_2(9,2) -> 8 c_2(9,3) -> 8 c_2(9,4) -> 8 c_2(9,6) -> 8 f_0(1) -> 2 f_0(2) -> 2 f_0(3) -> 2 f_0(4) -> 2 f_1(5) -> 2 f_1(7) -> 3 f_2(8) -> 3 g_0(1) -> 3 g_0(2) -> 3 g_0(3) -> 3 g_0(4) -> 3 s_0(1) -> 4 s_0(2) -> 4 s_0(3) -> 4 s_0(4) -> 4 s_1(1) -> 6 s_1(2) -> 6 s_1(3) -> 6 s_1(4) -> 6 s_1(6) -> 6 s_1(9) -> 10 s_1(10) -> 10 s_2(1) -> 9 s_2(2) -> 9 s_2(3) -> 9 s_2(4) -> 9 s_2(9) -> 9 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: f(c(X,s(Y))) -> f(c(s(X),Y)) g(c(s(X),Y)) -> f(c(X,s(Y))) - Signature: {f/1,g/1} / {c/2,s/1} - Obligation: derivational complexity wrt. signature {c,f,g,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