Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903330
details
property
value
status
complete
benchmark
Ex5_Zan97_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.211985111237 seconds
cpu usage
0.796388241
max memory
2.9745152E7
stage attributes
key
value
output-size
5371
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: activate(X) -> X activate(n__f(X)) -> f(activate(X)) activate(n__true()) -> true() f(X) -> if(X,c(),n__f(n__true())) f(X) -> n__f(X) if(false(),X,Y) -> activate(Y) if(true(),X,Y) -> X true() -> n__true() - Signature: {activate/1,f/1,if/3,true/0} / {c/0,false/0,n__f/1,n__true/0} - Obligation: runtime complexity wrt. defined symbols {activate,f,if,true} and constructors {c,false,n__f,n__true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__f(X)) -> f(activate(X)) activate(n__true()) -> true() f(X) -> if(X,c(),n__f(n__true())) f(X) -> n__f(X) if(false(),X,Y) -> activate(Y) if(true(),X,Y) -> X true() -> n__true() - Signature: {activate/1,f/1,if/3,true/0} / {c/0,false/0,n__f/1,n__true/0} - Obligation: runtime complexity wrt. defined symbols {activate,f,if,true} and constructors {c,false,n__f,n__true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: activate(x){x -> n__f(x)} = activate(n__f(x)) ->^+ f(activate(x)) = C[activate(x) = activate(x){}] ** Step 1.b:1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__f(X)) -> f(activate(X)) activate(n__true()) -> true() f(X) -> if(X,c(),n__f(n__true())) f(X) -> n__f(X) if(false(),X,Y) -> activate(Y) if(true(),X,Y) -> X true() -> n__true() - Signature: {activate/1,f/1,if/3,true/0} / {c/0,false/0,n__f/1,n__true/0} - Obligation: runtime complexity wrt. defined symbols {activate,f,if,true} and constructors {c,false,n__f,n__true} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 4. The enriched problem is compatible with follwoing automaton. activate_0(2) -> 1 activate_1(2) -> 1 activate_1(2) -> 3 activate_1(5) -> 1 activate_1(8) -> 1 activate_1(8) -> 3 activate_2(6) -> 10 activate_2(9) -> 10 c_0() -> 1 c_0() -> 2 c_0() -> 3 c_1() -> 4 c_2() -> 1 c_2() -> 3 c_2() -> 7 c_3() -> 1 c_3() -> 3 c_3() -> 11 f_0(2) -> 1 f_1(3) -> 1 f_1(3) -> 3 f_2(10) -> 1 f_2(10) -> 3 false_0() -> 1 false_0() -> 2 false_0() -> 3 if_0(2,2,2) -> 1 if_1(2,4,5) -> 1 if_2(3,7,8) -> 1 if_2(3,7,8) -> 3 if_3(10,11,12) -> 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127