details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	1.68730807304 seconds
cpu usage	7.083090016
max memory	1.0121216E8

stage attributes

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

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^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: D(*(x,y)) -> +(*(y,D(x)),*(x,D(y))) D(+(x,y)) -> +(D(x),D(y)) D(-(x,y)) -> -(D(x),D(y)) D(constant()) -> 0() D(t()) -> 1() - Signature: {D/1} / {*/2,+/2,-/2,0/0,1/0,constant/0,t/0} - Obligation: innermost runtime complexity wrt. defined symbols {D} and constructors {*,+,-,0,1,constant,t} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: D(*(x,y)) -> +(*(y,D(x)),*(x,D(y))) D(+(x,y)) -> +(D(x),D(y)) D(-(x,y)) -> -(D(x),D(y)) D(constant()) -> 0() D(t()) -> 1() - Signature: {D/1} / {*/2,+/2,-/2,0/0,1/0,constant/0,t/0} - Obligation: innermost runtime complexity wrt. defined symbols {D} and constructors {*,+,-,0,1,constant,t} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: D(x){x -> *(x,y)} = D(*(x,y)) ->^+ +(*(y,D(x)),*(x,D(y))) = C[D(x) = D(x){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: D(*(x,y)) -> +(*(y,D(x)),*(x,D(y))) D(+(x,y)) -> +(D(x),D(y)) D(-(x,y)) -> -(D(x),D(y)) D(constant()) -> 0() D(t()) -> 1() - Signature: {D/1} / {*/2,+/2,-/2,0/0,1/0,constant/0,t/0} - Obligation: innermost runtime complexity wrt. defined symbols {D} and constructors {*,+,-,0,1,constant,t} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs D#(*(x,y)) -> c_1(D#(x),D#(y)) D#(+(x,y)) -> c_2(D#(x),D#(y)) D#(-(x,y)) -> c_3(D#(x),D#(y)) D#(constant()) -> c_4() D#(t()) -> c_5() Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: D#(*(x,y)) -> c_1(D#(x),D#(y)) D#(+(x,y)) -> c_2(D#(x),D#(y)) D#(-(x,y)) -> c_3(D#(x),D#(y)) D#(constant()) -> c_4() D#(t()) -> c_5() - Weak TRS: D(*(x,y)) -> +(*(y,D(x)),*(x,D(y))) D(+(x,y)) -> +(D(x),D(y)) D(-(x,y)) -> -(D(x),D(y)) D(constant()) -> 0() D(t()) -> 1() - Signature: {D/1,D#/1} / {*/2,+/2,-/2,0/0,1/0,constant/0,t/0,c_1/2,c_2/2,c_3/2,c_4/0,c_5/0} - Obligation: innermost runtime complexity wrt. defined symbols {D#} and constructors {*,+,-,0,1,constant,t} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {4,5} by application of Pre({4,5}) = {1,2,3}. Here rules are labelled as follows: 1: D#(*(x,y)) -> c_1(D#(x),D#(y)) 2: D#(+(x,y)) -> c_2(D#(x),D#(y)) 3: D#(-(x,y)) -> c_3(D#(x),D#(y)) 4: D#(constant()) -> c_4() popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807