Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307692
details
property
value
status
complete
benchmark
#3.18.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n091.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.616 seconds
cpu usage
307.497
user time
305.143
system time
2.35425
max virtual memory
1.828136E7
max residence set size
5738400.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
307.28/291.51 WORST_CASE(Omega(n^1), ?) 307.44/291.57 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 307.44/291.57 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 307.44/291.57 307.44/291.57 307.44/291.57 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 307.44/291.57 307.44/291.57 (0) CpxTRS 307.44/291.57 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 307.44/291.57 (2) CpxTRS 307.44/291.57 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 307.44/291.57 (4) typed CpxTrs 307.44/291.57 (5) OrderProof [LOWER BOUND(ID), 0 ms] 307.44/291.57 (6) typed CpxTrs 307.44/291.57 (7) RewriteLemmaProof [LOWER BOUND(ID), 281 ms] 307.44/291.57 (8) BEST 307.44/291.57 (9) proven lower bound 307.44/291.57 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 307.44/291.57 (11) BOUNDS(n^1, INF) 307.44/291.57 (12) typed CpxTrs 307.44/291.57 (13) RewriteLemmaProof [LOWER BOUND(ID), 105 ms] 307.44/291.57 (14) typed CpxTrs 307.44/291.57 (15) RewriteLemmaProof [LOWER BOUND(ID), 49 ms] 307.44/291.57 (16) BOUNDS(1, INF) 307.44/291.57 307.44/291.57 307.44/291.57 ---------------------------------------- 307.44/291.57 307.44/291.57 (0) 307.44/291.57 Obligation: 307.44/291.57 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 307.44/291.57 307.44/291.57 307.44/291.57 The TRS R consists of the following rules: 307.44/291.57 307.44/291.57 minus(x, 0) -> x 307.44/291.57 minus(s(x), s(y)) -> minus(x, y) 307.44/291.57 double(0) -> 0 307.44/291.57 double(s(x)) -> s(s(double(x))) 307.44/291.57 plus(0, y) -> y 307.44/291.57 plus(s(x), y) -> s(plus(x, y)) 307.44/291.57 plus(s(x), y) -> plus(x, s(y)) 307.44/291.57 plus(s(x), y) -> s(plus(minus(x, y), double(y))) 307.44/291.57 307.44/291.57 S is empty. 307.44/291.57 Rewrite Strategy: FULL 307.44/291.57 ---------------------------------------- 307.44/291.57 307.44/291.57 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 307.44/291.57 Renamed function symbols to avoid clashes with predefined symbol. 307.44/291.57 ---------------------------------------- 307.44/291.57 307.44/291.57 (2) 307.44/291.57 Obligation: 307.44/291.57 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 307.44/291.57 307.44/291.57 307.44/291.57 The TRS R consists of the following rules: 307.44/291.57 307.44/291.57 minus(x, 0') -> x 307.44/291.57 minus(s(x), s(y)) -> minus(x, y) 307.44/291.57 double(0') -> 0' 307.44/291.57 double(s(x)) -> s(s(double(x))) 307.44/291.57 plus(0', y) -> y 307.44/291.57 plus(s(x), y) -> s(plus(x, y)) 307.44/291.57 plus(s(x), y) -> plus(x, s(y)) 307.44/291.57 plus(s(x), y) -> s(plus(minus(x, y), double(y))) 307.44/291.57 307.44/291.57 S is empty. 307.44/291.57 Rewrite Strategy: FULL 307.44/291.57 ---------------------------------------- 307.44/291.57 307.44/291.57 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 307.44/291.57 Infered types. 307.44/291.57 ---------------------------------------- 307.44/291.57 307.44/291.57 (4) 307.44/291.57 Obligation: 307.44/291.57 TRS: 307.44/291.57 Rules: 307.44/291.57 minus(x, 0') -> x 307.44/291.57 minus(s(x), s(y)) -> minus(x, y) 307.44/291.57 double(0') -> 0' 307.44/291.57 double(s(x)) -> s(s(double(x))) 307.44/291.57 plus(0', y) -> y 307.44/291.57 plus(s(x), y) -> s(plus(x, y)) 307.44/291.57 plus(s(x), y) -> plus(x, s(y)) 307.44/291.57 plus(s(x), y) -> s(plus(minus(x, y), double(y))) 307.44/291.57 307.44/291.57 Types: 307.44/291.57 minus :: 0':s -> 0':s -> 0':s 307.44/291.57 0' :: 0':s 307.44/291.57 s :: 0':s -> 0':s 307.44/291.57 double :: 0':s -> 0':s 307.44/291.57 plus :: 0':s -> 0':s -> 0':s 307.44/291.57 hole_0':s1_0 :: 0':s 307.44/291.57 gen_0':s2_0 :: Nat -> 0':s 307.44/291.57 307.44/291.57 ---------------------------------------- 307.44/291.57
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
