Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902776
details
property
value
status
complete
benchmark
Liveness6.2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n029.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
53.703327179 seconds
cpu usage
141.903985287
max memory
3.9974912E8
stage attributes
key
value
output-size
86378
starexec-result
WORST_CASE(Omega(n^1),O(n^2))
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^2)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^2)) + Considered Problem: - Strict TRS: check(cons(x,y)) -> cons(x,y) check(cons(x,y)) -> cons(x,check(y)) check(cons(x,y)) -> cons(check(x),y) check(rest(x)) -> rest(check(x)) check(sent(x)) -> sent(check(x)) rest(cons(x,y)) -> sent(y) rest(nil()) -> sent(nil()) top(sent(x)) -> top(check(rest(x))) - Signature: {check/1,rest/1,top/1} / {cons/2,nil/0,sent/1} - Obligation: runtime complexity wrt. defined symbols {check,rest,top} and constructors {cons,nil,sent} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: check(cons(x,y)) -> cons(x,y) check(cons(x,y)) -> cons(x,check(y)) check(cons(x,y)) -> cons(check(x),y) check(rest(x)) -> rest(check(x)) check(sent(x)) -> sent(check(x)) rest(cons(x,y)) -> sent(y) rest(nil()) -> sent(nil()) top(sent(x)) -> top(check(rest(x))) - Signature: {check/1,rest/1,top/1} / {cons/2,nil/0,sent/1} - Obligation: runtime complexity wrt. defined symbols {check,rest,top} and constructors {cons,nil,sent} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: check(y){y -> cons(x,y)} = check(cons(x,y)) ->^+ cons(x,check(y)) = C[check(y) = check(y){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: check(cons(x,y)) -> cons(x,y) check(cons(x,y)) -> cons(x,check(y)) check(cons(x,y)) -> cons(check(x),y) check(rest(x)) -> rest(check(x)) check(sent(x)) -> sent(check(x)) rest(cons(x,y)) -> sent(y) rest(nil()) -> sent(nil()) top(sent(x)) -> top(check(rest(x))) - Signature: {check/1,rest/1,top/1} / {cons/2,nil/0,sent/1} - Obligation: runtime complexity wrt. defined symbols {check,rest,top} and constructors {cons,nil,sent} + Applied Processor: DependencyPairs {dpKind_ = WIDP} + Details: We add the following weak dependency pairs: Strict DPs check#(cons(x,y)) -> c_1(x,y) check#(cons(x,y)) -> c_2(x,check#(y)) check#(cons(x,y)) -> c_3(check#(x),y) check#(rest(x)) -> c_4(rest#(check(x))) check#(sent(x)) -> c_5(check#(x)) rest#(cons(x,y)) -> c_6(y) rest#(nil()) -> c_7() top#(sent(x)) -> c_8(top#(check(rest(x)))) Weak DPs and mark the set of starting terms. ** Step 1.b:2: UsableRules WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: check#(cons(x,y)) -> c_1(x,y) check#(cons(x,y)) -> c_2(x,check#(y)) check#(cons(x,y)) -> c_3(check#(x),y) check#(rest(x)) -> c_4(rest#(check(x))) check#(sent(x)) -> c_5(check#(x)) rest#(cons(x,y)) -> c_6(y) rest#(nil()) -> c_7() top#(sent(x)) -> c_8(top#(check(rest(x)))) - Strict TRS: check(cons(x,y)) -> cons(x,y) check(cons(x,y)) -> cons(x,check(y)) check(cons(x,y)) -> cons(check(x),y) check(rest(x)) -> rest(check(x)) check(sent(x)) -> sent(check(x)) rest(cons(x,y)) -> sent(y)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127