details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.625 seconds
cpu usage	1131.13
user time	1120.18
system time	10.9567
max virtual memory	2.0192032E7
max residence set size	1.507854E7

stage attributes

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

output

WORST_CASE(Omega(n^1), ?) 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, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 248 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 0 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 294 ms] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 2034 ms] (18) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: eq(0, 0) -> true eq(0, s(x)) -> false eq(s(x), 0) -> false eq(s(x), s(y)) -> eq(x, y) or(true, y) -> true or(false, y) -> y union(empty, h) -> h union(edge(x, y, i), h) -> edge(x, y, union(i, h)) reach(x, y, empty, h) -> false reach(x, y, edge(u, v, i), h) -> if_reach_1(eq(x, u), x, y, edge(u, v, i), h) if_reach_1(true, x, y, edge(u, v, i), h) -> if_reach_2(eq(y, v), x, y, edge(u, v, i), h) if_reach_2(true, x, y, edge(u, v, i), h) -> true if_reach_2(false, x, y, edge(u, v, i), h) -> or(reach(x, y, i, h), reach(v, y, union(i, h), empty)) if_reach_1(false, x, y, edge(u, v, i), h) -> reach(x, y, i, edge(u, v, h)) 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(0) -> 0 encArg(true) -> true encArg(s(x_1)) -> s(encArg(x_1)) encArg(false) -> false encArg(empty) -> empty encArg(edge(x_1, x_2, x_3)) -> edge(encArg(x_1), encArg(x_2), encArg(x_3)) encArg(cons_eq(x_1, x_2)) -> eq(encArg(x_1), encArg(x_2)) encArg(cons_or(x_1, x_2)) -> or(encArg(x_1), encArg(x_2)) encArg(cons_union(x_1, x_2)) -> union(encArg(x_1), encArg(x_2)) encArg(cons_reach(x_1, x_2, x_3, x_4)) -> reach(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4)) encArg(cons_if_reach_1(x_1, x_2, x_3, x_4, x_5)) -> if_reach_1(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4), encArg(x_5)) encArg(cons_if_reach_2(x_1, x_2, x_3, x_4, x_5)) -> if_reach_2(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4), encArg(x_5)) encode_eq(x_1, x_2) -> eq(encArg(x_1), encArg(x_2)) encode_0 -> 0 encode_true -> true encode_s(x_1) -> s(encArg(x_1)) encode_false -> false encode_or(x_1, x_2) -> or(encArg(x_1), encArg(x_2)) encode_union(x_1, x_2) -> union(encArg(x_1), encArg(x_2)) encode_empty -> empty encode_edge(x_1, x_2, x_3) -> edge(encArg(x_1), encArg(x_2), encArg(x_3)) encode_reach(x_1, x_2, x_3, x_4) -> reach(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4)) encode_if_reach_1(x_1, x_2, x_3, x_4, x_5) -> if_reach_1(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4), encArg(x_5)) encode_if_reach_2(x_1, x_2, x_3, x_4, x_5) -> if_reach_2(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4), encArg(x_5)) ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: eq(0, 0) -> true eq(0, s(x)) -> false eq(s(x), 0) -> false eq(s(x), s(y)) -> eq(x, y) or(true, y) -> true or(false, y) -> y popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost