Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902612
details
property
value
status
complete
benchmark
Liveness8.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.299998044968 seconds
cpu usage
1.149642865
max memory
3.6864E7
stage attributes
key
value
output-size
8375
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: active(f(x)) -> f(active(x)) active(f(x)) -> mark(x) check(x) -> start(match(f(X()),x)) check(f(x)) -> f(check(x)) f(found(x)) -> found(f(x)) f(mark(x)) -> mark(f(x)) f(ok(x)) -> ok(f(x)) match(X(),x) -> proper(x) match(f(x),f(y)) -> f(match(x,y)) proper(c()) -> ok(c()) proper(f(x)) -> f(proper(x)) start(ok(x)) -> found(x) top(active(c())) -> top(mark(c())) top(found(x)) -> top(active(x)) top(mark(x)) -> top(check(x)) - Signature: {active/1,check/1,f/1,match/2,proper/1,start/1,top/1} / {X/0,c/0,found/1,mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,check,f,match,proper,start,top} and constructors {X,c,found ,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(f(x)) -> f(active(x)) active(f(x)) -> mark(x) check(x) -> start(match(f(X()),x)) check(f(x)) -> f(check(x)) f(found(x)) -> found(f(x)) f(mark(x)) -> mark(f(x)) f(ok(x)) -> ok(f(x)) match(X(),x) -> proper(x) match(f(x),f(y)) -> f(match(x,y)) proper(c()) -> ok(c()) proper(f(x)) -> f(proper(x)) start(ok(x)) -> found(x) top(active(c())) -> top(mark(c())) top(found(x)) -> top(active(x)) top(mark(x)) -> top(check(x)) - Signature: {active/1,check/1,f/1,match/2,proper/1,start/1,top/1} / {X/0,c/0,found/1,mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,check,f,match,proper,start,top} and constructors {X,c,found ,mark,ok} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: f(x){x -> found(x)} = f(found(x)) ->^+ found(f(x)) = C[f(x) = f(x){}] ** Step 1.b:1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: active(f(x)) -> f(active(x)) active(f(x)) -> mark(x) check(x) -> start(match(f(X()),x)) check(f(x)) -> f(check(x)) f(found(x)) -> found(f(x)) f(mark(x)) -> mark(f(x)) f(ok(x)) -> ok(f(x)) match(X(),x) -> proper(x) match(f(x),f(y)) -> f(match(x,y)) proper(c()) -> ok(c()) proper(f(x)) -> f(proper(x)) start(ok(x)) -> found(x) top(active(c())) -> top(mark(c())) top(found(x)) -> top(active(x)) top(mark(x)) -> top(check(x)) - Signature: {active/1,check/1,f/1,match/2,proper/1,start/1,top/1} / {X/0,c/0,found/1,mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,check,f,match,proper,start,top} and constructors {X,c,found ,mark,ok} + Applied Processor: Bounds {initialAutomaton = perSymbol, enrichment = match} + Details: The problem is match-bounded by 3. The enriched problem is compatible with follwoing automaton. X_0() -> 1 X_1() -> 15 X_2() -> 21 X_3() -> 25 active_0(1) -> 2 active_0(3) -> 2 active_0(6) -> 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127