details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.593 seconds
cpu usage	332.845
user time	330.107
system time	2.73859
max virtual memory	3.7378148E7
max residence set size	5657668.0

stage attributes

key	value
starexec-result	WORST_CASE(Omega(n^1), O(n^3))

output

WORST_CASE(Omega(n^1), O(n^3)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, n^3). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 66 ms] (4) CpxRelTRS (5) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] (8) CdtProblem (9) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] (10) CdtProblem (11) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CdtProblem (13) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] (14) CdtProblem (15) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CdtProblem (17) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 80 ms] (18) CdtProblem (19) CdtRuleRemovalProof [UPPER BOUND(ADD(n^3)), 101 ms] (20) CdtProblem (21) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 45 ms] (22) CdtProblem (23) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (24) CdtProblem (25) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (26) CdtProblem (27) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (28) CdtProblem (29) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 85 ms] (30) CdtProblem (31) SIsEmptyProof [BOTH BOUNDS(ID, ID), 0 ms] (32) BOUNDS(1, 1) (33) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (34) CpxRelTRS (35) TypeInferenceProof [BOTH BOUNDS(ID, ID), 5 ms] (36) typed CpxTrs (37) OrderProof [LOWER BOUND(ID), 0 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 1039 ms] (40) BEST (41) proven lower bound (42) LowerBoundPropagationProof [FINISHED, 0 ms] (43) BOUNDS(n^1, INF) (44) typed CpxTrs (45) RewriteLemmaProof [LOWER BOUND(ID), 40 ms] (46) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, n^3). The TRS R consists of the following rules: a__f(f(a)) -> a__f(g(f(a))) mark(f(X)) -> a__f(mark(X)) mark(a) -> a mark(g(X)) -> g(X) a__f(X) -> f(X) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID)) The following rules have been added to S to convert the given derivational complexity problem to a runtime complexity problem: encArg(f(x_1)) -> f(encArg(x_1)) encArg(a) -> a encArg(g(x_1)) -> g(encArg(x_1)) encArg(cons_a__f(x_1)) -> a__f(encArg(x_1)) encArg(cons_mark(x_1)) -> mark(encArg(x_1)) encode_a__f(x_1) -> a__f(encArg(x_1)) encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_g(x_1) -> g(encArg(x_1)) encode_mark(x_1) -> mark(encArg(x_1)) ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(n^1, n^3). The TRS R consists of the following rules: a__f(f(a)) -> a__f(g(f(a))) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS