details

property	value
status	complete
benchmark	Liveness6.2.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	AProVE_04

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	289.519387007 seconds
cpu usage	1168.3561368
max memory	5.51481344E8

stage attributes

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

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^2)) * Step 1: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: check(cons(x,y)) -> cons(x,y) check(cons(x,y)) -> cons(x,check(y)) check(cons(x,y)) -> cons(check(x),y) check(rest(x)) -> rest(check(x)) check(sent(x)) -> sent(check(x)) rest(cons(x,y)) -> sent(y) rest(nil()) -> sent(nil()) top(sent(x)) -> top(check(rest(x))) - Signature: {check/1,rest/1,top/1} / {cons/2,nil/0,sent/1} - Obligation: derivational complexity wrt. signature {check,cons,nil,rest,sent,top} + 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(check) = [1] x1 + [0] p(cons) = [1] x1 + [1] x2 + [1] p(nil) = [0] p(rest) = [1] x1 + [0] p(sent) = [1] x1 + [0] p(top) = [1] x1 + [0] Following rules are strictly oriented: rest(cons(x,y)) = [1] x + [1] y + [1] > [1] y + [0] = sent(y) Following rules are (at-least) weakly oriented: check(cons(x,y)) = [1] x + [1] y + [1] >= [1] x + [1] y + [1] = cons(x,y) check(cons(x,y)) = [1] x + [1] y + [1] >= [1] x + [1] y + [1] = cons(x,check(y)) check(cons(x,y)) = [1] x + [1] y + [1] >= [1] x + [1] y + [1] = cons(check(x),y) check(rest(x)) = [1] x + [0] >= [1] x + [0] = rest(check(x)) check(sent(x)) = [1] x + [0] >= [1] x + [0] = sent(check(x)) rest(nil()) = [0] >= [0] = sent(nil()) top(sent(x)) = [1] x + [0] >= [1] x + [0] = top(check(rest(x))) * Step 2: WeightGap WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: check(cons(x,y)) -> cons(x,y) check(cons(x,y)) -> cons(x,check(y)) check(cons(x,y)) -> cons(check(x),y) check(rest(x)) -> rest(check(x)) check(sent(x)) -> sent(check(x)) rest(nil()) -> sent(nil()) top(sent(x)) -> top(check(rest(x))) - Weak TRS: rest(cons(x,y)) -> sent(y) - Signature: {check/1,rest/1,top/1} / {cons/2,nil/0,sent/1} - Obligation: derivational complexity wrt. signature {check,cons,nil,rest,sent,top} + 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(check) = [1] x1 + [0] p(cons) = [1] x1 + [1] x2 + [13] p(nil) = [0] popout

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

job log

popout

actions

all output return to Deriv Compl Full Rewri 33144