Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922045
details
property
value
status
complete
benchmark
z057.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
294.08206296 seconds
cpu usage
839.705122817
max memory
8.687489024E9
stage attributes
key
value
output-size
1586
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(a(b(b(a(b(x1)))))) -> a(b(a(b(b(b(a(x1))))))) - Signature: {b/1} / {a/1} - Obligation: derivational complexity wrt. signature {a,b} + 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) -> 1 a_1(1) -> 7 a_1(2) -> 1 a_1(2) -> 6 a_1(3) -> 7 a_1(4) -> 3 a_2(3) -> 13 a_2(8) -> 2 a_2(10) -> 9 b_0(1) -> 1 b_1(3) -> 2 b_1(5) -> 4 b_1(6) -> 5 b_1(7) -> 6 b_2(9) -> 8 b_2(11) -> 10 b_2(12) -> 11 b_2(13) -> 12 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: b(a(b(b(a(b(x1)))))) -> a(b(a(b(b(b(a(x1))))))) - Signature: {b/1} / {a/1} - Obligation: derivational complexity wrt. signature {a,b} + 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