Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308439
details
property
value
status
complete
benchmark
4.17.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n166.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.561 seconds
cpu usage
321.737
user time
318.923
system time
2.81434
max virtual memory
1.8281632E7
max residence set size
6269396.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), ?)
output
321.65/291.52 WORST_CASE(Omega(n^2), ?) 321.65/291.53 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 321.65/291.53 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 321.65/291.53 321.65/291.53 321.65/291.53 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 321.65/291.53 321.65/291.53 (0) CpxTRS 321.65/291.53 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 321.65/291.53 (2) CpxTRS 321.65/291.53 (3) SlicingProof [LOWER BOUND(ID), 0 ms] 321.65/291.53 (4) CpxTRS 321.65/291.53 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 321.65/291.53 (6) typed CpxTrs 321.65/291.53 (7) OrderProof [LOWER BOUND(ID), 0 ms] 321.65/291.53 (8) typed CpxTrs 321.65/291.53 (9) RewriteLemmaProof [LOWER BOUND(ID), 290 ms] 321.65/291.53 (10) BEST 321.65/291.53 (11) proven lower bound 321.65/291.53 (12) LowerBoundPropagationProof [FINISHED, 0 ms] 321.65/291.53 (13) BOUNDS(n^1, INF) 321.65/291.53 (14) typed CpxTrs 321.65/291.53 (15) RewriteLemmaProof [LOWER BOUND(ID), 1609 ms] 321.65/291.53 (16) proven lower bound 321.65/291.53 (17) LowerBoundPropagationProof [FINISHED, 0 ms] 321.65/291.53 (18) BOUNDS(n^2, INF) 321.65/291.53 321.65/291.53 321.65/291.53 ---------------------------------------- 321.65/291.53 321.65/291.53 (0) 321.65/291.53 Obligation: 321.65/291.53 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 321.65/291.53 321.65/291.53 321.65/291.53 The TRS R consists of the following rules: 321.65/291.53 321.65/291.53 fac(s(x)) -> *(fac(p(s(x))), s(x)) 321.65/291.53 p(s(0)) -> 0 321.65/291.53 p(s(s(x))) -> s(p(s(x))) 321.65/291.53 321.65/291.53 S is empty. 321.65/291.53 Rewrite Strategy: FULL 321.65/291.53 ---------------------------------------- 321.65/291.53 321.65/291.53 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 321.65/291.53 Renamed function symbols to avoid clashes with predefined symbol. 321.65/291.53 ---------------------------------------- 321.65/291.53 321.65/291.53 (2) 321.65/291.53 Obligation: 321.65/291.53 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 321.65/291.53 321.65/291.53 321.65/291.53 The TRS R consists of the following rules: 321.65/291.53 321.65/291.53 fac(s(x)) -> *'(fac(p(s(x))), s(x)) 321.65/291.53 p(s(0')) -> 0' 321.65/291.53 p(s(s(x))) -> s(p(s(x))) 321.65/291.53 321.65/291.53 S is empty. 321.65/291.53 Rewrite Strategy: FULL 321.65/291.53 ---------------------------------------- 321.65/291.53 321.65/291.53 (3) SlicingProof (LOWER BOUND(ID)) 321.65/291.53 Sliced the following arguments: 321.65/291.53 *'/1 321.65/291.53 321.65/291.53 ---------------------------------------- 321.65/291.53 321.65/291.53 (4) 321.65/291.53 Obligation: 321.65/291.53 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 321.65/291.53 321.65/291.53 321.65/291.53 The TRS R consists of the following rules: 321.65/291.53 321.65/291.53 fac(s(x)) -> *'(fac(p(s(x)))) 321.65/291.53 p(s(0')) -> 0' 321.65/291.53 p(s(s(x))) -> s(p(s(x))) 321.65/291.53 321.65/291.53 S is empty. 321.65/291.53 Rewrite Strategy: FULL 321.65/291.53 ---------------------------------------- 321.65/291.53 321.65/291.53 (5) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 321.65/291.53 Infered types. 321.65/291.53 ---------------------------------------- 321.65/291.53 321.65/291.53 (6) 321.65/291.53 Obligation: 321.65/291.53 TRS: 321.65/291.53 Rules: 321.65/291.53 fac(s(x)) -> *'(fac(p(s(x)))) 321.65/291.53 p(s(0')) -> 0' 321.65/291.53 p(s(s(x))) -> s(p(s(x))) 321.65/291.53 321.65/291.53 Types: 321.65/291.53 fac :: s:0' -> *' 321.65/291.53 s :: s:0' -> s: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