Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904858
details
property
value
status
complete
benchmark
#3.5b.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
7.21595311165 seconds
cpu usage
27.540477055
max memory
1.23035648E8
stage attributes
key
value
output-size
54543
starexec-result
WORST_CASE(Omega(n^1),O(n^3))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),O(n^3)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^3)) + Considered Problem: - Strict TRS: if_minus(false(),s(x),y) -> s(minus(x,y)) if_minus(true(),s(x),y) -> 0() if_mod(false(),s(x),s(y)) -> s(x) if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) - Signature: {if_minus/3,if_mod/3,le/2,minus/2,mod/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if_minus,if_mod,le,minus,mod} and constructors {0,false,s ,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: if_minus(false(),s(x),y) -> s(minus(x,y)) if_minus(true(),s(x),y) -> 0() if_mod(false(),s(x),s(y)) -> s(x) if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) - Signature: {if_minus/3,if_mod/3,le/2,minus/2,mod/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if_minus,if_mod,le,minus,mod} and constructors {0,false,s ,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: le(x,y){x -> s(x),y -> s(y)} = le(s(x),s(y)) ->^+ le(x,y) = C[le(x,y) = le(x,y){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: if_minus(false(),s(x),y) -> s(minus(x,y)) if_minus(true(),s(x),y) -> 0() if_mod(false(),s(x),s(y)) -> s(x) if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) - Signature: {if_minus/3,if_mod/3,le/2,minus/2,mod/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if_minus,if_mod,le,minus,mod} and constructors {0,false,s ,true} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs if_minus#(false(),s(x),y) -> c_1(minus#(x,y)) if_minus#(true(),s(x),y) -> c_2() if_mod#(false(),s(x),s(y)) -> c_3() if_mod#(true(),s(x),s(y)) -> c_4(mod#(minus(x,y),s(y)),minus#(x,y)) le#(0(),y) -> c_5() le#(s(x),0()) -> c_6() le#(s(x),s(y)) -> c_7(le#(x,y)) minus#(0(),y) -> c_8() minus#(s(x),y) -> c_9(if_minus#(le(s(x),y),s(x),y),le#(s(x),y)) mod#(0(),y) -> c_10() mod#(s(x),0()) -> c_11() mod#(s(x),s(y)) -> c_12(if_mod#(le(y,x),s(x),s(y)),le#(y,x)) Weak DPs
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807