Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313279
details
property
value
status
complete
benchmark
tpa3.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Secret_05_TRS
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.637 seconds
cpu usage
1138.77
user time
1128.58
system time
10.1924
max virtual memory
3.7907744E7
max residence set size
1.0469692E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), ?)
output
1138.30/291.52 WORST_CASE(Omega(n^2), ?) 1138.53/291.57 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1138.53/291.57 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1138.53/291.57 1138.53/291.57 1138.53/291.57 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 1138.53/291.57 1138.53/291.57 (0) CpxTRS 1138.53/291.57 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1138.53/291.57 (2) CpxTRS 1138.53/291.57 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1138.53/291.57 (4) typed CpxTrs 1138.53/291.57 (5) OrderProof [LOWER BOUND(ID), 0 ms] 1138.53/291.57 (6) typed CpxTrs 1138.53/291.57 (7) RewriteLemmaProof [LOWER BOUND(ID), 268 ms] 1138.53/291.57 (8) BEST 1138.53/291.57 (9) proven lower bound 1138.53/291.57 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 1138.53/291.57 (11) BOUNDS(n^1, INF) 1138.53/291.57 (12) typed CpxTrs 1138.53/291.57 (13) RewriteLemmaProof [LOWER BOUND(ID), 40 ms] 1138.53/291.57 (14) typed CpxTrs 1138.53/291.57 (15) RewriteLemmaProof [LOWER BOUND(ID), 49 ms] 1138.53/291.57 (16) BEST 1138.53/291.57 (17) proven lower bound 1138.53/291.57 (18) LowerBoundPropagationProof [FINISHED, 0 ms] 1138.53/291.57 (19) BOUNDS(n^2, INF) 1138.53/291.57 (20) typed CpxTrs 1138.53/291.57 1138.53/291.57 1138.53/291.57 ---------------------------------------- 1138.53/291.57 1138.53/291.57 (0) 1138.53/291.57 Obligation: 1138.53/291.57 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 1138.53/291.57 1138.53/291.57 1138.53/291.57 The TRS R consists of the following rules: 1138.53/291.57 1138.53/291.57 -(x, 0) -> x 1138.53/291.57 -(s(x), s(y)) -> -(x, y) 1138.53/291.57 +(0, y) -> y 1138.53/291.57 +(s(x), y) -> s(+(x, y)) 1138.53/291.57 *(x, 0) -> 0 1138.53/291.57 *(x, s(y)) -> +(x, *(x, y)) 1138.53/291.57 f(s(x)) -> f(-(*(s(s(0)), s(x)), s(s(x)))) 1138.53/291.57 1138.53/291.57 S is empty. 1138.53/291.57 Rewrite Strategy: INNERMOST 1138.53/291.57 ---------------------------------------- 1138.53/291.57 1138.53/291.57 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 1138.53/291.57 Renamed function symbols to avoid clashes with predefined symbol. 1138.53/291.57 ---------------------------------------- 1138.53/291.57 1138.53/291.57 (2) 1138.53/291.57 Obligation: 1138.53/291.57 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 1138.53/291.57 1138.53/291.57 1138.53/291.57 The TRS R consists of the following rules: 1138.53/291.57 1138.53/291.57 -(x, 0') -> x 1138.53/291.57 -(s(x), s(y)) -> -(x, y) 1138.53/291.57 +'(0', y) -> y 1138.53/291.57 +'(s(x), y) -> s(+'(x, y)) 1138.53/291.57 *'(x, 0') -> 0' 1138.53/291.57 *'(x, s(y)) -> +'(x, *'(x, y)) 1138.53/291.57 f(s(x)) -> f(-(*'(s(s(0')), s(x)), s(s(x)))) 1138.53/291.57 1138.53/291.57 S is empty. 1138.53/291.57 Rewrite Strategy: INNERMOST 1138.53/291.57 ---------------------------------------- 1138.53/291.57 1138.53/291.57 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 1138.53/291.57 Infered types. 1138.53/291.57 ---------------------------------------- 1138.53/291.57 1138.53/291.57 (4) 1138.53/291.57 Obligation: 1138.53/291.57 Innermost TRS: 1138.53/291.57 Rules: 1138.53/291.57 -(x, 0') -> x 1138.53/291.57 -(s(x), s(y)) -> -(x, y) 1138.53/291.57 +'(0', y) -> y 1138.53/291.57 +'(s(x), y) -> s(+'(x, y)) 1138.53/291.57 *'(x, 0') -> 0' 1138.53/291.57 *'(x, s(y)) -> +'(x, *'(x, y)) 1138.53/291.57 f(s(x)) -> f(-(*'(s(s(0')), s(x)), s(s(x)))) 1138.53/291.57 1138.53/291.57 Types: 1138.53/291.57 - :: 0':s -> 0':s -> 0':s 1138.53/291.57 0' :: 0':s 1138.53/291.57 s :: 0':s -> 0':s 1138.53/291.57 +' :: 0':s -> 0':s -> 0':s 1138.53/291.57 *' :: 0':s -> 0':s -> 0':s 1138.53/291.57 f :: 0':s -> f 1138.53/291.57 hole_0':s1_0 :: 0':s 1138.53/291.57 hole_f2_0 :: f 1138.53/291.57 gen_0':s3_0 :: Nat -> 0':s
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
