Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307684
details
property
value
status
complete
benchmark
Liveness6.1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.575 seconds
cpu usage
1055.48
user time
1042.15
system time
13.3319
max virtual memory
5.6797828E7
max residence set size
1.3194336E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
1055.20/291.48 WORST_CASE(Omega(n^1), ?) 1055.20/291.48 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1055.20/291.48 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1055.20/291.48 1055.20/291.48 1055.20/291.48 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1055.20/291.48 1055.20/291.48 (0) CpxTRS 1055.20/291.48 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1055.20/291.48 (2) CpxTRS 1055.20/291.48 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1055.20/291.48 (4) typed CpxTrs 1055.20/291.48 (5) OrderProof [LOWER BOUND(ID), 0 ms] 1055.20/291.48 (6) typed CpxTrs 1055.20/291.48 (7) RewriteLemmaProof [LOWER BOUND(ID), 293 ms] 1055.20/291.48 (8) BEST 1055.20/291.48 (9) proven lower bound 1055.20/291.48 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 1055.20/291.48 (11) BOUNDS(n^1, INF) 1055.20/291.48 (12) typed CpxTrs 1055.20/291.48 (13) RewriteLemmaProof [LOWER BOUND(ID), 12 ms] 1055.20/291.48 (14) typed CpxTrs 1055.20/291.48 (15) RewriteLemmaProof [LOWER BOUND(ID), 197 ms] 1055.20/291.48 (16) typed CpxTrs 1055.20/291.48 1055.20/291.48 1055.20/291.48 ---------------------------------------- 1055.20/291.48 1055.20/291.48 (0) 1055.20/291.48 Obligation: 1055.20/291.48 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1055.20/291.48 1055.20/291.48 1055.20/291.48 The TRS R consists of the following rules: 1055.20/291.48 1055.20/291.48 top(free(x)) -> top(check(new(x))) 1055.20/291.48 new(free(x)) -> free(new(x)) 1055.20/291.48 old(free(x)) -> free(old(x)) 1055.20/291.48 new(serve) -> free(serve) 1055.20/291.48 old(serve) -> free(serve) 1055.20/291.48 check(free(x)) -> free(check(x)) 1055.20/291.48 check(new(x)) -> new(check(x)) 1055.20/291.48 check(old(x)) -> old(check(x)) 1055.20/291.48 check(old(x)) -> old(x) 1055.20/291.48 1055.20/291.48 S is empty. 1055.20/291.48 Rewrite Strategy: FULL 1055.20/291.48 ---------------------------------------- 1055.20/291.48 1055.20/291.48 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 1055.20/291.48 Renamed function symbols to avoid clashes with predefined symbol. 1055.20/291.48 ---------------------------------------- 1055.20/291.48 1055.20/291.48 (2) 1055.20/291.48 Obligation: 1055.20/291.48 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1055.20/291.48 1055.20/291.48 1055.20/291.48 The TRS R consists of the following rules: 1055.20/291.48 1055.20/291.48 top(free(x)) -> top(check(new(x))) 1055.20/291.48 new(free(x)) -> free(new(x)) 1055.20/291.48 old(free(x)) -> free(old(x)) 1055.20/291.48 new(serve) -> free(serve) 1055.20/291.48 old(serve) -> free(serve) 1055.20/291.48 check(free(x)) -> free(check(x)) 1055.20/291.48 check(new(x)) -> new(check(x)) 1055.20/291.48 check(old(x)) -> old(check(x)) 1055.20/291.48 check(old(x)) -> old(x) 1055.20/291.48 1055.20/291.48 S is empty. 1055.20/291.48 Rewrite Strategy: FULL 1055.20/291.48 ---------------------------------------- 1055.20/291.48 1055.20/291.48 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 1055.20/291.48 Infered types. 1055.20/291.48 ---------------------------------------- 1055.20/291.48 1055.20/291.48 (4) 1055.20/291.48 Obligation: 1055.20/291.48 TRS: 1055.20/291.48 Rules: 1055.20/291.48 top(free(x)) -> top(check(new(x))) 1055.20/291.48 new(free(x)) -> free(new(x)) 1055.20/291.48 old(free(x)) -> free(old(x)) 1055.20/291.48 new(serve) -> free(serve) 1055.20/291.48 old(serve) -> free(serve) 1055.20/291.48 check(free(x)) -> free(check(x)) 1055.20/291.48 check(new(x)) -> new(check(x)) 1055.20/291.48 check(old(x)) -> old(check(x)) 1055.20/291.48 check(old(x)) -> old(x) 1055.20/291.48 1055.20/291.48 Types: 1055.20/291.48 top :: free:serve -> top 1055.20/291.48 free :: free:serve -> free:serve 1055.20/291.48 check :: free:serve -> free:serve 1055.20/291.48 new :: free:serve -> free:serve 1055.20/291.48 old :: free:serve -> free:serve 1055.20/291.48 serve :: free:serve 1055.20/291.48 hole_top1_0 :: top
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