Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307756
details
property
value
status
complete
benchmark
kabasci05.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n119.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.891 seconds
cpu usage
358.437
user time
355.014
system time
3.4226
max virtual memory
1.8281216E7
max residence set size
6880212.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
357.09/291.54 WORST_CASE(Omega(n^1), ?) 358.11/291.85 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 358.11/291.85 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 358.11/291.85 358.11/291.85 358.11/291.85 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 358.11/291.85 358.11/291.85 (0) CpxTRS 358.11/291.85 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 358.11/291.85 (2) CpxTRS 358.11/291.85 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 358.11/291.85 (4) typed CpxTrs 358.11/291.85 (5) OrderProof [LOWER BOUND(ID), 0 ms] 358.11/291.85 (6) typed CpxTrs 358.11/291.85 (7) RewriteLemmaProof [LOWER BOUND(ID), 311 ms] 358.11/291.85 (8) BEST 358.11/291.85 (9) proven lower bound 358.11/291.85 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 358.11/291.85 (11) BOUNDS(n^1, INF) 358.11/291.85 (12) typed CpxTrs 358.11/291.85 (13) RewriteLemmaProof [LOWER BOUND(ID), 75 ms] 358.11/291.85 (14) typed CpxTrs 358.11/291.85 (15) RewriteLemmaProof [LOWER BOUND(ID), 65 ms] 358.11/291.85 (16) typed CpxTrs 358.11/291.85 (17) RewriteLemmaProof [LOWER BOUND(ID), 127 ms] 358.11/291.85 (18) typed CpxTrs 358.11/291.85 358.11/291.85 358.11/291.85 ---------------------------------------- 358.11/291.85 358.11/291.85 (0) 358.11/291.85 Obligation: 358.11/291.85 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 358.11/291.85 358.11/291.85 358.11/291.85 The TRS R consists of the following rules: 358.11/291.85 358.11/291.85 min(x, 0) -> 0 358.11/291.85 min(0, y) -> 0 358.11/291.85 min(s(x), s(y)) -> s(min(x, y)) 358.11/291.85 max(x, 0) -> x 358.11/291.85 max(0, y) -> y 358.11/291.85 max(s(x), s(y)) -> s(max(x, y)) 358.11/291.85 minus(x, 0) -> x 358.11/291.85 minus(s(x), s(y)) -> s(minus(x, y)) 358.11/291.85 gcd(s(x), s(y)) -> gcd(minus(max(x, y), min(x, transform(y))), s(min(x, y))) 358.11/291.85 transform(x) -> s(s(x)) 358.11/291.85 transform(cons(x, y)) -> cons(cons(x, x), x) 358.11/291.85 transform(cons(x, y)) -> y 358.11/291.85 transform(s(x)) -> s(s(transform(x))) 358.11/291.85 cons(x, y) -> y 358.11/291.85 cons(x, cons(y, s(z))) -> cons(y, x) 358.11/291.85 cons(cons(x, z), s(y)) -> transform(x) 358.11/291.85 358.11/291.85 S is empty. 358.11/291.85 Rewrite Strategy: FULL 358.11/291.85 ---------------------------------------- 358.11/291.85 358.11/291.85 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 358.11/291.85 Renamed function symbols to avoid clashes with predefined symbol. 358.11/291.85 ---------------------------------------- 358.11/291.85 358.11/291.85 (2) 358.11/291.85 Obligation: 358.11/291.85 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 358.11/291.85 358.11/291.85 358.11/291.85 The TRS R consists of the following rules: 358.11/291.85 358.11/291.85 min(x, 0') -> 0' 358.11/291.85 min(0', y) -> 0' 358.11/291.85 min(s(x), s(y)) -> s(min(x, y)) 358.11/291.85 max(x, 0') -> x 358.11/291.85 max(0', y) -> y 358.11/291.85 max(s(x), s(y)) -> s(max(x, y)) 358.11/291.85 minus(x, 0') -> x 358.11/291.85 minus(s(x), s(y)) -> s(minus(x, y)) 358.11/291.85 gcd(s(x), s(y)) -> gcd(minus(max(x, y), min(x, transform(y))), s(min(x, y))) 358.11/291.85 transform(x) -> s(s(x)) 358.11/291.85 transform(cons(x, y)) -> cons(cons(x, x), x) 358.11/291.85 transform(cons(x, y)) -> y 358.11/291.85 transform(s(x)) -> s(s(transform(x))) 358.11/291.85 cons(x, y) -> y 358.11/291.85 cons(x, cons(y, s(z))) -> cons(y, x) 358.11/291.85 cons(cons(x, z), s(y)) -> transform(x) 358.11/291.85 358.11/291.85 S is empty. 358.11/291.85 Rewrite Strategy: FULL 358.11/291.85 ---------------------------------------- 358.11/291.85 358.11/291.85 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 358.11/291.85 Infered types. 358.11/291.85 ---------------------------------------- 358.11/291.85 358.11/291.85 (4) 358.11/291.85 Obligation: 358.11/291.85 TRS: 358.11/291.85 Rules: 358.11/291.85 min(x, 0') -> 0' 358.11/291.85 min(0', y) -> 0'
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