details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	0.925103902817 seconds
cpu usage	3.901659225
max memory	4.0439808E7

stage attributes

key	value
output-size	4640
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: a__tail(X) -> tail(X) a__tail(cons(X,XS)) -> mark(XS) a__zeros() -> cons(0(),zeros()) a__zeros() -> zeros() mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(tail(X)) -> a__tail(mark(X)) mark(zeros()) -> a__zeros() - Signature: {a__tail/1,a__zeros/0,mark/1} / {0/0,cons/2,tail/1,zeros/0} - Obligation: innermost runtime complexity wrt. defined symbols {a__tail,a__zeros,mark} and constructors {0,cons,tail ,zeros} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__tail(X) -> tail(X) a__tail(cons(X,XS)) -> mark(XS) a__zeros() -> cons(0(),zeros()) a__zeros() -> zeros() mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(tail(X)) -> a__tail(mark(X)) mark(zeros()) -> a__zeros() - Signature: {a__tail/1,a__zeros/0,mark/1} / {0/0,cons/2,tail/1,zeros/0} - Obligation: innermost runtime complexity wrt. defined symbols {a__tail,a__zeros,mark} and constructors {0,cons,tail ,zeros} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(x){x -> cons(x,y)} = mark(cons(x,y)) ->^+ cons(mark(x),y) = C[mark(x) = mark(x){}] ** Step 1.b:1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a__tail(X) -> tail(X) a__tail(cons(X,XS)) -> mark(XS) a__zeros() -> cons(0(),zeros()) a__zeros() -> zeros() mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(tail(X)) -> a__tail(mark(X)) mark(zeros()) -> a__zeros() - Signature: {a__tail/1,a__zeros/0,mark/1} / {0/0,cons/2,tail/1,zeros/0} - Obligation: innermost runtime complexity wrt. defined symbols {a__tail,a__zeros,mark} and constructors {0,cons,tail ,zeros} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 4. The enriched problem is compatible with follwoing automaton. 0_0() -> 2 0_1() -> 1 0_1() -> 3 0_2() -> 5 0_3() -> 7 0_4() -> 9 a__tail_0(2) -> 1 a__tail_1(1) -> 1 a__zeros_0() -> 1 a__zeros_1() -> 1 a__zeros_2() -> 1 a__zeros_3() -> 1 cons_0(2,2) -> 2 cons_1(1,2) -> 1 cons_1(3,4) -> 1 cons_2(5,6) -> 1 cons_3(7,8) -> 1 cons_4(9,10) -> 1 mark_0(2) -> 1 mark_1(2) -> 1 mark_2(2) -> 1 mark_2(4) -> 1 mark_2(6) -> 1 mark_2(8) -> 1 mark_2(10) -> 1 tail_0(2) -> 2 tail_1(2) -> 1 tail_2(1) -> 1 popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807