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	n071.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	30.0389299393 seconds
cpu usage	84.70898274
max memory	1.31207168E8

stage attributes

key	value
output-size	29529
starexec-result	WORST_CASE(?,O(n^2))

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^2)) * Step 1: NaturalMI WORST_CASE(?,O(n^2)) + 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: derivational complexity wrt. signature {0,activate,cons,f,n__0,n__f,n__s,p,s} + 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(activate) = [1] x1 + [5] p(cons) = [1] x1 + [1] x2 + [0] p(f) = [1] x1 + [0] p(n__0) = [0] p(n__f) = [1] x1 + [0] p(n__s) = [1] x1 + [0] p(p) = [1] x1 + [0] p(s) = [1] x1 + [0] Following rules are strictly oriented: activate(X) = [1] X + [5] > [1] X + [0] = X activate(n__0()) = [5] > [0] = 0() Following rules are (at-least) weakly oriented: 0() = [0] >= [0] = n__0() activate(n__f(X)) = [1] X + [5] >= [1] X + [5] = f(activate(X)) activate(n__s(X)) = [1] X + [5] >= [1] X + [5] = s(activate(X)) f(X) = [1] X + [0] >= [1] X + [0] = n__f(X) f(0()) = [0] >= [0] = cons(0(),n__f(n__s(n__0()))) f(s(0())) = [0] >= [0] = f(p(s(0()))) p(s(0())) = [0] >= [0] = 0() s(X) = [1] X + [0] >= [1] X + [0] = n__s(X) * Step 2: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: 0() -> n__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) - Weak TRS: activate(X) -> X activate(n__0()) -> 0() - Signature: popout

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

job log

popout

actions

all output return to Deriv Compl Full Rewri 33144