details

property	value
status	timeout (wallclock)
benchmark	Ex3_12_Luc96a_GM.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	Transformed_CSR_04

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.108047009 seconds
cpu usage	562.607115537
max memory	1.6576114688E10

stage attributes

unavailable

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),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__sel(X1,X2) -> sel(X1,X2) a__sel(0(),cons(X,Y)) -> mark(X) a__sel(s(X),cons(Y,Z)) -> a__sel(mark(X),mark(Z)) mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(s(X)) -> s(mark(X)) mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2)) - Signature: {a__from/1,a__sel/2,mark/1} / {0/0,cons/2,from/1,s/1,sel/2} - Obligation: runtime complexity wrt. defined symbols {a__from,a__sel,mark} and constructors {0,cons,from,s,sel} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__sel(X1,X2) -> sel(X1,X2) a__sel(0(),cons(X,Y)) -> mark(X) a__sel(s(X),cons(Y,Z)) -> a__sel(mark(X),mark(Z)) mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(s(X)) -> s(mark(X)) mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2)) - Signature: {a__from/1,a__sel/2,mark/1} / {0/0,cons/2,from/1,s/1,sel/2} - Obligation: runtime complexity wrt. defined symbols {a__from,a__sel,mark} and constructors {0,cons,from,s,sel} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(x){x -> cons(x,y)} = mark(cons(x,y)) ->^+ cons(mark(x),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 Full Rewri 10127