Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904976
details
property
value
status
complete
benchmark
#3.8b.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n070.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
6.59986400604 seconds
cpu usage
32.550876948
max memory
1.4055424E8
stage attributes
key
value
output-size
61559
starexec-result
WORST_CASE(Omega(n^1),O(n^4))
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^4)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^4)) + Considered Problem: - Strict TRS: if_minus(false(),s(x),y) -> s(minus(x,y)) if_minus(true(),s(x),y) -> 0() le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) - Signature: {if_minus/3,le/2,log/1,minus/2,quot/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if_minus,le,log,minus,quot} 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() le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) - Signature: {if_minus/3,le/2,log/1,minus/2,quot/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if_minus,le,log,minus,quot} 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^4)) + Considered Problem: - Strict TRS: if_minus(false(),s(x),y) -> s(minus(x,y)) if_minus(true(),s(x),y) -> 0() le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) - Signature: {if_minus/3,le/2,log/1,minus/2,quot/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if_minus,le,log,minus,quot} 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() le#(0(),y) -> c_3() le#(s(x),0()) -> c_4() le#(s(x),s(y)) -> c_5(le#(x,y)) log#(s(0())) -> c_6() log#(s(s(x))) -> c_7(log#(s(quot(x,s(s(0()))))),quot#(x,s(s(0())))) minus#(0(),y) -> c_8() minus#(s(x),y) -> c_9(if_minus#(le(s(x),y),s(x),y),le#(s(x),y)) quot#(0(),s(y)) -> c_10() quot#(s(x),s(y)) -> c_11(quot#(minus(x,y),s(y)),minus#(x,y)) Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^4)) + 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