details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	20.8587949276 seconds
cpu usage	121.427927959
max memory	3.45165824E8

stage attributes

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

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^3)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^3)) + Considered Problem: - Strict TRS: a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__length(X) -> length(X) a__length(cons(X,Y)) -> s(a__length1(Y)) a__length(nil()) -> 0() a__length1(X) -> a__length(X) a__length1(X) -> length1(X) mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(length(X)) -> a__length(X) mark(length1(X)) -> a__length1(X) mark(nil()) -> nil() mark(s(X)) -> s(mark(X)) - Signature: {a__from/1,a__length/1,a__length1/1,mark/1} / {0/0,cons/2,from/1,length/1,length1/1,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__from,a__length,a__length1,mark} and constructors {0 ,cons,from,length,length1,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__length(X) -> length(X) a__length(cons(X,Y)) -> s(a__length1(Y)) a__length(nil()) -> 0() a__length1(X) -> a__length(X) a__length1(X) -> length1(X) mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(length(X)) -> a__length(X) mark(length1(X)) -> a__length1(X) mark(nil()) -> nil() mark(s(X)) -> s(mark(X)) - Signature: {a__from/1,a__length/1,a__length1/1,mark/1} / {0/0,cons/2,from/1,length/1,length1/1,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__from,a__length,a__length1,mark} and constructors {0 ,cons,from,length,length1,nil,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: NaturalMI WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__length(X) -> length(X) a__length(cons(X,Y)) -> s(a__length1(Y)) a__length(nil()) -> 0() a__length1(X) -> a__length(X) a__length1(X) -> length1(X) mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(length(X)) -> a__length(X) mark(length1(X)) -> a__length1(X) mark(nil()) -> nil() mark(s(X)) -> s(mark(X)) - Signature: {a__from/1,a__length/1,a__length1/1,mark/1} / {0/0,cons/2,from/1,length/1,length1/1,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__from,a__length,a__length1,mark} and constructors {0 ,cons,from,length,length1,nil,s} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(a__from) = {1}, uargs(cons) = {1}, uargs(s) = {1} Following symbols are considered usable: {a__from,a__length,a__length1,mark} TcT has computed the following interpretation: p(0) = [0] p(a__from) = [1] x1 + [4] p(a__length) = [2] popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807