Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308150
details
property
value
status
complete
benchmark
ExSec11_1_Luc02a_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.722 seconds
cpu usage
1093.34
user time
1080.15
system time
13.1937
max virtual memory
5.7080624E7
max residence set size
1.3713308E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^3), O(n^3))
output
1093.07/291.59 WORST_CASE(Omega(n^3), O(n^3)) 1093.07/291.61 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1093.07/291.61 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1093.07/291.61 1093.07/291.61 1093.07/291.61 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^3, n^3). 1093.07/291.61 1093.07/291.61 (0) CpxTRS 1093.07/291.61 (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] 1093.07/291.61 (2) CpxTRS 1093.07/291.61 (3) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] 1093.07/291.61 (4) CpxTRS 1093.07/291.61 (5) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 1093.07/291.61 (6) CpxWeightedTrs 1093.07/291.61 (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1093.07/291.61 (8) CpxTypedWeightedTrs 1093.07/291.61 (9) CompletionProof [UPPER BOUND(ID), 0 ms] 1093.07/291.61 (10) CpxTypedWeightedCompleteTrs 1093.07/291.61 (11) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 1093.07/291.61 (12) CpxTypedWeightedCompleteTrs 1093.07/291.61 (13) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 1093.07/291.61 (14) CpxRNTS 1093.07/291.61 (15) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] 1093.07/291.61 (16) CpxRNTS 1093.07/291.61 (17) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 1093.07/291.61 (18) CpxRNTS 1093.07/291.61 (19) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1093.07/291.61 (20) CpxRNTS 1093.07/291.61 (21) IntTrsBoundProof [UPPER BOUND(ID), 215 ms] 1093.07/291.61 (22) CpxRNTS 1093.07/291.61 (23) IntTrsBoundProof [UPPER BOUND(ID), 77 ms] 1093.07/291.61 (24) CpxRNTS 1093.07/291.61 (25) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1093.07/291.61 (26) CpxRNTS 1093.07/291.61 (27) IntTrsBoundProof [UPPER BOUND(ID), 252 ms] 1093.07/291.61 (28) CpxRNTS 1093.07/291.61 (29) IntTrsBoundProof [UPPER BOUND(ID), 55 ms] 1093.07/291.61 (30) CpxRNTS 1093.07/291.61 (31) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1093.07/291.61 (32) CpxRNTS 1093.07/291.61 (33) IntTrsBoundProof [UPPER BOUND(ID), 291 ms] 1093.07/291.61 (34) CpxRNTS 1093.07/291.61 (35) IntTrsBoundProof [UPPER BOUND(ID), 135 ms] 1093.07/291.61 (36) CpxRNTS 1093.07/291.61 (37) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1093.07/291.61 (38) CpxRNTS 1093.07/291.61 (39) IntTrsBoundProof [UPPER BOUND(ID), 271 ms] 1093.07/291.61 (40) CpxRNTS 1093.07/291.61 (41) IntTrsBoundProof [UPPER BOUND(ID), 83 ms] 1093.07/291.61 (42) CpxRNTS 1093.07/291.61 (43) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1093.07/291.61 (44) CpxRNTS 1093.07/291.61 (45) IntTrsBoundProof [UPPER BOUND(ID), 534 ms] 1093.07/291.61 (46) CpxRNTS 1093.07/291.61 (47) IntTrsBoundProof [UPPER BOUND(ID), 84 ms] 1093.07/291.61 (48) CpxRNTS 1093.07/291.61 (49) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1093.07/291.61 (50) CpxRNTS 1093.07/291.61 (51) IntTrsBoundProof [UPPER BOUND(ID), 588 ms] 1093.07/291.61 (52) CpxRNTS 1093.07/291.61 (53) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] 1093.07/291.61 (54) CpxRNTS 1093.07/291.61 (55) FinalProof [FINISHED, 0 ms] 1093.07/291.61 (56) BOUNDS(1, n^3) 1093.07/291.61 (57) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1093.07/291.61 (58) CpxTRS 1093.07/291.61 (59) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1093.07/291.61 (60) typed CpxTrs 1093.07/291.61 (61) OrderProof [LOWER BOUND(ID), 0 ms] 1093.07/291.61 (62) typed CpxTrs 1093.07/291.61 (63) RewriteLemmaProof [LOWER BOUND(ID), 288 ms] 1093.07/291.61 (64) BEST 1093.07/291.61 (65) proven lower bound 1093.07/291.61 (66) LowerBoundPropagationProof [FINISHED, 0 ms] 1093.07/291.61 (67) BOUNDS(n^1, INF) 1093.07/291.61 (68) typed CpxTrs 1093.07/291.61 (69) RewriteLemmaProof [LOWER BOUND(ID), 89 ms] 1093.07/291.61 (70) typed CpxTrs 1093.07/291.61 (71) RewriteLemmaProof [LOWER BOUND(ID), 93 ms] 1093.07/291.61 (72) BEST 1093.07/291.61 (73) proven lower bound 1093.07/291.61 (74) LowerBoundPropagationProof [FINISHED, 0 ms] 1093.07/291.61 (75) BOUNDS(n^3, INF) 1093.07/291.61 (76) typed CpxTrs 1093.07/291.61 (77) RewriteLemmaProof [LOWER BOUND(ID), 26 ms] 1093.07/291.61 (78) BOUNDS(1, INF) 1093.07/291.61 1093.07/291.61 1093.07/291.61 ---------------------------------------- 1093.07/291.61 1093.07/291.61 (0) 1093.07/291.61 Obligation: 1093.07/291.61 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^3, n^3). 1093.07/291.61 1093.07/291.61 1093.07/291.61 The TRS R consists of the following rules: 1093.07/291.61 1093.07/291.61 terms(N) -> cons(recip(sqr(N))) 1093.07/291.61 sqr(0) -> 0 1093.07/291.61 sqr(s(X)) -> s(add(sqr(X), dbl(X)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Full_Rewriting 2019-04-01 06.11