Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903328
details
property
value
status
complete
benchmark
Ex5_Zan97_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
1.41364598274 seconds
cpu usage
5.668442451
max memory
9.5289344E7
stage attributes
key
value
output-size
14416
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(f(X)) -> f(active(X)) active(f(X)) -> mark(if(X,c(),f(true()))) active(if(X1,X2,X3)) -> if(X1,active(X2),X3) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(if(false(),X,Y)) -> mark(Y) active(if(true(),X,Y)) -> mark(X) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) if(X1,mark(X2),X3) -> mark(if(X1,X2,X3)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) proper(c()) -> ok(c()) proper(f(X)) -> f(proper(X)) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(true()) -> ok(true()) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,f/1,if/3,proper/1,top/1} / {c/0,false/0,mark/1,ok/1,true/0} - Obligation: runtime complexity wrt. defined symbols {active,f,if,proper,top} and constructors {c,false,mark,ok,true} + 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(if(X,c(),f(true()))) active(if(X1,X2,X3)) -> if(X1,active(X2),X3) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(if(false(),X,Y)) -> mark(Y) active(if(true(),X,Y)) -> mark(X) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) if(X1,mark(X2),X3) -> mark(if(X1,X2,X3)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) proper(c()) -> ok(c()) proper(f(X)) -> f(proper(X)) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(true()) -> ok(true()) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,f/1,if/3,proper/1,top/1} / {c/0,false/0,mark/1,ok/1,true/0} - Obligation: runtime complexity wrt. defined symbols {active,f,if,proper,top} and constructors {c,false,mark,ok,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: f(x){x -> mark(x)} = f(mark(x)) ->^+ mark(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(if(X,c(),f(true()))) active(if(X1,X2,X3)) -> if(X1,active(X2),X3) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(if(false(),X,Y)) -> mark(Y) active(if(true(),X,Y)) -> mark(X) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) if(X1,mark(X2),X3) -> mark(if(X1,X2,X3)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) proper(c()) -> ok(c()) proper(f(X)) -> f(proper(X)) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(true()) -> ok(true()) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,f/1,if/3,proper/1,top/1} / {c/0,false/0,mark/1,ok/1,true/0} - Obligation: runtime complexity wrt. defined symbols {active,f,if,proper,top} and constructors {c,false,mark,ok,true} + Applied Processor: Bounds {initialAutomaton = perSymbol, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. active_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