Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903348
details
property
value
status
complete
benchmark
Ex49_GM04_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
1.19768691063 seconds
cpu usage
4.9334043
max memory
4.9774592E7
stage attributes
key
value
output-size
43565
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: 0() -> n__0() activate(X) -> X activate(n__0()) -> 0() activate(n__s(X)) -> s(X) div(0(),n__s(Y)) -> 0() div(s(X),n__s(Y)) -> if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0()) geq(X,n__0()) -> true() geq(n__0(),n__s(Y)) -> false() geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y)) if(false(),X,Y) -> activate(Y) if(true(),X,Y) -> activate(X) minus(n__0(),Y) -> 0() minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y)) s(X) -> n__s(X) - Signature: {0/0,activate/1,div/2,geq/2,if/3,minus/2,s/1} / {false/0,n__0/0,n__s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {0,activate,div,geq,if,minus,s} and constructors {false,n__0,n__s ,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: 0() -> n__0() activate(X) -> X activate(n__0()) -> 0() activate(n__s(X)) -> s(X) div(0(),n__s(Y)) -> 0() div(s(X),n__s(Y)) -> if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0()) geq(X,n__0()) -> true() geq(n__0(),n__s(Y)) -> false() geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y)) if(false(),X,Y) -> activate(Y) if(true(),X,Y) -> activate(X) minus(n__0(),Y) -> 0() minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y)) s(X) -> n__s(X) - Signature: {0/0,activate/1,div/2,geq/2,if/3,minus/2,s/1} / {false/0,n__0/0,n__s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {0,activate,div,geq,if,minus,s} and constructors {false,n__0,n__s ,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: geq(y,x){y -> n__s(y),x -> n__s(x)} = geq(n__s(y),n__s(x)) ->^+ geq(y,x) = C[geq(y,x) = geq(y,x){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: 0() -> n__0() activate(X) -> X activate(n__0()) -> 0() activate(n__s(X)) -> s(X) div(0(),n__s(Y)) -> 0() div(s(X),n__s(Y)) -> if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0()) geq(X,n__0()) -> true() geq(n__0(),n__s(Y)) -> false() geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y)) if(false(),X,Y) -> activate(Y) if(true(),X,Y) -> activate(X) minus(n__0(),Y) -> 0() minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y)) s(X) -> n__s(X) - Signature: {0/0,activate/1,div/2,geq/2,if/3,minus/2,s/1} / {false/0,n__0/0,n__s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {0,activate,div,geq,if,minus,s} and constructors {false,n__0,n__s ,true} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following weak dependency pairs: Strict DPs 0#() -> c_1() activate#(X) -> c_2(X) activate#(n__0()) -> c_3(0#()) activate#(n__s(X)) -> c_4(s#(X)) div#(0(),n__s(Y)) -> c_5(0#()) div#(s(X),n__s(Y)) -> c_6(if#(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())) geq#(X,n__0()) -> c_7() geq#(n__0(),n__s(Y)) -> c_8() geq#(n__s(X),n__s(Y)) -> c_9(geq#(activate(X),activate(Y)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127