Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903068
details
property
value
status
complete
benchmark
#3.5.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
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
1.76783895493 seconds
cpu usage
5.897679492
max memory
7.2134656E7
stage attributes
key
value
output-size
20682
starexec-result
WORST_CASE(Omega(n^1),O(n^2))
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^2)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^2)) + Considered Problem: - Strict TRS: 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(x,0()) -> x minus(s(x),s(y)) -> minus(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_mod/3,le/2,minus/2,mod/2} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {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_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(x,0()) -> x minus(s(x),s(y)) -> minus(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_mod/3,le/2,minus/2,mod/2} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {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: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: 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(x,0()) -> x minus(s(x),s(y)) -> minus(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_mod/3,le/2,minus/2,mod/2} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {if_mod,le,minus,mod} and constructors {0,false,s,true} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(if_mod) = {1}, uargs(mod) = {1} Following symbols are considered usable: all TcT has computed the following interpretation: p(0) = [0] p(false) = [0] p(if_mod) = [1] x1 + [8] x2 + [1] x3 + [2] p(le) = [0] p(minus) = [1] x1 + [0] p(mod) = [8] x1 + [1] x2 + [7] p(s) = [1] x1 + [1] p(true) = [0] Following rules are strictly oriented: if_mod(false(),s(x),s(y)) = [8] x + [1] y + [11] > [1] x + [1] = s(x) if_mod(true(),s(x),s(y)) = [8] x + [1] y + [11] > [8] x + [1] y + [8] = mod(minus(x,y),s(y)) minus(s(x),s(y)) = [1] x + [1]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127