Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903810
details
property
value
status
complete
benchmark
Ex18_Luc06_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.0167648792267 seconds
cpu usage
0.023531638
max memory
3887104.0
stage attributes
key
value
output-size
3989
starexec-result
WORST_CASE(Omega(n^1),O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: a__f(X) -> f(X) a__f(f(a())) -> a__f(g(f(a()))) mark(a()) -> a() mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) - Signature: {a__f/1,mark/1} / {a/0,f/1,g/1} - Obligation: runtime complexity wrt. defined symbols {a__f,mark} and constructors {a,f,g} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__f(X) -> f(X) a__f(f(a())) -> a__f(g(f(a()))) mark(a()) -> a() mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) - Signature: {a__f/1,mark/1} / {a/0,f/1,g/1} - Obligation: runtime complexity wrt. defined symbols {a__f,mark} and constructors {a,f,g} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(x){x -> f(x)} = mark(f(x)) ->^+ a__f(mark(x)) = C[mark(x) = mark(x){}] ** Step 1.b:1: ToInnermost WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a__f(X) -> f(X) a__f(f(a())) -> a__f(g(f(a()))) mark(a()) -> a() mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) - Signature: {a__f/1,mark/1} / {a/0,f/1,g/1} - Obligation: runtime complexity wrt. defined symbols {a__f,mark} and constructors {a,f,g} + Applied Processor: ToInnermost + Details: switch to innermost, as the system is overlay and right linear and does not contain weak rules ** Step 1.b:2: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a__f(X) -> f(X) a__f(f(a())) -> a__f(g(f(a()))) mark(a()) -> a() mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) - Signature: {a__f/1,mark/1} / {a/0,f/1,g/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__f,mark} and constructors {a,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() -> 2 a_1() -> 1 a_1() -> 3 a_1() -> 5 a_2() -> 8 a__f_0(2) -> 1 a__f_1(3) -> 1 a__f_1(3) -> 3 a__f_2(6) -> 1 a__f_2(6) -> 3 f_0(2) -> 2 f_1(2) -> 1 f_1(5) -> 4 f_2(3) -> 1 f_2(3) -> 3 f_2(8) -> 7 f_3(6) -> 1 f_3(6) -> 3 g_0(2) -> 2 g_1(2) -> 1 g_1(2) -> 3 g_1(4) -> 3 g_2(7) -> 6 mark_0(2) -> 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127