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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	233.413949966 seconds
cpu usage	576.036003264
max memory	3.12057856E8

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^3)) * Step 1: WeightGap WORST_CASE(?,O(n^3)) + 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: derivational complexity wrt. signature {0,a__f,a__p,cons,f,mark,p,s} + Applied Processor: WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = NoUArgs, wgOn = WgOnAny} + Details: The weightgap principle applies using the following nonconstant growth matrix-interpretation: We apply a matrix interpretation of kind triangular matrix interpretation: Following symbols are considered usable: all TcT has computed the following interpretation: p(0) = [11] p(a__f) = [1] x1 + [0] p(a__p) = [1] x1 + [0] p(cons) = [1] x1 + [1] x2 + [0] p(f) = [1] x1 + [3] p(mark) = [1] x1 + [0] p(p) = [1] x1 + [0] p(s) = [1] x1 + [0] Following rules are strictly oriented: mark(f(X)) = [1] X + [3] > [1] X + [0] = a__f(mark(X)) Following rules are (at-least) weakly oriented: a__f(X) = [1] X + [0] >= [1] X + [3] = f(X) a__f(0()) = [11] >= [25] = cons(0(),f(s(0()))) a__f(s(0())) = [11] >= [11] = a__f(a__p(s(0()))) a__p(X) = [1] X + [0] >= [1] X + [0] = p(X) a__p(s(0())) = [11] >= [11] = 0() mark(0()) = [11] >= [11] = 0() mark(cons(X1,X2)) = [1] X1 + [1] X2 + [0] >= [1] X1 + [1] X2 + [0] = cons(mark(X1),X2) mark(p(X)) = [1] X + [0] >= [1] X + [0] = a__p(mark(X)) mark(s(X)) = [1] X + [0] >= [1] X + [0] = s(mark(X)) Further, it can be verified that all rules not oriented are covered by the weightgap condition. * Step 2: WeightGap WORST_CASE(?,O(n^3)) + 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(p(X)) -> a__p(mark(X)) mark(s(X)) -> s(mark(X)) - Weak TRS: mark(f(X)) -> a__f(mark(X)) popout

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

job log

popout

actions

all output return to Deriv Compl Full Rewri 33144