details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	217.492043018 seconds
cpu usage	847.644471983
max memory	2.266099712E9

stage attributes

key	value
output-size	1536
starexec-result	WORST_CASE(Omega(n^1),?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /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: badd(x,Nil()) -> x badd(x',Cons(x,xs)) -> badd(Cons(Nil(),Nil()),badd(x',xs)) goal(x,y) -> badd(x,y) - Signature: {badd/2,goal/2} / {Cons/2,Nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {badd,goal} and constructors {Cons,Nil} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: badd(x,Nil()) -> x badd(x',Cons(x,xs)) -> badd(Cons(Nil(),Nil()),badd(x',xs)) goal(x,y) -> badd(x,y) - Signature: {badd/2,goal/2} / {Cons/2,Nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {badd,goal} and constructors {Cons,Nil} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: badd(x,z){z -> Cons(y,z)} = badd(x,Cons(y,z)) ->^+ badd(Cons(Nil(),Nil()),badd(x,z)) = C[badd(x,z) = badd(x,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 Inner Rewri 22807