Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313349
details
property
value
status
complete
benchmark
t013.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n016.star.cs.uiowa.edu
space
HirokawaMiddeldorp_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.545 seconds
cpu usage
1040.99
user time
1031.24
system time
9.75544
max virtual memory
3.7114688E7
max residence set size
1.4862372E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
1040.81/291.47 WORST_CASE(Omega(n^1), ?) 1040.81/291.48 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1040.81/291.48 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1040.81/291.48 1040.81/291.48 1040.81/291.48 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1040.81/291.48 1040.81/291.48 (0) CpxTRS 1040.81/291.48 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1040.81/291.48 (2) CpxTRS 1040.81/291.48 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1040.81/291.48 (4) typed CpxTrs 1040.81/291.48 (5) OrderProof [LOWER BOUND(ID), 0 ms] 1040.81/291.48 (6) typed CpxTrs 1040.81/291.48 (7) RewriteLemmaProof [LOWER BOUND(ID), 313 ms] 1040.81/291.48 (8) BEST 1040.81/291.48 (9) proven lower bound 1040.81/291.48 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 1040.81/291.48 (11) BOUNDS(n^1, INF) 1040.81/291.48 (12) typed CpxTrs 1040.81/291.48 (13) RewriteLemmaProof [LOWER BOUND(ID), 1199 ms] 1040.81/291.48 (14) typed CpxTrs 1040.81/291.48 (15) RewriteLemmaProof [LOWER BOUND(ID), 1959 ms] 1040.81/291.48 (16) typed CpxTrs 1040.81/291.48 (17) RewriteLemmaProof [LOWER BOUND(ID), 2462 ms] 1040.81/291.48 (18) BOUNDS(1, INF) 1040.81/291.48 1040.81/291.48 1040.81/291.48 ---------------------------------------- 1040.81/291.48 1040.81/291.48 (0) 1040.81/291.48 Obligation: 1040.81/291.48 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1040.81/291.48 1040.81/291.48 1040.81/291.48 The TRS R consists of the following rules: 1040.81/291.48 1040.81/291.48 -(x, 0) -> x 1040.81/291.48 -(0, s(y)) -> 0 1040.81/291.48 -(s(x), s(y)) -> -(x, y) 1040.81/291.48 f(0) -> 0 1040.81/291.48 f(s(x)) -> -(s(x), g(f(x))) 1040.81/291.48 g(0) -> s(0) 1040.81/291.48 g(s(x)) -> -(s(x), f(g(x))) 1040.81/291.48 1040.81/291.48 S is empty. 1040.81/291.48 Rewrite Strategy: INNERMOST 1040.81/291.48 ---------------------------------------- 1040.81/291.48 1040.81/291.48 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 1040.81/291.48 Renamed function symbols to avoid clashes with predefined symbol. 1040.81/291.48 ---------------------------------------- 1040.81/291.48 1040.81/291.48 (2) 1040.81/291.48 Obligation: 1040.81/291.48 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1040.81/291.48 1040.81/291.48 1040.81/291.48 The TRS R consists of the following rules: 1040.81/291.48 1040.81/291.48 -(x, 0') -> x 1040.81/291.48 -(0', s(y)) -> 0' 1040.81/291.48 -(s(x), s(y)) -> -(x, y) 1040.81/291.48 f(0') -> 0' 1040.81/291.48 f(s(x)) -> -(s(x), g(f(x))) 1040.81/291.48 g(0') -> s(0') 1040.81/291.48 g(s(x)) -> -(s(x), f(g(x))) 1040.81/291.48 1040.81/291.48 S is empty. 1040.81/291.48 Rewrite Strategy: INNERMOST 1040.81/291.48 ---------------------------------------- 1040.81/291.48 1040.81/291.48 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 1040.81/291.48 Infered types. 1040.81/291.48 ---------------------------------------- 1040.81/291.48 1040.81/291.48 (4) 1040.81/291.48 Obligation: 1040.81/291.48 Innermost TRS: 1040.81/291.48 Rules: 1040.81/291.48 -(x, 0') -> x 1040.81/291.48 -(0', s(y)) -> 0' 1040.81/291.48 -(s(x), s(y)) -> -(x, y) 1040.81/291.48 f(0') -> 0' 1040.81/291.48 f(s(x)) -> -(s(x), g(f(x))) 1040.81/291.48 g(0') -> s(0') 1040.81/291.48 g(s(x)) -> -(s(x), f(g(x))) 1040.81/291.48 1040.81/291.48 Types: 1040.81/291.48 - :: 0':s -> 0':s -> 0':s 1040.81/291.48 0' :: 0':s 1040.81/291.48 s :: 0':s -> 0':s 1040.81/291.48 f :: 0':s -> 0':s 1040.81/291.48 g :: 0':s -> 0':s 1040.81/291.48 hole_0':s1_0 :: 0':s 1040.81/291.48 gen_0':s2_0 :: Nat -> 0':s 1040.81/291.48 1040.81/291.48 ---------------------------------------- 1040.81/291.48 1040.81/291.48 (5) OrderProof (LOWER BOUND(ID))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40
