details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	0.60454416275 seconds
cpu usage	2.327062946
max memory	3.8117376E7

stage attributes

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