details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.601 seconds
cpu usage	1129.02
user time	1116.14
system time	12.882
max virtual memory	3.8324896E7
max residence set size	1.5217208E7

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/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (innermost) 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), 252 ms] (4) CpxRelTRS (5) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxWeightedTrs (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CpxTypedWeightedTrs (9) CompletionProof [UPPER BOUND(ID), 0 ms] (10) CpxTypedWeightedCompleteTrs (11) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (12) CpxRNTS (13) CompleteCoflocoProof [FINISHED, 25.6 s] (14) BOUNDS(1, n^3) (15) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CpxRelTRS (17) TypeInferenceProof [BOTH BOUNDS(ID, ID), 8 ms] (18) typed CpxTrs (19) OrderProof [LOWER BOUND(ID), 0 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 535 ms] (22) BEST (23) proven lower bound (24) LowerBoundPropagationProof [FINISHED, 0 ms] (25) BOUNDS(n^1, INF) (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 175 ms] (28) typed CpxTrs (29) RewriteLemmaProof [LOWER BOUND(ID), 276 ms] (30) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, n^3). The TRS R consists of the following rules: cond1(s(x), y) -> cond2(gr(s(x), y), s(x), y) cond2(true, x, y) -> cond1(y, y) cond2(false, x, y) -> cond1(p(x), y) gr(0, x) -> false gr(s(x), 0) -> true gr(s(x), s(y)) -> gr(x, y) neq(0, 0) -> false neq(0, s(x)) -> true neq(s(x), 0) -> true neq(s(x), s(y)) -> neq(x, y) p(0) -> 0 p(s(x)) -> x S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (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(s(x_1)) -> s(encArg(x_1)) encArg(true) -> true encArg(false) -> false encArg(0) -> 0 encArg(cons_cond1(x_1, x_2)) -> cond1(encArg(x_1), encArg(x_2)) encArg(cons_cond2(x_1, x_2, x_3)) -> cond2(encArg(x_1), encArg(x_2), encArg(x_3)) encArg(cons_gr(x_1, x_2)) -> gr(encArg(x_1), encArg(x_2)) encArg(cons_neq(x_1, x_2)) -> neq(encArg(x_1), encArg(x_2)) encArg(cons_p(x_1)) -> p(encArg(x_1)) encode_cond1(x_1, x_2) -> cond1(encArg(x_1), encArg(x_2)) encode_s(x_1) -> s(encArg(x_1)) encode_cond2(x_1, x_2, x_3) -> cond2(encArg(x_1), encArg(x_2), encArg(x_3)) encode_gr(x_1, x_2) -> gr(encArg(x_1), encArg(x_2)) encode_true -> true encode_false -> false encode_p(x_1) -> p(encArg(x_1)) encode_0 -> 0 encode_neq(x_1, x_2) -> neq(encArg(x_1), encArg(x_2)) ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, n^3). The TRS R consists of the following rules: cond1(s(x), y) -> cond2(gr(s(x), y), s(x), y) cond2(true, x, y) -> cond1(y, y) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost