details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	1.03501319885 seconds
cpu usage	4.092502723
max memory	4.079616E7

stage attributes

key	value
output-size	5016
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: a__f(X) -> f(X) a__f(0()) -> cons(0(),f(s(0()))) a__f(s(0())) -> a__f(a__p(s(0()))) a__p(X) -> p(X) a__p(s(0())) -> 0() mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(f(X)) -> a__f(mark(X)) mark(p(X)) -> a__p(mark(X)) mark(s(X)) -> s(mark(X)) - Signature: {a__f/1,a__p/1,mark/1} / {0/0,cons/2,f/1,p/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__f,a__p,mark} and constructors {0,cons,f,p,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__f(X) -> f(X) a__f(0()) -> cons(0(),f(s(0()))) a__f(s(0())) -> a__f(a__p(s(0()))) a__p(X) -> p(X) a__p(s(0())) -> 0() mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(f(X)) -> a__f(mark(X)) mark(p(X)) -> a__p(mark(X)) mark(s(X)) -> s(mark(X)) - Signature: {a__f/1,a__p/1,mark/1} / {0/0,cons/2,f/1,p/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__f,a__p,mark} and constructors {0,cons,f,p,s} + 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__f(X) -> f(X) a__f(0()) -> cons(0(),f(s(0()))) a__f(s(0())) -> a__f(a__p(s(0()))) a__p(X) -> p(X) a__p(s(0())) -> 0() mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(f(X)) -> a__f(mark(X)) mark(p(X)) -> a__p(mark(X)) mark(s(X)) -> s(mark(X)) - Signature: {a__f/1,a__p/1,mark/1} / {0/0,cons/2,f/1,p/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__f,a__p,mark} and constructors {0,cons,f,p,s} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 3. The enriched problem is compatible with follwoing automaton. 0_0() -> 2 0_1() -> 1 0_1() -> 3 0_1() -> 6 0_1() -> 8 0_2() -> 1 0_2() -> 7 0_2() -> 8 0_3() -> 11 a__f_0(2) -> 1 a__f_1(7) -> 1 a__f_1(8) -> 1 a__f_1(8) -> 8 a__f_2(11) -> 1 a__f_2(11) -> 8 a__p_0(2) -> 1 a__p_1(5) -> 7 a__p_1(8) -> 1 a__p_1(8) -> 8 a__p_2(10) -> 11 cons_0(2,2) -> 2 cons_1(3,4) -> 1 cons_1(8,2) -> 1 cons_1(8,2) -> 8 cons_2(7,9) -> 1 popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807