Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381921971
details
property
value
status
complete
benchmark
25.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
Various_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
0.203871011734 seconds
cpu usage
0.719251313
max memory
3.0560256E7
stage attributes
key
value
output-size
1673
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: b() -> f(a(),a()) f(a(),a()) -> g(d()) g(a()) -> g(b()) - Signature: {b/0,f/2,g/1} / {a/0,d/0} - Obligation: derivational complexity wrt. signature {a,b,d,f,g} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 3. The enriched problem is compatible with follwoing automaton. a_0() -> 1 a_1() -> 2 a_1() -> 3 a_2() -> 6 a_2() -> 7 b_0() -> 1 b_1() -> 4 d_0() -> 1 d_1() -> 4 d_2() -> 5 d_3() -> 8 f_0(1,1) -> 1 f_1(2,3) -> 1 f_2(6,7) -> 4 g_0(1) -> 1 g_1(4) -> 1 g_2(5) -> 1 g_3(8) -> 4 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: b() -> f(a(),a()) f(a(),a()) -> g(d()) g(a()) -> g(b()) - Signature: {b/0,f/2,g/1} / {a/0,d/0} - Obligation: derivational complexity wrt. signature {a,b,d,f,g} + 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