details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	1.7011680603 seconds
cpu usage	7.007940813
max memory	7.2691712E7

stage attributes

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

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^2)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^2)) + Considered Problem: - Strict TRS: if(false(),x,y) -> y if(true(),x,y) -> x 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)) -> if(le(x,s(y)),0(),p(minus(x,p(s(y))))) p(0()) -> 0() p(s(x)) -> x - Signature: {if/3,le/2,minus/2,p/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if,le,minus,p} 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(false(),x,y) -> y if(true(),x,y) -> x 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)) -> if(le(x,s(y)),0(),p(minus(x,p(s(y))))) p(0()) -> 0() p(s(x)) -> x - Signature: {if/3,le/2,minus/2,p/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if,le,minus,p} 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: Ara WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: if(false(),x,y) -> y if(true(),x,y) -> x 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)) -> if(le(x,s(y)),0(),p(minus(x,p(s(y))))) p(0()) -> 0() p(s(x)) -> x - Signature: {if/3,le/2,minus/2,p/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if,le,minus,p} 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"(0, 0) 0 :: [] -(0)-> "A"(1, 0) 0 :: [] -(0)-> "A"(6, 6) 0 :: [] -(0)-> "A"(0, 6) false :: [] -(0)-> "A"(0, 0) if :: ["A"(0, 0) x "A"(0, 6) x "A"(0, 6)] -(1)-> "A"(0, 6) le :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(0, 0) minus :: ["A"(0, 6) x "A"(6, 6)] -(1)-> "A"(0, 6) p :: ["A"(0, 6)] -(1)-> "A"(6, 6) s :: ["A"(0, 0)] -(0)-> "A"(0, 0) s :: ["A"(1, 0)] -(1)-> "A"(1, 0) s :: ["A"(12, 6)] -(6)-> "A"(6, 6) s :: ["A"(6, 6)] -(0)-> "A"(0, 6) true :: [] -(0)-> "A"(0, 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) popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807