Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313414
details
property
value
status
complete
benchmark
MYNAT_nosorts_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n068.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
4.69555 seconds
cpu usage
14.2447
user time
13.1401
system time
1.10458
max virtual memory
1.898372E7
max residence set size
3624168.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), O(n^2))
output
14.14/4.61 WORST_CASE(Omega(n^2), O(n^2)) 14.14/4.62 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 14.14/4.62 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.14/4.62 14.14/4.62 14.14/4.62 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, n^2). 14.14/4.62 14.14/4.62 (0) CpxTRS 14.14/4.62 (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 14.14/4.62 (2) CpxWeightedTrs 14.14/4.62 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 14.14/4.62 (4) CpxTypedWeightedTrs 14.14/4.62 (5) CompletionProof [UPPER BOUND(ID), 0 ms] 14.14/4.62 (6) CpxTypedWeightedCompleteTrs 14.14/4.62 (7) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 3 ms] 14.14/4.62 (8) CpxRNTS 14.14/4.62 (9) CompleteCoflocoProof [FINISHED, 177 ms] 14.14/4.62 (10) BOUNDS(1, n^2) 14.14/4.62 (11) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 14.14/4.62 (12) CpxTRS 14.14/4.62 (13) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 14.14/4.62 (14) typed CpxTrs 14.14/4.62 (15) OrderProof [LOWER BOUND(ID), 0 ms] 14.14/4.62 (16) typed CpxTrs 14.14/4.62 (17) RewriteLemmaProof [LOWER BOUND(ID), 301 ms] 14.14/4.62 (18) BEST 14.14/4.62 (19) proven lower bound 14.14/4.62 (20) LowerBoundPropagationProof [FINISHED, 0 ms] 14.14/4.62 (21) BOUNDS(n^1, INF) 14.14/4.62 (22) typed CpxTrs 14.14/4.62 (23) RewriteLemmaProof [LOWER BOUND(ID), 47 ms] 14.14/4.62 (24) proven lower bound 14.14/4.62 (25) LowerBoundPropagationProof [FINISHED, 0 ms] 14.14/4.62 (26) BOUNDS(n^2, INF) 14.14/4.62 14.14/4.62 14.14/4.62 ---------------------------------------- 14.14/4.62 14.14/4.62 (0) 14.14/4.62 Obligation: 14.14/4.62 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, n^2). 14.14/4.62 14.14/4.62 14.14/4.62 The TRS R consists of the following rules: 14.14/4.62 14.14/4.62 and(tt, X) -> activate(X) 14.14/4.62 plus(N, 0) -> N 14.14/4.62 plus(N, s(M)) -> s(plus(N, M)) 14.14/4.62 x(N, 0) -> 0 14.14/4.62 x(N, s(M)) -> plus(x(N, M), N) 14.14/4.62 activate(X) -> X 14.14/4.62 14.14/4.62 S is empty. 14.14/4.62 Rewrite Strategy: INNERMOST 14.14/4.62 ---------------------------------------- 14.14/4.62 14.14/4.62 (1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) 14.14/4.62 Transformed relative TRS to weighted TRS 14.14/4.62 ---------------------------------------- 14.14/4.62 14.14/4.62 (2) 14.14/4.62 Obligation: 14.14/4.62 The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^2). 14.14/4.62 14.14/4.62 14.14/4.62 The TRS R consists of the following rules: 14.14/4.62 14.14/4.62 and(tt, X) -> activate(X) [1] 14.14/4.62 plus(N, 0) -> N [1] 14.14/4.62 plus(N, s(M)) -> s(plus(N, M)) [1] 14.14/4.62 x(N, 0) -> 0 [1] 14.14/4.62 x(N, s(M)) -> plus(x(N, M), N) [1] 14.14/4.62 activate(X) -> X [1] 14.14/4.62 14.14/4.62 Rewrite Strategy: INNERMOST 14.14/4.62 ---------------------------------------- 14.14/4.62 14.14/4.62 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 14.14/4.62 Infered types. 14.14/4.62 ---------------------------------------- 14.14/4.62 14.14/4.62 (4) 14.14/4.62 Obligation: 14.14/4.62 Runtime Complexity Weighted TRS with Types. 14.14/4.62 The TRS R consists of the following rules: 14.14/4.62 14.14/4.62 and(tt, X) -> activate(X) [1] 14.14/4.62 plus(N, 0) -> N [1] 14.14/4.62 plus(N, s(M)) -> s(plus(N, M)) [1] 14.14/4.62 x(N, 0) -> 0 [1] 14.14/4.62 x(N, s(M)) -> plus(x(N, M), N) [1] 14.14/4.62 activate(X) -> X [1] 14.14/4.62 14.14/4.62 The TRS has the following type information: 14.14/4.62 and :: tt -> and:activate -> and:activate 14.14/4.62 tt :: tt 14.14/4.62 activate :: and:activate -> and:activate 14.14/4.62 plus :: 0:s -> 0:s -> 0:s 14.14/4.62 0 :: 0:s 14.14/4.62 s :: 0:s -> 0:s
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