details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	295.561084986 seconds
cpu usage	1188.34246045
max memory	5.984813056E9

stage attributes

key	value
output-size	3873
starexec-result	WORST_CASE(Omega(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),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__add(X1,X2) -> add(X1,X2) a__add(0(),X) -> mark(X) a__add(s(X),Y) -> s(a__add(mark(X),mark(Y))) a__fact(X) -> a__if(a__zero(mark(X)),s(0()),prod(X,fact(p(X)))) a__fact(X) -> fact(X) a__if(X1,X2,X3) -> if(X1,X2,X3) a__if(false(),X,Y) -> mark(Y) a__if(true(),X,Y) -> mark(X) a__p(X) -> p(X) a__p(s(X)) -> mark(X) a__prod(X1,X2) -> prod(X1,X2) a__prod(0(),X) -> 0() a__prod(s(X),Y) -> a__add(mark(Y),a__prod(mark(X),mark(Y))) a__zero(X) -> zero(X) a__zero(0()) -> true() a__zero(s(X)) -> false() mark(0()) -> 0() mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(fact(X)) -> a__fact(mark(X)) mark(false()) -> false() mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3) mark(p(X)) -> a__p(mark(X)) mark(prod(X1,X2)) -> a__prod(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(true()) -> true() mark(zero(X)) -> a__zero(mark(X)) - Signature: {a__add/2,a__fact/1,a__if/3,a__p/1,a__prod/2,a__zero/1,mark/1} / {0/0,add/2,fact/1,false/0,if/3,p/1,prod/2 ,s/1,true/0,zero/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__add,a__fact,a__if,a__p,a__prod,a__zero ,mark} and constructors {0,add,fact,false,if,p,prod,s,true,zero} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__add(X1,X2) -> add(X1,X2) a__add(0(),X) -> mark(X) a__add(s(X),Y) -> s(a__add(mark(X),mark(Y))) a__fact(X) -> a__if(a__zero(mark(X)),s(0()),prod(X,fact(p(X)))) a__fact(X) -> fact(X) a__if(X1,X2,X3) -> if(X1,X2,X3) a__if(false(),X,Y) -> mark(Y) a__if(true(),X,Y) -> mark(X) a__p(X) -> p(X) a__p(s(X)) -> mark(X) a__prod(X1,X2) -> prod(X1,X2) a__prod(0(),X) -> 0() a__prod(s(X),Y) -> a__add(mark(Y),a__prod(mark(X),mark(Y))) a__zero(X) -> zero(X) a__zero(0()) -> true() a__zero(s(X)) -> false() mark(0()) -> 0() mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(fact(X)) -> a__fact(mark(X)) mark(false()) -> false() mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3) mark(p(X)) -> a__p(mark(X)) mark(prod(X1,X2)) -> a__prod(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(true()) -> true() mark(zero(X)) -> a__zero(mark(X)) - Signature: {a__add/2,a__fact/1,a__if/3,a__p/1,a__prod/2,a__zero/1,mark/1} / {0/0,add/2,fact/1,false/0,if/3,p/1,prod/2 ,s/1,true/0,zero/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__add,a__fact,a__if,a__p,a__prod,a__zero ,mark} and constructors {0,add,fact,false,if,p,prod,s,true,zero} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(x){x -> add(x,y)} = mark(add(x,y)) ->^+ a__add(mark(x),mark(y)) = C[mark(x) = mark(x){}] WORST_CASE(Omega(n^1),?) popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807