Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS pair #487111336
details
property
value
status
complete
benchmark
#3.53.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n141.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
15.34 seconds
cpu usage
45.4323
user time
43.2778
system time
2.15456
max virtual memory
1.9279148E7
max residence set size
4167860.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^3), O(n^3))
output
WORST_CASE(Omega(n^3), O(n^3)) 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^3, n^3). (0) CpxTRS (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxWeightedTrs (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxTypedWeightedTrs (7) CompletionProof [UPPER BOUND(ID), 0 ms] (8) CpxTypedWeightedCompleteTrs (9) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CpxTypedWeightedCompleteTrs (11) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (12) CpxRNTS (13) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxRNTS (15) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 4 ms] (16) CpxRNTS (17) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (18) CpxRNTS (19) IntTrsBoundProof [UPPER BOUND(ID), 286 ms] (20) CpxRNTS (21) IntTrsBoundProof [UPPER BOUND(ID), 85 ms] (22) CpxRNTS (23) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 381 ms] (26) CpxRNTS (27) IntTrsBoundProof [UPPER BOUND(ID), 83 ms] (28) CpxRNTS (29) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (30) CpxRNTS (31) IntTrsBoundProof [UPPER BOUND(ID), 300 ms] (32) CpxRNTS (33) IntTrsBoundProof [UPPER BOUND(ID), 95 ms] (34) CpxRNTS (35) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (36) CpxRNTS (37) IntTrsBoundProof [UPPER BOUND(ID), 392 ms] (38) CpxRNTS (39) IntTrsBoundProof [UPPER BOUND(ID), 227 ms] (40) CpxRNTS (41) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (42) CpxRNTS (43) IntTrsBoundProof [UPPER BOUND(ID), 725 ms] (44) CpxRNTS (45) IntTrsBoundProof [UPPER BOUND(ID), 389 ms] (46) CpxRNTS (47) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (48) CpxRNTS (49) IntTrsBoundProof [UPPER BOUND(ID), 330 ms] (50) CpxRNTS (51) IntTrsBoundProof [UPPER BOUND(ID), 93 ms] (52) CpxRNTS (53) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (54) CpxRNTS (55) IntTrsBoundProof [UPPER BOUND(ID), 359 ms] (56) CpxRNTS (57) IntTrsBoundProof [UPPER BOUND(ID), 3 ms] (58) CpxRNTS (59) FinalProof [FINISHED, 0 ms] (60) BOUNDS(1, n^3) (61) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (62) CpxTRS (63) SlicingProof [LOWER BOUND(ID), 0 ms] (64) CpxTRS (65) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (66) typed CpxTrs (67) OrderProof [LOWER BOUND(ID), 0 ms] (68) typed CpxTrs (69) RewriteLemmaProof [LOWER BOUND(ID), 243 ms] (70) BEST (71) proven lower bound (72) LowerBoundPropagationProof [FINISHED, 0 ms] (73) BOUNDS(n^1, INF) (74) typed CpxTrs (75) RewriteLemmaProof [LOWER BOUND(ID), 54 ms] (76) typed CpxTrs (77) RewriteLemmaProof [LOWER BOUND(ID), 27 ms] (78) BEST (79) proven lower bound (80) LowerBoundPropagationProof [FINISHED, 0 ms] (81) BOUNDS(n^2, INF) (82) typed CpxTrs (83) RewriteLemmaProof [LOWER BOUND(ID), 0 ms] (84) BEST (85) proven lower bound (86) LowerBoundPropagationProof [FINISHED, 0 ms] (87) BOUNDS(n^3, INF) (88) typed CpxTrs (89) RewriteLemmaProof [LOWER BOUND(ID), 63 ms] (90) typed CpxTrs (91) RewriteLemmaProof [LOWER BOUND(ID), 48 ms] (92) BOUNDS(1, INF)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS