details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	0.701020956039 seconds
cpu usage	2.558064943
max memory	3.8350848E7

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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__c() -> b() a__c() -> c() a__f(X1,X2,X3) -> f(X1,X2,X3) a__f(b(),X,c()) -> a__f(X,a__c(),X) mark(b()) -> b() mark(c()) -> a__c() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) - Signature: {a__c/0,a__f/3,mark/1} / {b/0,c/0,f/3} - Obligation: innermost runtime complexity wrt. defined symbols {a__c,a__f,mark} and constructors {b,c,f} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__c() -> b() a__c() -> c() a__f(X1,X2,X3) -> f(X1,X2,X3) a__f(b(),X,c()) -> a__f(X,a__c(),X) mark(b()) -> b() mark(c()) -> a__c() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) - Signature: {a__c/0,a__f/3,mark/1} / {b/0,c/0,f/3} - Obligation: innermost runtime complexity wrt. defined symbols {a__c,a__f,mark} and constructors {b,c,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: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a__c() -> b() a__c() -> c() a__f(X1,X2,X3) -> f(X1,X2,X3) a__f(b(),X,c()) -> a__f(X,a__c(),X) mark(b()) -> b() mark(c()) -> a__c() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) - Signature: {a__c/0,a__f/3,mark/1} / {b/0,c/0,f/3} - Obligation: innermost runtime complexity wrt. defined symbols {a__c,a__f,mark} and constructors {b,c,f} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs a__c#() -> c_1() a__c#() -> c_2() a__f#(X1,X2,X3) -> c_3() a__f#(b(),X,c()) -> c_4(a__f#(X,a__c(),X),a__c#()) mark#(b()) -> c_5() mark#(c()) -> c_6(a__c#()) mark#(f(X1,X2,X3)) -> c_7(a__f#(X1,mark(X2),X3),mark#(X2)) Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: a__c#() -> c_1() a__c#() -> c_2() a__f#(X1,X2,X3) -> c_3() a__f#(b(),X,c()) -> c_4(a__f#(X,a__c(),X),a__c#()) mark#(b()) -> c_5() mark#(c()) -> c_6(a__c#()) mark#(f(X1,X2,X3)) -> c_7(a__f#(X1,mark(X2),X3),mark#(X2)) - Weak TRS: a__c() -> b() a__c() -> c() a__f(X1,X2,X3) -> f(X1,X2,X3) a__f(b(),X,c()) -> a__f(X,a__c(),X) mark(b()) -> b() mark(c()) -> a__c() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) - Signature: {a__c/0,a__f/3,mark/1,a__c#/0,a__f#/3,mark#/1} / {b/0,c/0,f/3,c_1/0,c_2/0,c_3/0,c_4/2,c_5/0,c_6/1,c_7/2} - Obligation: innermost runtime complexity wrt. defined symbols {a__c#,a__f#,mark#} and constructors {b,c,f} popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807