Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307861
details
property
value
status
complete
benchmark
tpa10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
Secret_06_TRS
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.647 seconds
cpu usage
312.18
user time
310.151
system time
2.02915
max virtual memory
1.8279384E7
max residence set size
5364224.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), ?)
output
312.08/291.60 WORST_CASE(Omega(n^2), ?) 312.08/291.61 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 312.08/291.61 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 312.08/291.61 312.08/291.61 312.08/291.61 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 312.08/291.61 312.08/291.61 (0) CpxTRS 312.08/291.61 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 312.08/291.61 (2) CpxTRS 312.08/291.61 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 312.08/291.61 (4) typed CpxTrs 312.08/291.61 (5) OrderProof [LOWER BOUND(ID), 0 ms] 312.08/291.61 (6) typed CpxTrs 312.08/291.61 (7) RewriteLemmaProof [LOWER BOUND(ID), 334 ms] 312.08/291.61 (8) BEST 312.08/291.61 (9) proven lower bound 312.08/291.61 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 312.08/291.61 (11) BOUNDS(n^1, INF) 312.08/291.61 (12) typed CpxTrs 312.08/291.61 (13) RewriteLemmaProof [LOWER BOUND(ID), 36 ms] 312.08/291.61 (14) typed CpxTrs 312.08/291.61 (15) RewriteLemmaProof [LOWER BOUND(ID), 40 ms] 312.08/291.61 (16) typed CpxTrs 312.08/291.61 (17) RewriteLemmaProof [LOWER BOUND(ID), 0 ms] 312.08/291.61 (18) typed CpxTrs 312.08/291.61 (19) RewriteLemmaProof [LOWER BOUND(ID), 38 ms] 312.08/291.61 (20) BEST 312.08/291.61 (21) proven lower bound 312.08/291.61 (22) LowerBoundPropagationProof [FINISHED, 0 ms] 312.08/291.61 (23) BOUNDS(n^2, INF) 312.08/291.61 (24) typed CpxTrs 312.08/291.61 312.08/291.61 312.08/291.61 ---------------------------------------- 312.08/291.61 312.08/291.61 (0) 312.08/291.61 Obligation: 312.08/291.61 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 312.08/291.61 312.08/291.61 312.08/291.61 The TRS R consists of the following rules: 312.08/291.61 312.08/291.61 min(0, y) -> 0 312.08/291.61 min(x, 0) -> 0 312.08/291.61 min(s(x), s(y)) -> s(min(x, y)) 312.08/291.61 max(0, y) -> y 312.08/291.61 max(x, 0) -> x 312.08/291.61 max(s(x), s(y)) -> s(max(x, y)) 312.08/291.61 +(0, y) -> y 312.08/291.61 +(s(x), y) -> s(+(x, y)) 312.08/291.61 -(x, 0) -> x 312.08/291.61 -(s(x), s(y)) -> -(x, y) 312.08/291.61 *(x, 0) -> 0 312.08/291.61 *(x, s(y)) -> +(x, *(x, y)) 312.08/291.61 p(s(x)) -> x 312.08/291.61 f(s(x), s(y)) -> f(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y))) 312.08/291.61 312.08/291.61 S is empty. 312.08/291.61 Rewrite Strategy: FULL 312.08/291.61 ---------------------------------------- 312.08/291.61 312.08/291.61 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 312.08/291.61 Renamed function symbols to avoid clashes with predefined symbol. 312.08/291.61 ---------------------------------------- 312.08/291.61 312.08/291.61 (2) 312.08/291.61 Obligation: 312.08/291.61 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 312.08/291.61 312.08/291.61 312.08/291.61 The TRS R consists of the following rules: 312.08/291.61 312.08/291.61 min(0', y) -> 0' 312.08/291.61 min(x, 0') -> 0' 312.08/291.61 min(s(x), s(y)) -> s(min(x, y)) 312.08/291.61 max(0', y) -> y 312.08/291.61 max(x, 0') -> x 312.08/291.61 max(s(x), s(y)) -> s(max(x, y)) 312.08/291.61 +'(0', y) -> y 312.08/291.61 +'(s(x), y) -> s(+'(x, y)) 312.08/291.61 -(x, 0') -> x 312.08/291.61 -(s(x), s(y)) -> -(x, y) 312.08/291.61 *'(x, 0') -> 0' 312.08/291.61 *'(x, s(y)) -> +'(x, *'(x, y)) 312.08/291.61 p(s(x)) -> x 312.08/291.61 f(s(x), s(y)) -> f(-(min(s(x), s(y)), max(s(x), s(y))), *'(s(x), s(y))) 312.08/291.61 312.08/291.61 S is empty. 312.08/291.61 Rewrite Strategy: FULL 312.08/291.61 ---------------------------------------- 312.08/291.61 312.08/291.61 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 312.08/291.61 Infered types. 312.08/291.61 ---------------------------------------- 312.08/291.61 312.08/291.61 (4) 312.08/291.61 Obligation: 312.08/291.61 TRS: 312.08/291.61 Rules:
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