details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	26.1988871098 seconds
cpu usage	99.144551279
max memory	5.485469696E9

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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), 107 ms] (2) CpxTRS (3) RcToIrcProof [BOTH BOUNDS(ID, ID), 468 ms] (4) CpxTRS (5) CpxTrsToCdtProof [UPPER BOUND(ID), 33 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), 10 ms] (12) CdtProblem (13) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 747 ms] (14) CdtProblem (15) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 326 ms] (16) CdtProblem (17) SIsEmptyProof [BOTH BOUNDS(ID, ID), 0 ms] (18) BOUNDS(1, 1) (19) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (20) CpxTRS (21) TypeInferenceProof [BOTH BOUNDS(ID, ID), 29 ms] (22) typed CpxTrs (23) OrderProof [LOWER BOUND(ID), 0 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 800 ms] (26) BEST (27) proven lower bound (28) LowerBoundPropagationProof [FINISHED, 0 ms] (29) BOUNDS(n^1, INF) (30) typed CpxTrs (31) RewriteLemmaProof [LOWER BOUND(ID), 420 ms] (32) typed CpxTrs (33) RewriteLemmaProof [LOWER BOUND(ID), 363 ms] (34) typed CpxTrs (35) RewriteLemmaProof [LOWER BOUND(ID), 302 ms] (36) typed CpxTrs (37) RewriteLemmaProof [LOWER BOUND(ID), 194 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 344 ms] (40) typed CpxTrs (41) RewriteLemmaProof [LOWER BOUND(ID), 208 ms] (42) typed CpxTrs (43) RewriteLemmaProof [LOWER BOUND(ID), 324 ms] (44) typed CpxTrs (45) RewriteLemmaProof [LOWER BOUND(ID), 183 ms] (46) typed CpxTrs (47) RewriteLemmaProof [LOWER BOUND(ID), 360 ms] (48) typed CpxTrs (49) RewriteLemmaProof [LOWER BOUND(ID), 157 ms] (50) typed CpxTrs (51) RewriteLemmaProof [LOWER BOUND(ID), 253 ms] (52) typed CpxTrs (53) RewriteLemmaProof [LOWER BOUND(ID), 173 ms] (54) typed CpxTrs (55) RewriteLemmaProof [LOWER BOUND(ID), 265 ms] (56) typed CpxTrs (57) RewriteLemmaProof [LOWER BOUND(ID), 144 ms] (58) typed CpxTrs (59) RewriteLemmaProof [LOWER BOUND(ID), 255 ms] (60) typed CpxTrs (61) RewriteLemmaProof [LOWER BOUND(ID), 100 ms] (62) typed CpxTrs (63) RewriteLemmaProof [LOWER BOUND(ID), 323 ms] (64) typed CpxTrs (65) RewriteLemmaProof [LOWER BOUND(ID), 356 ms] (66) typed CpxTrs (67) RewriteLemmaProof [LOWER BOUND(ID), 299 ms] (68) typed CpxTrs (69) RewriteLemmaProof [LOWER BOUND(ID), 223 ms] (70) typed CpxTrs (71) RewriteLemmaProof [LOWER BOUND(ID), 117 ms] (72) typed CpxTrs (73) RewriteLemmaProof [LOWER BOUND(ID), 362 ms] (74) typed CpxTrs (75) RewriteLemmaProof [LOWER BOUND(ID), 438 ms] (76) typed CpxTrs (77) RewriteLemmaProof [LOWER BOUND(ID), 280 ms] (78) typed CpxTrs (79) RewriteLemmaProof [LOWER BOUND(ID), 198 ms] (80) typed CpxTrs (81) RewriteLemmaProof [LOWER BOUND(ID), 409 ms] (82) typed CpxTrs (83) RewriteLemmaProof [LOWER BOUND(ID), 417 ms] (84) typed CpxTrs (85) RewriteLemmaProof [LOWER BOUND(ID), 436 ms] (86) typed CpxTrs popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127