Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS pair #487110418
details
property
value
status
complete
benchmark
LISTUTILITIES_complete_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n143.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
16.2277 seconds
cpu usage
59.8516
user time
57.6627
system time
2.18885
max virtual memory
7.4580344E7
max residence set size
4014704.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/sandbox2/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), 42 ms] (2) CpxTRS (3) RcToIrcProof [BOTH BOUNDS(ID, ID), 50 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)), 346 ms] (14) CdtProblem (15) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 94 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), 4 ms] (22) typed CpxTrs (23) OrderProof [LOWER BOUND(ID), 0 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 498 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), 147 ms] (32) typed CpxTrs (33) RewriteLemmaProof [LOWER BOUND(ID), 144 ms] (34) typed CpxTrs (35) RewriteLemmaProof [LOWER BOUND(ID), 190 ms] (36) typed CpxTrs (37) RewriteLemmaProof [LOWER BOUND(ID), 99 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 99 ms] (40) typed CpxTrs (41) RewriteLemmaProof [LOWER BOUND(ID), 134 ms] (42) typed CpxTrs (43) RewriteLemmaProof [LOWER BOUND(ID), 146 ms] (44) typed CpxTrs (45) RewriteLemmaProof [LOWER BOUND(ID), 159 ms] (46) typed CpxTrs (47) RewriteLemmaProof [LOWER BOUND(ID), 146 ms] (48) typed CpxTrs (49) RewriteLemmaProof [LOWER BOUND(ID), 234 ms] (50) typed CpxTrs (51) RewriteLemmaProof [LOWER BOUND(ID), 98 ms] (52) typed CpxTrs (53) RewriteLemmaProof [LOWER BOUND(ID), 174 ms] (54) typed CpxTrs (55) RewriteLemmaProof [LOWER BOUND(ID), 108 ms] (56) typed CpxTrs (57) RewriteLemmaProof [LOWER BOUND(ID), 130 ms] (58) typed CpxTrs (59) RewriteLemmaProof [LOWER BOUND(ID), 94 ms] (60) typed CpxTrs (61) RewriteLemmaProof [LOWER BOUND(ID), 220 ms] (62) typed CpxTrs (63) RewriteLemmaProof [LOWER BOUND(ID), 229 ms] (64) typed CpxTrs (65) RewriteLemmaProof [LOWER BOUND(ID), 210 ms] (66) typed CpxTrs (67) RewriteLemmaProof [LOWER BOUND(ID), 143 ms] (68) typed CpxTrs (69) RewriteLemmaProof [LOWER BOUND(ID), 215 ms] (70) typed CpxTrs (71) RewriteLemmaProof [LOWER BOUND(ID), 142 ms] (72) typed CpxTrs (73) RewriteLemmaProof [LOWER BOUND(ID), 187 ms] (74) typed CpxTrs (75) RewriteLemmaProof [LOWER BOUND(ID), 136 ms] (76) typed CpxTrs (77) RewriteLemmaProof [LOWER BOUND(ID), 137 ms] (78) typed CpxTrs (79) RewriteLemmaProof [LOWER BOUND(ID), 155 ms] (80) typed CpxTrs (81) RewriteLemmaProof [LOWER BOUND(ID), 152 ms] (82) typed CpxTrs (83) RewriteLemmaProof [LOWER BOUND(ID), 129 ms] (84) typed CpxTrs (85) RewriteLemmaProof [LOWER BOUND(ID), 288 ms] (86) typed CpxTrs (87) RewriteLemmaProof [LOWER BOUND(ID), 144 ms] (88) typed CpxTrs (89) RewriteLemmaProof [LOWER BOUND(ID), 156 ms] (90) typed CpxTrs (91) RewriteLemmaProof [LOWER BOUND(ID), 175 ms] (92) typed CpxTrs
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS