details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	291.656644821 seconds
cpu usage	496.960517627
max memory	1.9117654016E10

stage attributes

key	value
output-size	8533
starexec-result	WORST_CASE(?,O(n^1))

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^1)) * Step 1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a(a(a(a(x1)))) -> b(b(b(b(b(b(x1)))))) b(b(x1)) -> d(d(d(d(x1)))) b(b(b(b(x1)))) -> c(c(c(c(c(c(x1)))))) c(c(c(c(x1)))) -> d(d(d(d(d(d(x1)))))) c(c(d(d(d(d(x1)))))) -> a(a(x1)) - Signature: {a/1,b/1,c/1} / {d/1} - Obligation: derivational complexity wrt. signature {a,b,c,d} + 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(a) = [1] x1 + [18] p(b) = [1] x1 + [12] p(c) = [1] x1 + [8] p(d) = [1] x1 + [5] Following rules are strictly oriented: b(b(x1)) = [1] x1 + [24] > [1] x1 + [20] = d(d(d(d(x1)))) c(c(c(c(x1)))) = [1] x1 + [32] > [1] x1 + [30] = d(d(d(d(d(d(x1)))))) Following rules are (at-least) weakly oriented: a(a(a(a(x1)))) = [1] x1 + [72] >= [1] x1 + [72] = b(b(b(b(b(b(x1)))))) b(b(b(b(x1)))) = [1] x1 + [48] >= [1] x1 + [48] = c(c(c(c(c(c(x1)))))) c(c(d(d(d(d(x1)))))) = [1] x1 + [36] >= [1] x1 + [36] = a(a(x1)) * Step 2: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a(a(a(a(x1)))) -> b(b(b(b(b(b(x1)))))) b(b(b(b(x1)))) -> c(c(c(c(c(c(x1)))))) c(c(d(d(d(d(x1)))))) -> a(a(x1)) - Weak TRS: b(b(x1)) -> d(d(d(d(x1)))) c(c(c(c(x1)))) -> d(d(d(d(d(d(x1)))))) - Signature: {a/1,b/1,c/1} / {d/1} - Obligation: derivational complexity wrt. signature {a,b,c,d} + 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(a) = [1] x1 + [144] p(b) = [1] x1 + [96] p(c) = [1] x1 + [64] p(d) = [1] x1 + [42] Following rules are strictly oriented: c(c(d(d(d(d(x1)))))) = [1] x1 + [296] > [1] x1 + [288] = a(a(x1)) Following rules are (at-least) weakly oriented: a(a(a(a(x1)))) = [1] x1 + [576] >= [1] x1 + [576] = b(b(b(b(b(b(x1)))))) b(b(x1)) = [1] x1 + [192] >= [1] x1 + [168] = d(d(d(d(x1)))) b(b(b(b(x1)))) = [1] x1 + [384] >= [1] x1 + [384] = c(c(c(c(c(c(x1)))))) popout

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

job log

popout

actions

all output return to Deriv Compl Full Rewri 33144