Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903554
details
property
value
status
complete
benchmark
Ex6_GM04_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.348750114441 seconds
cpu usage
1.329005992
max memory
5.6582144E7
stage attributes
key
value
output-size
6098
starexec-result
WORST_CASE(Omega(n^1),O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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: active(c()) -> mark(f(g(c()))) active(f(g(X))) -> mark(g(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) proper(c()) -> ok(c()) proper(f(X)) -> f(proper(X)) proper(g(X)) -> g(proper(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,f/1,g/1,proper/1,top/1} / {c/0,mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,f,g,proper,top} and constructors {c,mark,ok} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: active(c()) -> mark(f(g(c()))) active(f(g(X))) -> mark(g(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) proper(c()) -> ok(c()) proper(f(X)) -> f(proper(X)) proper(g(X)) -> g(proper(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,f/1,g/1,proper/1,top/1} / {c/0,mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,f,g,proper,top} and constructors {c,mark,ok} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: f(x){x -> ok(x)} = f(ok(x)) ->^+ ok(f(x)) = C[f(x) = f(x){}] ** Step 1.b:1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: active(c()) -> mark(f(g(c()))) active(f(g(X))) -> mark(g(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) proper(c()) -> ok(c()) proper(f(X)) -> f(proper(X)) proper(g(X)) -> g(proper(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,f/1,g/1,proper/1,top/1} / {c/0,mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,f,g,proper,top} and constructors {c,mark,ok} + Applied Processor: Bounds {initialAutomaton = perSymbol, enrichment = match} + Details: The problem is match-bounded by 6. The enriched problem is compatible with follwoing automaton. active_0(2) -> 1 active_0(5) -> 1 active_0(6) -> 1 active_1(2) -> 14 active_1(5) -> 14 active_1(6) -> 14 active_2(11) -> 15 active_3(26) -> 21 active_4(29) -> 30 active_5(27) -> 33 active_6(36) -> 37 c_0() -> 2 c_1() -> 11 c_2() -> 18 c_3() -> 25 c_4() -> 35 f_0(2) -> 3 f_0(5) -> 3 f_0(6) -> 3 f_1(2) -> 12 f_1(5) -> 12 f_1(6) -> 12 f_1(10) -> 9 f_2(17) -> 16 f_2(19) -> 15 f_3(22) -> 21 f_3(24) -> 26 f_4(27) -> 29
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127