Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922786
details
property
value
status
complete
benchmark
Ex9_BLR02_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
0.268719911575 seconds
cpu usage
0.995569534
max memory
2.7234304E7
stage attributes
key
value
output-size
2209
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: filter(cons(X),0(),M) -> cons(0()) filter(cons(X),s(N),M) -> cons(X) nats(N) -> cons(N) sieve(cons(0())) -> cons(0()) sieve(cons(s(N))) -> cons(s(N)) zprimes() -> sieve(nats(s(s(0())))) - Signature: {filter/3,nats/1,sieve/1,zprimes/0} / {0/0,cons/1,s/1} - Obligation: derivational complexity wrt. signature {0,cons,filter,nats,s,sieve,zprimes} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. 0_0() -> 1 0_1() -> 2 cons_0(1) -> 1 cons_1(1) -> 1 cons_1(2) -> 1 cons_1(4) -> 1 cons_1(6) -> 1 cons_2(4) -> 3 cons_2(6) -> 1 filter_0(1,1,1) -> 1 nats_0(1) -> 1 nats_1(4) -> 3 s_0(1) -> 1 s_1(1) -> 1 s_1(2) -> 5 s_1(5) -> 4 s_2(5) -> 6 sieve_0(1) -> 1 sieve_1(3) -> 1 zprimes_0() -> 1 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: filter(cons(X),0(),M) -> cons(0()) filter(cons(X),s(N),M) -> cons(X) nats(N) -> cons(N) sieve(cons(0())) -> cons(0()) sieve(cons(s(N))) -> cons(s(N)) zprimes() -> sieve(nats(s(s(0())))) - Signature: {filter/3,nats/1,sieve/1,zprimes/0} / {0/0,cons/1,s/1} - Obligation: derivational complexity wrt. signature {0,cons,filter,nats,s,sieve,zprimes} + 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