details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	0.229073047638 seconds
cpu usage	0.831821693
max memory	3.2022528E7

stage attributes

key	value
output-size	1834
starexec-result	WORST_CASE(?,O(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(?,O(n^1)) * Step 1: Sum WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(0()) -> s(0()) f(s(x)) -> s(s(g(x))) g(0()) -> 0() g(s(x)) -> f(x) - Signature: {f/1,g/1} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(0()) -> s(0()) f(s(x)) -> s(s(g(x))) g(0()) -> 0() g(s(x)) -> f(x) - Signature: {f/1,g/1} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,s} + Applied Processor: Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing} + Details: Signatures used: ---------------- 0 :: [] -(0)-> "A"(1) 0 :: [] -(0)-> "A"(0) f :: ["A"(1)] -(1)-> "A"(0) g :: ["A"(1)] -(1)-> "A"(0) s :: ["A"(1)] -(1)-> "A"(1) s :: ["A"(0)] -(0)-> "A"(0) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "0_A" :: [] -(0)-> "A"(0) "s_A" :: ["A"(0)] -(0)-> "A"(0) WORST_CASE(?,O(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