details

property	value
status	complete
benchmark	PEANO_nosorts_GM.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	Transformed_CSR_04

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.766 seconds
cpu usage	1127.72
user time	1115.73
system time	11.996
max virtual memory	3.7114724E7
max residence set size	1.495458E7

stage attributes

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

output

WORST_CASE(Omega(n^2), ?) proof of /export/starexec/sandbox/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^2, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 236 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 3 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 0 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 292 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), 794 ms] (18) BEST (19) proven lower bound (20) LowerBoundPropagationProof [FINISHED, 0 ms] (21) BOUNDS(n^2, INF) (22) typed CpxTrs (23) RewriteLemmaProof [LOWER BOUND(ID), 44 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 109 ms] (26) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: a__and(tt, X) -> mark(X) a__plus(N, 0) -> mark(N) a__plus(N, s(M)) -> s(a__plus(mark(N), mark(M))) mark(and(X1, X2)) -> a__and(mark(X1), X2) mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2)) mark(tt) -> tt mark(0) -> 0 mark(s(X)) -> s(mark(X)) a__and(X1, X2) -> and(X1, X2) a__plus(X1, X2) -> plus(X1, X2) 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(tt) -> tt encArg(0) -> 0 encArg(s(x_1)) -> s(encArg(x_1)) encArg(and(x_1, x_2)) -> and(encArg(x_1), encArg(x_2)) encArg(plus(x_1, x_2)) -> plus(encArg(x_1), encArg(x_2)) encArg(cons_a__and(x_1, x_2)) -> a__and(encArg(x_1), encArg(x_2)) encArg(cons_a__plus(x_1, x_2)) -> a__plus(encArg(x_1), encArg(x_2)) encArg(cons_mark(x_1)) -> mark(encArg(x_1)) encode_a__and(x_1, x_2) -> a__and(encArg(x_1), encArg(x_2)) encode_tt -> tt encode_mark(x_1) -> mark(encArg(x_1)) encode_a__plus(x_1, x_2) -> a__plus(encArg(x_1), encArg(x_2)) encode_0 -> 0 encode_s(x_1) -> s(encArg(x_1)) encode_and(x_1, x_2) -> and(encArg(x_1), encArg(x_2)) encode_plus(x_1, x_2) -> plus(encArg(x_1), encArg(x_2)) ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: a__and(tt, X) -> mark(X) a__plus(N, 0) -> mark(N) a__plus(N, s(M)) -> s(a__plus(mark(N), mark(M))) mark(and(X1, X2)) -> a__and(mark(X1), X2) mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2)) mark(tt) -> tt mark(0) -> 0 mark(s(X)) -> s(mark(X)) a__and(X1, X2) -> and(X1, X2) a__plus(X1, X2) -> plus(X1, X2) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost