details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.139397144 seconds
cpu usage	547.528284505
max memory	1.9245129728E10

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: circ(s,id()) -> s circ(circ(s,t),u) -> circ(s,circ(t,u)) circ(cons(a,s),t) -> cons(msubst(a,t),circ(s,t)) circ(cons(lift(),s),circ(cons(lift(),t),u)) -> circ(cons(lift(),circ(s,t)),u) circ(cons(lift(),s),cons(a,t)) -> cons(a,circ(s,t)) circ(cons(lift(),s),cons(lift(),t)) -> cons(lift(),circ(s,t)) circ(id(),s) -> s msubst(a,id()) -> a msubst(msubst(a,s),t) -> msubst(a,circ(s,t)) subst(a,id()) -> a - Signature: {circ/2,msubst/2,subst/2} / {cons/2,id/0,lift/0} - Obligation: runtime complexity wrt. defined symbols {circ,msubst,subst} and constructors {cons,id,lift} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: circ(s,id()) -> s circ(circ(s,t),u) -> circ(s,circ(t,u)) circ(cons(a,s),t) -> cons(msubst(a,t),circ(s,t)) circ(cons(lift(),s),circ(cons(lift(),t),u)) -> circ(cons(lift(),circ(s,t)),u) circ(cons(lift(),s),cons(a,t)) -> cons(a,circ(s,t)) circ(cons(lift(),s),cons(lift(),t)) -> cons(lift(),circ(s,t)) circ(id(),s) -> s msubst(a,id()) -> a msubst(msubst(a,s),t) -> msubst(a,circ(s,t)) subst(a,id()) -> a - Signature: {circ/2,msubst/2,subst/2} / {cons/2,id/0,lift/0} - Obligation: runtime complexity wrt. defined symbols {circ,msubst,subst} and constructors {cons,id,lift} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: circ(y,z){y -> cons(x,y)} = circ(cons(x,y),z) ->^+ cons(msubst(x,z),circ(y,z)) = C[circ(y,z) = circ(y,z){}] 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