Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904646
details
property
value
status
complete
benchmark
#3.5a.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
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
6.70689320564 seconds
cpu usage
25.947802556
max memory
1.532928E8
stage attributes
key
value
output-size
33063
starexec-result
WORST_CASE(Omega(n^1),O(n^2))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /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(x,s(y)) -> pred(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)) pred(s(x)) -> x - Signature: {if_mod/3,le/2,minus/2,mod/2,pred/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if_mod,le,minus,mod,pred} 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(x,s(y)) -> pred(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)) pred(s(x)) -> x - Signature: {if_mod/3,le/2,minus/2,mod/2,pred/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if_mod,le,minus,mod,pred} 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^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(x,s(y)) -> pred(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)) pred(s(x)) -> x - Signature: {if_mod/3,le/2,minus/2,mod/2,pred/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if_mod,le,minus,mod,pred} and constructors {0,false,s ,true} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs if_mod#(false(),s(x),s(y)) -> c_1() if_mod#(true(),s(x),s(y)) -> c_2(mod#(minus(x,y),s(y)),minus#(x,y)) le#(0(),y) -> c_3() le#(s(x),0()) -> c_4() le#(s(x),s(y)) -> c_5(le#(x,y)) minus#(x,0()) -> c_6() minus#(x,s(y)) -> c_7(pred#(minus(x,y)),minus#(x,y)) mod#(0(),y) -> c_8() mod#(s(x),0()) -> c_9() mod#(s(x),s(y)) -> c_10(if_mod#(le(y,x),s(x),s(y)),le#(y,x)) pred#(s(x)) -> c_11() Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807