Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904024
details
property
value
status
complete
benchmark
division.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
7.115046978 seconds
cpu usage
23.814226666
max memory
1.54648576E8
stage attributes
key
value
output-size
40890
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: ifMinus(false(),s(X),Y) -> s(minus(X,Y)) ifMinus(true(),s(X),Y) -> 0() 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) -> ifMinus(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: {ifMinus/3,le/2,minus/2,quot/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {ifMinus,le,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: ifMinus(false(),s(X),Y) -> s(minus(X,Y)) ifMinus(true(),s(X),Y) -> 0() 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) -> ifMinus(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: {ifMinus/3,le/2,minus/2,quot/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {ifMinus,le,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^3)) + Considered Problem: - Strict TRS: ifMinus(false(),s(X),Y) -> s(minus(X,Y)) ifMinus(true(),s(X),Y) -> 0() 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) -> ifMinus(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: {ifMinus/3,le/2,minus/2,quot/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {ifMinus,le,minus,quot} and constructors {0,false,s,true} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs ifMinus#(false(),s(X),Y) -> c_1(minus#(X,Y)) ifMinus#(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)) minus#(0(),Y) -> c_6() minus#(s(X),Y) -> c_7(ifMinus#(le(s(X),Y),s(X),Y),le#(s(X),Y)) quot#(0(),s(Y)) -> c_8() quot#(s(X),s(Y)) -> c_9(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^3)) + Considered Problem: - Strict DPs: ifMinus#(false(),s(X),Y) -> c_1(minus#(X,Y)) ifMinus#(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)) minus#(0(),Y) -> c_6() minus#(s(X),Y) -> c_7(ifMinus#(le(s(X),Y),s(X),Y),le#(s(X),Y)) quot#(0(),s(Y)) -> c_8() quot#(s(X),s(Y)) -> c_9(quot#(minus(X,Y),s(Y)),minus#(X,Y)) - Weak TRS: ifMinus(false(),s(X),Y) -> s(minus(X,Y))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807