details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	0.730385065079 seconds
cpu usage	1.902787071
max memory	4.6075904E7

stage attributes

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

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^2)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^2)) + Considered Problem: - Strict TRS: f(0()) -> true() f(1()) -> false() f(s(x)) -> f(x) g(x,c(y)) -> c(g(x,y)) g(x,c(y)) -> g(x,if(f(x),c(g(s(x),y)),c(y))) if(false(),s(x),s(y)) -> s(y) if(true(),s(x),s(y)) -> s(x) - Signature: {f/1,g/2,if/3} / {0/0,1/0,c/1,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {f,g,if} and constructors {0,1,c,false,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: f(0()) -> true() f(1()) -> false() f(s(x)) -> f(x) g(x,c(y)) -> c(g(x,y)) g(x,c(y)) -> g(x,if(f(x),c(g(s(x),y)),c(y))) if(false(),s(x),s(y)) -> s(y) if(true(),s(x),s(y)) -> s(x) - Signature: {f/1,g/2,if/3} / {0/0,1/0,c/1,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {f,g,if} and constructors {0,1,c,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: f(x){x -> s(x)} = f(s(x)) ->^+ f(x) = C[f(x) = f(x){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: f(0()) -> true() f(1()) -> false() f(s(x)) -> f(x) g(x,c(y)) -> c(g(x,y)) g(x,c(y)) -> g(x,if(f(x),c(g(s(x),y)),c(y))) if(false(),s(x),s(y)) -> s(y) if(true(),s(x),s(y)) -> s(x) - Signature: {f/1,g/2,if/3} / {0/0,1/0,c/1,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {f,g,if} and constructors {0,1,c,false,s,true} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs f#(0()) -> c_1() f#(1()) -> c_2() f#(s(x)) -> c_3(f#(x)) g#(x,c(y)) -> c_4(g#(x,y)) g#(x,c(y)) -> c_5(g#(x,if(f(x),c(g(s(x),y)),c(y))),if#(f(x),c(g(s(x),y)),c(y)),f#(x),g#(s(x),y)) if#(false(),s(x),s(y)) -> c_6() if#(true(),s(x),s(y)) -> c_7() Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: f#(0()) -> c_1() f#(1()) -> c_2() f#(s(x)) -> c_3(f#(x)) g#(x,c(y)) -> c_4(g#(x,y)) g#(x,c(y)) -> c_5(g#(x,if(f(x),c(g(s(x),y)),c(y))),if#(f(x),c(g(s(x),y)),c(y)),f#(x),g#(s(x),y)) if#(false(),s(x),s(y)) -> c_6() if#(true(),s(x),s(y)) -> c_7() - Weak TRS: f(0()) -> true() f(1()) -> false() f(s(x)) -> f(x) g(x,c(y)) -> c(g(x,y)) g(x,c(y)) -> g(x,if(f(x),c(g(s(x),y)),c(y))) if(false(),s(x),s(y)) -> s(y) if(true(),s(x),s(y)) -> s(x) - Signature: {f/1,g/2,if/3,f#/1,g#/2,if#/3} / {0/0,1/0,c/1,false/0,s/1,true/0,c_1/0,c_2/0,c_3/1,c_4/1,c_5/4,c_6/0,c_7/0} - Obligation: innermost runtime complexity wrt. defined symbols {f#,g#,if#} and constructors {0,1,c,false,s,true} popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807