details

property	value
status	complete
benchmark	Ex49_GM04.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n057.star.cs.uiowa.edu
space	Strategy_removed_CSR_05

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	0.85381102562 seconds
cpu usage	3.398771409
max memory	4.5428736E7

stage attributes

key	value
output-size	3752
starexec-result	WORST_CASE(Omega(n^1),O(n^1))

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^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: div(0(),s(Y)) -> 0() div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0()) geq(X,0()) -> true() geq(0(),s(Y)) -> false() geq(s(X),s(Y)) -> geq(X,Y) if(false(),X,Y) -> Y if(true(),X,Y) -> X minus(0(),Y) -> 0() minus(s(X),s(Y)) -> minus(X,Y) - Signature: {div/2,geq/2,if/3,minus/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {div,geq,if,minus} 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: div(0(),s(Y)) -> 0() div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0()) geq(X,0()) -> true() geq(0(),s(Y)) -> false() geq(s(X),s(Y)) -> geq(X,Y) if(false(),X,Y) -> Y if(true(),X,Y) -> X minus(0(),Y) -> 0() minus(s(X),s(Y)) -> minus(X,Y) - Signature: {div/2,geq/2,if/3,minus/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {div,geq,if,minus} and constructors {0,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: geq(x,y){x -> s(x),y -> s(y)} = geq(s(x),s(y)) ->^+ geq(x,y) = C[geq(x,y) = geq(x,y){}] ** Step 1.b:1: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: div(0(),s(Y)) -> 0() div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0()) geq(X,0()) -> true() geq(0(),s(Y)) -> false() geq(s(X),s(Y)) -> geq(X,Y) if(false(),X,Y) -> Y if(true(),X,Y) -> X minus(0(),Y) -> 0() minus(s(X),s(Y)) -> minus(X,Y) - Signature: {div/2,geq/2,if/3,minus/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {div,geq,if,minus} and constructors {0,false,s,true} + Applied Processor: Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing} + Details: Signatures used: ---------------- 0 :: [] -(0)-> "A"(4) 0 :: [] -(0)-> "A"(0) 0 :: [] -(0)-> "A"(1) div :: ["A"(4) x "A"(0)] -(1)-> "A"(0) false :: [] -(0)-> "A"(0) geq :: ["A"(1) x "A"(0)] -(1)-> "A"(0) if :: ["A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0) minus :: ["A"(1) x "A"(0)] -(1)-> "A"(4) s :: ["A"(0)] -(0)-> "A"(0) s :: ["A"(4)] -(4)-> "A"(4) s :: ["A"(1)] -(1)-> "A"(1) true :: [] -(0)-> "A"(0) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "0_A" :: [] -(0)-> "A"(0) "false_A" :: [] -(0)-> "A"(0) "s_A" :: ["A"(0)] -(0)-> "A"(0) "true_A" :: [] -(0)-> "A"(0) WORST_CASE(Omega(n^1),O(n^1)) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807