Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905168
details
property
value
status
complete
benchmark
Ex1_Zan97_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.30397105217 seconds
cpu usage
0.910178967
max memory
2.312192E7
stage attributes
key
value
output-size
3337
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Sum WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a__c() -> c() a__c() -> d() a__g(X) -> a__h(X) a__g(X) -> g(X) a__h(X) -> h(X) a__h(d()) -> a__g(c()) mark(c()) -> a__c() mark(d()) -> d() mark(g(X)) -> a__g(X) mark(h(X)) -> a__h(X) - Signature: {a__c/0,a__g/1,a__h/1,mark/1} / {c/0,d/0,g/1,h/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__c,a__g,a__h,mark} and constructors {c,d,g,h} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a__c() -> c() a__c() -> d() a__g(X) -> a__h(X) a__g(X) -> g(X) a__h(X) -> h(X) a__h(d()) -> a__g(c()) mark(c()) -> a__c() mark(d()) -> d() mark(g(X)) -> a__g(X) mark(h(X)) -> a__h(X) - Signature: {a__c/0,a__g/1,a__h/1,mark/1} / {c/0,d/0,g/1,h/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__c,a__g,a__h,mark} and constructors {c,d,g,h} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 5. The enriched problem is compatible with follwoing automaton. a__c_0() -> 1 a__c_1() -> 1 a__g_0(2) -> 1 a__g_1(1) -> 1 a__g_1(2) -> 1 a__g_2(1) -> 1 a__g_3(3) -> 1 a__h_0(2) -> 1 a__h_1(2) -> 1 a__h_2(1) -> 1 a__h_2(2) -> 1 a__h_3(1) -> 1 a__h_4(3) -> 1 c_0() -> 2 c_1() -> 1 c_2() -> 1 c_3() -> 3 d_0() -> 2 d_1() -> 1 d_2() -> 1 g_0(2) -> 2 g_1(2) -> 1 g_2(1) -> 1 g_2(2) -> 1 g_3(1) -> 1 g_4(3) -> 1 h_0(2) -> 2 h_1(2) -> 1 h_2(2) -> 1 h_3(1) -> 1 h_3(2) -> 1 h_4(1) -> 1 h_5(3) -> 1 mark_0(2) -> 1 * Step 3: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: a__c() -> c() a__c() -> d() a__g(X) -> a__h(X) a__g(X) -> g(X) a__h(X) -> h(X) a__h(d()) -> a__g(c()) mark(c()) -> a__c() mark(d()) -> d() mark(g(X)) -> a__g(X) mark(h(X)) -> a__h(X) - Signature: {a__c/0,a__g/1,a__h/1,mark/1} / {c/0,d/0,g/1,h/1} - Obligation:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807