details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.454548120499 seconds
cpu usage	1.76726967
max memory	3.8428672E7

stage attributes

key	value
output-size	27723
starexec-result	WORST_CASE(Omega(n^1),O(n^1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: a__b() -> a() a__b() -> b() a__f(X1,X2,X3) -> f(X1,X2,X3) a__f(a(),X,X) -> a__f(X,a__b(),b()) mark(a()) -> a() mark(b()) -> a__b() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) - Signature: {a__b/0,a__f/3,mark/1} / {a/0,b/0,f/3} - Obligation: runtime complexity wrt. defined symbols {a__b,a__f,mark} and constructors {a,b,f} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__b() -> a() a__b() -> b() a__f(X1,X2,X3) -> f(X1,X2,X3) a__f(a(),X,X) -> a__f(X,a__b(),b()) mark(a()) -> a() mark(b()) -> a__b() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) - Signature: {a__b/0,a__f/3,mark/1} / {a/0,b/0,f/3} - Obligation: runtime complexity wrt. defined symbols {a__b,a__f,mark} and constructors {a,b,f} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(y){y -> f(x,y,z)} = mark(f(x,y,z)) ->^+ a__f(x,mark(y),z) = C[mark(y) = mark(y){}] ** Step 1.b:1: ToInnermost WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a__b() -> a() a__b() -> b() a__f(X1,X2,X3) -> f(X1,X2,X3) a__f(a(),X,X) -> a__f(X,a__b(),b()) mark(a()) -> a() mark(b()) -> a__b() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) - Signature: {a__b/0,a__f/3,mark/1} / {a/0,b/0,f/3} - Obligation: runtime complexity wrt. defined symbols {a__b,a__f,mark} and constructors {a,b,f} + Applied Processor: ToInnermost + Details: switch to innermost, as the system is overlay and right linear and does not contain weak rules ** Step 1.b:2: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a__b() -> a() a__b() -> b() a__f(X1,X2,X3) -> f(X1,X2,X3) a__f(a(),X,X) -> a__f(X,a__b(),b()) mark(a()) -> a() mark(b()) -> a__b() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) - Signature: {a__b/0,a__f/3,mark/1} / {a/0,b/0,f/3} - Obligation: innermost runtime complexity wrt. defined symbols {a__b,a__f,mark} and constructors {a,b,f} + Applied Processor: DependencyPairs {dpKind_ = WIDP} + Details: We add the following weak innermost dependency pairs: Strict DPs a__b#() -> c_1() a__b#() -> c_2() a__f#(X1,X2,X3) -> c_3() a__f#(a(),X,X) -> c_4(a__f#(X,a__b(),b())) mark#(a()) -> c_5() mark#(b()) -> c_6(a__b#()) mark#(f(X1,X2,X3)) -> c_7(a__f#(X1,mark(X2),X3)) Weak DPs and mark the set of starting terms. ** Step 1.b:3: WeightGap WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: a__b#() -> c_1() popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127