Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307671
details
property
value
status
complete
benchmark
IJCAR_18.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.731 seconds
cpu usage
1112.84
user time
1099.66
system time
13.1724
max virtual memory
5.7202012E7
max residence set size
1.5014604E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), O(n^3))
output
1112.15/291.56 WORST_CASE(Omega(n^2), O(n^3)) 1112.41/291.61 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1112.41/291.61 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1112.41/291.61 1112.41/291.61 1112.41/291.61 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, n^3). 1112.41/291.61 1112.41/291.61 (0) CpxTRS 1112.41/291.61 (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 7 ms] 1112.41/291.61 (2) CpxTRS 1112.41/291.61 (3) RcToIrcProof [BOTH BOUNDS(ID, ID), 10 ms] 1112.41/291.61 (4) CpxTRS 1112.41/291.61 (5) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 1112.41/291.61 (6) CpxWeightedTrs 1112.41/291.61 (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1112.41/291.61 (8) CpxTypedWeightedTrs 1112.41/291.61 (9) CompletionProof [UPPER BOUND(ID), 0 ms] 1112.41/291.61 (10) CpxTypedWeightedCompleteTrs 1112.41/291.61 (11) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 1112.41/291.61 (12) CpxTypedWeightedCompleteTrs 1112.41/291.61 (13) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 1112.41/291.61 (14) CpxRNTS 1112.41/291.61 (15) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] 1112.41/291.61 (16) CpxRNTS 1112.41/291.61 (17) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 1112.41/291.61 (18) CpxRNTS 1112.41/291.61 (19) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1112.41/291.61 (20) CpxRNTS 1112.41/291.61 (21) IntTrsBoundProof [UPPER BOUND(ID), 353 ms] 1112.41/291.61 (22) CpxRNTS 1112.41/291.61 (23) IntTrsBoundProof [UPPER BOUND(ID), 190 ms] 1112.41/291.61 (24) CpxRNTS 1112.41/291.61 (25) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1112.41/291.61 (26) CpxRNTS 1112.41/291.61 (27) IntTrsBoundProof [UPPER BOUND(ID), 979 ms] 1112.41/291.61 (28) CpxRNTS 1112.41/291.61 (29) IntTrsBoundProof [UPPER BOUND(ID), 543 ms] 1112.41/291.61 (30) CpxRNTS 1112.41/291.61 (31) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1112.41/291.61 (32) CpxRNTS 1112.41/291.61 (33) IntTrsBoundProof [UPPER BOUND(ID), 479 ms] 1112.41/291.61 (34) CpxRNTS 1112.41/291.61 (35) IntTrsBoundProof [UPPER BOUND(ID), 94 ms] 1112.41/291.61 (36) CpxRNTS 1112.41/291.61 (37) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1112.41/291.61 (38) CpxRNTS 1112.41/291.61 (39) IntTrsBoundProof [UPPER BOUND(ID), 844 ms] 1112.41/291.61 (40) CpxRNTS 1112.41/291.61 (41) IntTrsBoundProof [UPPER BOUND(ID), 206 ms] 1112.41/291.61 (42) CpxRNTS 1112.41/291.61 (43) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1112.41/291.61 (44) CpxRNTS 1112.41/291.61 (45) IntTrsBoundProof [UPPER BOUND(ID), 666 ms] 1112.41/291.61 (46) CpxRNTS 1112.41/291.61 (47) IntTrsBoundProof [UPPER BOUND(ID), 69 ms] 1112.41/291.61 (48) CpxRNTS 1112.41/291.61 (49) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1112.41/291.61 (50) CpxRNTS 1112.41/291.61 (51) IntTrsBoundProof [UPPER BOUND(ID), 242 ms] 1112.41/291.61 (52) CpxRNTS 1112.41/291.61 (53) IntTrsBoundProof [UPPER BOUND(ID), 3 ms] 1112.41/291.61 (54) CpxRNTS 1112.41/291.61 (55) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 1112.41/291.61 (56) CpxRNTS 1112.41/291.61 (57) IntTrsBoundProof [UPPER BOUND(ID), 97 ms] 1112.41/291.61 (58) CpxRNTS 1112.41/291.61 (59) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] 1112.41/291.61 (60) CpxRNTS 1112.41/291.61 (61) FinalProof [FINISHED, 0 ms] 1112.41/291.61 (62) BOUNDS(1, n^3) 1112.41/291.61 (63) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1112.41/291.61 (64) CpxTRS 1112.41/291.61 (65) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1112.41/291.61 (66) typed CpxTrs 1112.41/291.61 (67) OrderProof [LOWER BOUND(ID), 0 ms] 1112.41/291.61 (68) typed CpxTrs 1112.41/291.61 (69) RewriteLemmaProof [LOWER BOUND(ID), 271 ms] 1112.41/291.61 (70) BEST 1112.41/291.61 (71) proven lower bound 1112.41/291.61 (72) LowerBoundPropagationProof [FINISHED, 0 ms] 1112.41/291.61 (73) BOUNDS(n^1, INF) 1112.41/291.61 (74) typed CpxTrs 1112.41/291.61 (75) RewriteLemmaProof [LOWER BOUND(ID), 55 ms] 1112.41/291.61 (76) BEST 1112.41/291.61 (77) proven lower bound 1112.41/291.61 (78) LowerBoundPropagationProof [FINISHED, 0 ms] 1112.41/291.61 (79) BOUNDS(n^2, INF) 1112.41/291.61 (80) typed CpxTrs 1112.41/291.61 (81) RewriteLemmaProof [LOWER BOUND(ID), 41 ms] 1112.41/291.61 (82) typed CpxTrs 1112.41/291.61 (83) RewriteLemmaProof [LOWER BOUND(ID), 79 ms] 1112.41/291.61 (84) typed CpxTrs 1112.41/291.61 1112.41/291.61 1112.41/291.61 ---------------------------------------- 1112.41/291.61 1112.41/291.61 (0) 1112.41/291.61 Obligation: 1112.41/291.61 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, n^3). 1112.41/291.61
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