details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	293.155637026 seconds
cpu usage	756.892774558
max memory	7.82843904E8

stage attributes

key	value
output-size	89742
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: WeightGap WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: active(f(x)) -> f(active(x)) active(f(x)) -> mark(x) check(x) -> start(match(f(X()),x)) check(f(x)) -> f(check(x)) f(found(x)) -> found(f(x)) f(mark(x)) -> mark(f(x)) f(ok(x)) -> ok(f(x)) match(X(),x) -> proper(x) match(f(x),f(y)) -> f(match(x,y)) proper(c()) -> ok(c()) proper(f(x)) -> f(proper(x)) start(ok(x)) -> found(x) top(active(c())) -> top(mark(c())) top(found(x)) -> top(active(x)) top(mark(x)) -> top(check(x)) - Signature: {active/1,check/1,f/1,match/2,proper/1,start/1,top/1} / {X/0,c/0,found/1,mark/1,ok/1} - Obligation: derivational complexity wrt. signature {X,active,c,check,f,found,mark,match,ok,proper,start,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(X) = [0] p(active) = [1] x1 + [0] p(c) = [0] p(check) = [1] x1 + [0] p(f) = [1] x1 + [0] p(found) = [1] x1 + [0] p(mark) = [1] x1 + [5] p(match) = [1] x1 + [1] x2 + [0] p(ok) = [1] x1 + [0] p(proper) = [1] x1 + [0] p(start) = [1] x1 + [0] p(top) = [1] x1 + [0] Following rules are strictly oriented: top(mark(x)) = [1] x + [5] > [1] x + [0] = top(check(x)) Following rules are (at-least) weakly oriented: active(f(x)) = [1] x + [0] >= [1] x + [0] = f(active(x)) active(f(x)) = [1] x + [0] >= [1] x + [5] = mark(x) check(x) = [1] x + [0] >= [1] x + [0] = start(match(f(X()),x)) check(f(x)) = [1] x + [0] >= [1] x + [0] = f(check(x)) f(found(x)) = [1] x + [0] >= [1] x + [0] = found(f(x)) f(mark(x)) = [1] x + [5] >= [1] x + [5] = mark(f(x)) f(ok(x)) = [1] x + [0] >= [1] x + [0] = ok(f(x)) match(X(),x) = [1] x + [0] >= [1] x + [0] = proper(x) match(f(x),f(y)) = [1] x + [1] y + [0] >= [1] x + [1] y + [0] = f(match(x,y)) proper(c()) = [0] >= [0] = ok(c()) proper(f(x)) = [1] x + [0] >= [1] x + [0] popout

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

job log

popout

actions

all output return to Deriv Compl Full Rewri 33144