Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313827
details
property
value
status
complete
benchmark
mergesort.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n090.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
292.485 seconds
cpu usage
927.718
user time
913.8
system time
13.9183
max virtual memory
5.6806396E7
max residence set size
1.2417024E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
927.52/292.39 WORST_CASE(Omega(n^1), O(n^2)) 927.57/292.41 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 927.57/292.41 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 927.57/292.41 927.57/292.41 927.57/292.41 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, n^2). 927.57/292.41 927.57/292.41 (0) CpxRelTRS 927.57/292.41 (1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 178 ms] 927.57/292.41 (2) CpxRelTRS 927.57/292.41 (3) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] 927.57/292.41 (4) CdtProblem 927.57/292.41 (5) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] 927.57/292.41 (6) CdtProblem 927.57/292.41 (7) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (8) CdtProblem 927.57/292.41 (9) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 555 ms] 927.57/292.41 (10) CdtProblem 927.57/292.41 (11) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 299 ms] 927.57/292.41 (12) CdtProblem 927.57/292.41 (13) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 272 ms] 927.57/292.41 (14) CdtProblem 927.57/292.41 (15) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (16) CdtProblem 927.57/292.41 (17) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (18) CdtProblem 927.57/292.41 (19) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (20) CdtProblem 927.57/292.41 (21) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 623 ms] 927.57/292.41 (22) CdtProblem 927.57/292.41 (23) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 756 ms] 927.57/292.41 (24) CdtProblem 927.57/292.41 (25) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (26) CdtProblem 927.57/292.41 (27) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (28) CdtProblem 927.57/292.41 (29) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] 927.57/292.41 (30) CdtProblem 927.57/292.41 (31) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (32) CdtProblem 927.57/292.41 (33) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 1710 ms] 927.57/292.41 (34) CdtProblem 927.57/292.41 (35) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 2376 ms] 927.57/292.41 (36) CdtProblem 927.57/292.41 (37) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 3135 ms] 927.57/292.41 (38) CdtProblem 927.57/292.41 (39) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (40) CdtProblem 927.57/292.41 (41) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (42) CdtProblem 927.57/292.41 (43) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] 927.57/292.41 (44) CdtProblem 927.57/292.41 (45) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (46) CdtProblem 927.57/292.41 (47) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (48) CdtProblem 927.57/292.41 (49) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (50) CdtProblem 927.57/292.41 (51) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (52) CdtProblem 927.57/292.41 (53) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (54) CdtProblem 927.57/292.41 (55) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (56) CdtProblem 927.57/292.41 (57) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (58) CdtProblem 927.57/292.41 (59) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (60) CdtProblem 927.57/292.41 (61) CdtInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (62) CdtProblem 927.57/292.41 (63) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (64) CdtProblem 927.57/292.41 (65) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (66) CdtProblem 927.57/292.41 (67) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (68) CdtProblem 927.57/292.41 (69) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (70) CdtProblem 927.57/292.41 (71) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (72) CdtProblem 927.57/292.41 (73) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (74) CdtProblem 927.57/292.41 (75) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (76) CdtProblem 927.57/292.41 (77) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (78) CdtProblem 927.57/292.41 (79) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (80) CdtProblem 927.57/292.41 (81) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (82) CdtProblem 927.57/292.41 (83) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (84) CdtProblem 927.57/292.41 (85) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (86) CdtProblem 927.57/292.41 (87) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (88) CdtProblem 927.57/292.41 (89) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (90) CdtProblem 927.57/292.41 (91) CdtInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] 927.57/292.41 (92) CdtProblem
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40