details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.0805261135101 seconds
cpu usage	0.277106671
max memory	3.5258368E7

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /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: 0() -> n__0() activate(X) -> X activate(n__0()) -> 0() activate(n__f(X)) -> f(activate(X)) activate(n__s(X)) -> s(activate(X)) f(X) -> n__f(X) f(0()) -> cons(0(),n__f(n__s(n__0()))) f(s(0())) -> f(p(s(0()))) p(s(0())) -> 0() s(X) -> n__s(X) - Signature: {0/0,activate/1,f/1,p/1,s/1} / {cons/2,n__0/0,n__f/1,n__s/1} - Obligation: runtime complexity wrt. defined symbols {0,activate,f,p,s} and constructors {cons,n__0,n__f,n__s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: 0() -> n__0() activate(X) -> X activate(n__0()) -> 0() activate(n__f(X)) -> f(activate(X)) activate(n__s(X)) -> s(activate(X)) f(X) -> n__f(X) f(0()) -> cons(0(),n__f(n__s(n__0()))) f(s(0())) -> f(p(s(0()))) p(s(0())) -> 0() s(X) -> n__s(X) - Signature: {0/0,activate/1,f/1,p/1,s/1} / {cons/2,n__0/0,n__f/1,n__s/1} - Obligation: runtime complexity wrt. defined symbols {0,activate,f,p,s} and constructors {cons,n__0,n__f,n__s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: activate(x){x -> n__f(x)} = activate(n__f(x)) ->^+ f(activate(x)) = C[activate(x) = activate(x){}] ** Step 1.b:1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: 0() -> n__0() activate(X) -> X activate(n__0()) -> 0() activate(n__f(X)) -> f(activate(X)) activate(n__s(X)) -> s(activate(X)) f(X) -> n__f(X) f(0()) -> cons(0(),n__f(n__s(n__0()))) f(s(0())) -> f(p(s(0()))) p(s(0())) -> 0() s(X) -> n__s(X) - Signature: {0/0,activate/1,f/1,p/1,s/1} / {cons/2,n__0/0,n__f/1,n__s/1} - Obligation: runtime complexity wrt. defined symbols {0,activate,f,p,s} and constructors {cons,n__0,n__f,n__s} + 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() -> 1 0_1() -> 1 0_1() -> 3 0_2() -> 4 0_3() -> 7 activate_0(2) -> 1 activate_1(2) -> 3 cons_0(2,2) -> 1 cons_0(2,2) -> 2 cons_0(2,2) -> 3 cons_2(4,5) -> 1 cons_2(4,5) -> 3 cons_3(7,9) -> 1 cons_3(7,9) -> 3 f_0(2) -> 1 f_1(3) -> 1 f_1(3) -> 3 f_2(7) -> 1 f_2(7) -> 3 n__0_0() -> 1 n__0_0() -> 2 n__0_0() -> 3 n__0_1() -> 1 n__0_2() -> 1 n__0_2() -> 3 popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127