details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	291.278738976 seconds
cpu usage	1128.93367476
max memory	5.3927936E8

stage attributes

key	value
output-size	53316
starexec-result	WORST_CASE(?,O(n^7))

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^7)) * Step 1: DecomposeCP WORST_CASE(?,O(n^7)) + Considered Problem: - Strict TRS: +(+(x,y),z) -> +(x,+(y,z)) +(p1(),+(p1(),x)) -> +(p2(),x) +(p1(),+(p2(),+(p2(),x))) -> +(p5(),x) +(p1(),+(p2(),p2())) -> p5() +(p1(),p1()) -> p2() +(p10(),+(p1(),x)) -> +(p1(),+(p10(),x)) +(p10(),+(p2(),x)) -> +(p2(),+(p10(),x)) +(p10(),+(p5(),x)) -> +(p5(),+(p10(),x)) +(p10(),p1()) -> +(p1(),p10()) +(p10(),p2()) -> +(p2(),p10()) +(p10(),p5()) -> +(p5(),p10()) +(p2(),+(p1(),x)) -> +(p1(),+(p2(),x)) +(p2(),+(p2(),+(p2(),x))) -> +(p1(),+(p5(),x)) +(p2(),+(p2(),p2())) -> +(p1(),p5()) +(p2(),p1()) -> +(p1(),p2()) +(p5(),+(p1(),x)) -> +(p1(),+(p5(),x)) +(p5(),+(p2(),x)) -> +(p2(),+(p5(),x)) +(p5(),+(p5(),x)) -> +(p10(),x) +(p5(),p1()) -> +(p1(),p5()) +(p5(),p2()) -> +(p2(),p5()) +(p5(),p5()) -> p10() - Signature: {+/2} / {p1/0,p10/0,p2/0,p5/0} - Obligation: derivational complexity wrt. signature {+,p1,p10,p2,p5} + Applied Processor: DecomposeCP {onSelectionCP_ = any strict-rules, withBoundCP_ = RelativeMul, withCP_ = NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Nothing} to orient following rules strictly: +(p1(),+(p2(),+(p2(),x))) -> +(p5(),x) +(p1(),+(p2(),p2())) -> p5() +(p2(),+(p2(),+(p2(),x))) -> +(p1(),+(p5(),x)) +(p2(),+(p2(),p2())) -> +(p1(),p5()) The Processor induces the complexity certificate TIME (?,O(n^1)) SPACE(?,?) Observe that Problem (R) is non-size-increasing. Once the complexity of (R) has been assessed, it suffices to consider only rules whose complexity has not been estimated in (R) resulting in the following Problem (S). Overall the certificate is obtained by multiplication. Problem (S) - Strict TRS: +(+(x,y),z) -> +(x,+(y,z)) +(p1(),+(p1(),x)) -> +(p2(),x) +(p1(),p1()) -> p2() +(p10(),+(p1(),x)) -> +(p1(),+(p10(),x)) +(p10(),+(p2(),x)) -> +(p2(),+(p10(),x)) +(p10(),+(p5(),x)) -> +(p5(),+(p10(),x)) +(p10(),p1()) -> +(p1(),p10()) +(p10(),p2()) -> +(p2(),p10()) +(p10(),p5()) -> +(p5(),p10()) +(p2(),+(p1(),x)) -> +(p1(),+(p2(),x)) +(p2(),p1()) -> +(p1(),p2()) +(p5(),+(p1(),x)) -> +(p1(),+(p5(),x)) +(p5(),+(p2(),x)) -> +(p2(),+(p5(),x)) +(p5(),+(p5(),x)) -> +(p10(),x) +(p5(),p1()) -> +(p1(),p5()) +(p5(),p2()) -> +(p2(),p5()) +(p5(),p5()) -> p10() - Signature: {+/2} / {p1/0,p10/0,p2/0,p5/0} - Obligation: derivational complexity wrt. signature {+,p1,p10,p2,p5} ** Step 1.a:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: +(+(x,y),z) -> +(x,+(y,z)) +(p1(),+(p1(),x)) -> +(p2(),x) +(p1(),+(p2(),+(p2(),x))) -> +(p5(),x) +(p1(),+(p2(),p2())) -> p5() +(p1(),p1()) -> p2() +(p10(),+(p1(),x)) -> +(p1(),+(p10(),x)) +(p10(),+(p2(),x)) -> +(p2(),+(p10(),x)) +(p10(),+(p5(),x)) -> +(p5(),+(p10(),x)) +(p10(),p1()) -> +(p1(),p10()) +(p10(),p2()) -> +(p2(),p10()) +(p10(),p5()) -> +(p5(),p10()) +(p2(),+(p1(),x)) -> +(p1(),+(p2(),x)) +(p2(),+(p2(),+(p2(),x))) -> +(p1(),+(p5(),x)) +(p2(),+(p2(),p2())) -> +(p1(),p5()) +(p2(),p1()) -> +(p1(),p2()) +(p5(),+(p1(),x)) -> +(p1(),+(p5(),x)) +(p5(),+(p2(),x)) -> +(p2(),+(p5(),x)) +(p5(),+(p5(),x)) -> +(p10(),x) +(p5(),p1()) -> +(p1(),p5()) +(p5(),p2()) -> +(p2(),p5()) +(p5(),p5()) -> p10() - Signature: {+/2} / {p1/0,p10/0,p2/0,p5/0} - Obligation: popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Deriv Compl Full Rewri 33144