Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922578
details
property
value
status
complete
benchmark
jw35.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
Zantema_05
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
14.0523509979 seconds
cpu usage
18.356296254
max memory
2.03870208E8
stage attributes
key
value
output-size
1628
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(f(x,a()),a()) -> f(f(f(x,a()),f(a(),a())),a()) - Signature: {f/2} / {a/0} - Obligation: derivational complexity wrt. signature {a,f} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. a_0() -> 1 a_1() -> 3 a_1() -> 6 a_1() -> 7 a_1() -> 8 a_2() -> 10 a_2() -> 13 a_2() -> 14 a_2() -> 15 f_0(1,1) -> 1 f_1(1,8) -> 4 f_1(2,3) -> 1 f_1(2,8) -> 4 f_1(4,5) -> 2 f_1(6,7) -> 5 f_2(2,15) -> 11 f_2(9,10) -> 4 f_2(11,12) -> 9 f_2(13,14) -> 12 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: f(f(x,a()),a()) -> f(f(f(x,a()),f(a(),a())),a()) - Signature: {f/2} / {a/0} - Obligation: derivational complexity wrt. signature {a,f} + 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