details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	295.281735897 seconds
cpu usage	1193.42269006
max memory	7.49467648E9

stage attributes

key	value
output-size	3759
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__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U11(tt(),M,N) -> a__U12(tt(),M,N) a__U12(X1,X2,X3) -> U12(X1,X2,X3) a__U12(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__U21(tt(),M,N) -> a__U22(tt(),M,N) a__U22(X1,X2,X3) -> U22(X1,X2,X3) a__U22(tt(),M,N) -> a__plus(a__x(mark(N),mark(M)),mark(N)) a__plus(N,0()) -> mark(N) a__plus(N,s(M)) -> a__U11(tt(),M,N) a__plus(X1,X2) -> plus(X1,X2) a__x(N,0()) -> 0() a__x(N,s(M)) -> a__U21(tt(),M,N) a__x(X1,X2) -> x(X1,X2) mark(0()) -> 0() mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2,X3)) -> a__U12(mark(X1),X2,X3) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(U22(X1,X2,X3)) -> a__U22(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt()) -> tt() mark(x(X1,X2)) -> a__x(mark(X1),mark(X2)) - Signature: {a__U11/3,a__U12/3,a__U21/3,a__U22/3,a__plus/2,a__x/2,mark/1} / {0/0,U11/3,U12/3,U21/3,U22/3,plus/2,s/1,tt/0 ,x/2} - Obligation: innermost runtime complexity wrt. defined symbols {a__U11,a__U12,a__U21,a__U22,a__plus,a__x ,mark} and constructors {0,U11,U12,U21,U22,plus,s,tt,x} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U11(tt(),M,N) -> a__U12(tt(),M,N) a__U12(X1,X2,X3) -> U12(X1,X2,X3) a__U12(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__U21(tt(),M,N) -> a__U22(tt(),M,N) a__U22(X1,X2,X3) -> U22(X1,X2,X3) a__U22(tt(),M,N) -> a__plus(a__x(mark(N),mark(M)),mark(N)) a__plus(N,0()) -> mark(N) a__plus(N,s(M)) -> a__U11(tt(),M,N) a__plus(X1,X2) -> plus(X1,X2) a__x(N,0()) -> 0() a__x(N,s(M)) -> a__U21(tt(),M,N) a__x(X1,X2) -> x(X1,X2) mark(0()) -> 0() mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2,X3)) -> a__U12(mark(X1),X2,X3) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(U22(X1,X2,X3)) -> a__U22(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt()) -> tt() mark(x(X1,X2)) -> a__x(mark(X1),mark(X2)) - Signature: {a__U11/3,a__U12/3,a__U21/3,a__U22/3,a__plus/2,a__x/2,mark/1} / {0/0,U11/3,U12/3,U21/3,U22/3,plus/2,s/1,tt/0 ,x/2} - Obligation: innermost runtime complexity wrt. defined symbols {a__U11,a__U12,a__U21,a__U22,a__plus,a__x ,mark} and constructors {0,U11,U12,U21,U22,plus,s,tt,x} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(x){x -> U11(x,y,z)} = mark(U11(x,y,z)) ->^+ a__U11(mark(x),y,z) = 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