details

property	value
status	complete
benchmark	Ex4_7_77_Bor03_iGM.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_dc
runtime (wallclock)	174.060653925 seconds
cpu usage	302.349453374
max memory	6.69605888E8

stage attributes

key	value
output-size	41771
starexec-result	WORST_CASE(?,O(n^3))

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^3)) * Step 1: NaturalMI WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: active(tail(cons(X,XS))) -> mark(XS) active(zeros()) -> mark(cons(0(),zeros())) cons(X1,active(X2)) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) cons(active(X1),X2) -> cons(X1,X2) cons(mark(X1),X2) -> cons(X1,X2) mark(0()) -> active(0()) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(tail(X)) -> active(tail(mark(X))) mark(zeros()) -> active(zeros()) tail(active(X)) -> tail(X) tail(mark(X)) -> tail(X) - Signature: {active/1,cons/2,mark/1,tail/1} / {0/0,zeros/0} - Obligation: derivational complexity wrt. signature {0,active,cons,mark,tail,zeros} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind triangular matrix interpretation: Following symbols are considered usable: all TcT has computed the following interpretation: p(0) = [0] p(active) = [1] x1 + [0] p(cons) = [1] x1 + [1] x2 + [0] p(mark) = [1] x1 + [0] p(tail) = [1] x1 + [1] p(zeros) = [8] Following rules are strictly oriented: active(tail(cons(X,XS))) = [1] X + [1] XS + [1] > [1] XS + [0] = mark(XS) Following rules are (at-least) weakly oriented: active(zeros()) = [8] >= [8] = mark(cons(0(),zeros())) cons(X1,active(X2)) = [1] X1 + [1] X2 + [0] >= [1] X1 + [1] X2 + [0] = cons(X1,X2) cons(X1,mark(X2)) = [1] X1 + [1] X2 + [0] >= [1] X1 + [1] X2 + [0] = cons(X1,X2) cons(active(X1),X2) = [1] X1 + [1] X2 + [0] >= [1] X1 + [1] X2 + [0] = cons(X1,X2) cons(mark(X1),X2) = [1] X1 + [1] X2 + [0] >= [1] X1 + [1] X2 + [0] = cons(X1,X2) mark(0()) = [0] >= [0] = active(0()) mark(cons(X1,X2)) = [1] X1 + [1] X2 + [0] >= [1] X1 + [1] X2 + [0] = active(cons(mark(X1),X2)) mark(tail(X)) = [1] X + [1] >= [1] X + [1] = active(tail(mark(X))) mark(zeros()) = [8] >= [8] = active(zeros()) tail(active(X)) = [1] X + [1] >= [1] X + [1] = tail(X) tail(mark(X)) = [1] X + [1] >= [1] X + [1] = tail(X) * Step 2: WeightGap WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: active(zeros()) -> mark(cons(0(),zeros())) cons(X1,active(X2)) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) cons(active(X1),X2) -> cons(X1,X2) cons(mark(X1),X2) -> cons(X1,X2) popout

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

job log

popout

actions

all output return to Deriv Compl Full Rewri 33144