details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	12.6003 seconds
cpu usage	46.218
user time	44.3205
system time	1.89742
max virtual memory	3.8244332E7
max residence set size	3945424.0

stage attributes

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

output

WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 16 ms] (2) CpxTRS (3) RcToIrcProof [BOTH BOUNDS(ID, ID), 66 ms] (4) CpxTRS (5) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] (6) CdtProblem (7) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CdtProblem (9) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CdtProblem (11) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CdtProblem (13) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 317 ms] (14) CdtProblem (15) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 117 ms] (16) CdtProblem (17) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 79 ms] (18) CdtProblem (19) SIsEmptyProof [BOTH BOUNDS(ID, ID), 0 ms] (20) BOUNDS(1, 1) (21) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (22) CpxTRS (23) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (24) typed CpxTrs (25) OrderProof [LOWER BOUND(ID), 0 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 438 ms] (28) BEST (29) proven lower bound (30) LowerBoundPropagationProof [FINISHED, 0 ms] (31) BOUNDS(n^1, INF) (32) typed CpxTrs (33) RewriteLemmaProof [LOWER BOUND(ID), 144 ms] (34) typed CpxTrs (35) RewriteLemmaProof [LOWER BOUND(ID), 115 ms] (36) typed CpxTrs (37) RewriteLemmaProof [LOWER BOUND(ID), 223 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 234 ms] (40) typed CpxTrs (41) RewriteLemmaProof [LOWER BOUND(ID), 208 ms] (42) typed CpxTrs (43) RewriteLemmaProof [LOWER BOUND(ID), 179 ms] (44) typed CpxTrs (45) RewriteLemmaProof [LOWER BOUND(ID), 130 ms] (46) typed CpxTrs (47) RewriteLemmaProof [LOWER BOUND(ID), 194 ms] (48) typed CpxTrs (49) RewriteLemmaProof [LOWER BOUND(ID), 110 ms] (50) typed CpxTrs (51) RewriteLemmaProof [LOWER BOUND(ID), 274 ms] (52) typed CpxTrs (53) RewriteLemmaProof [LOWER BOUND(ID), 272 ms] (54) typed CpxTrs (55) RewriteLemmaProof [LOWER BOUND(ID), 247 ms] (56) typed CpxTrs (57) RewriteLemmaProof [LOWER BOUND(ID), 183 ms] (58) typed CpxTrs (59) RewriteLemmaProof [LOWER BOUND(ID), 97 ms] (60) typed CpxTrs (61) RewriteLemmaProof [LOWER BOUND(ID), 164 ms] (62) typed CpxTrs (63) RewriteLemmaProof [LOWER BOUND(ID), 241 ms] (64) typed CpxTrs (65) RewriteLemmaProof [LOWER BOUND(ID), 242 ms] (66) typed CpxTrs (67) RewriteLemmaProof [LOWER BOUND(ID), 208 ms] (68) typed CpxTrs (69) RewriteLemmaProof [LOWER BOUND(ID), 142 ms] (70) typed CpxTrs (71) RewriteLemmaProof [LOWER BOUND(ID), 179 ms] (72) typed CpxTrs (73) RewriteLemmaProof [LOWER BOUND(ID), 69 ms] (74) typed CpxTrs (75) RewriteLemmaProof [LOWER BOUND(ID), 157 ms] (76) typed CpxTrs (77) RewriteLemmaProof [LOWER BOUND(ID), 109 ms] (78) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS