Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313513
details
property
value
status
complete
benchmark
Ex49_GM04_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n090.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
292.862 seconds
cpu usage
1123.7
user time
1110.6
system time
13.1007
max virtual memory
5.6408728E7
max residence set size
1.505728E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
1118.60/291.53 WORST_CASE(Omega(n^1), ?) 1123.52/292.79 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 1123.52/292.79 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1123.52/292.79 1123.52/292.79 1123.52/292.79 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1123.52/292.79 1123.52/292.79 (0) CpxTRS 1123.52/292.79 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1123.52/292.79 (2) CpxTRS 1123.52/292.79 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1123.52/292.79 (4) typed CpxTrs 1123.52/292.79 (5) OrderProof [LOWER BOUND(ID), 0 ms] 1123.52/292.79 (6) typed CpxTrs 1123.52/292.79 (7) RewriteLemmaProof [LOWER BOUND(ID), 333 ms] 1123.52/292.79 (8) BEST 1123.52/292.79 (9) proven lower bound 1123.52/292.79 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 1123.52/292.79 (11) BOUNDS(n^1, INF) 1123.52/292.79 (12) typed CpxTrs 1123.52/292.79 (13) RewriteLemmaProof [LOWER BOUND(ID), 19 ms] 1123.52/292.79 (14) typed CpxTrs 1123.52/292.79 (15) RewriteLemmaProof [LOWER BOUND(ID), 142 ms] 1123.52/292.79 (16) BOUNDS(1, INF) 1123.52/292.79 1123.52/292.79 1123.52/292.79 ---------------------------------------- 1123.52/292.79 1123.52/292.79 (0) 1123.52/292.79 Obligation: 1123.52/292.79 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1123.52/292.79 1123.52/292.79 1123.52/292.79 The TRS R consists of the following rules: 1123.52/292.79 1123.52/292.79 a__minus(0, Y) -> 0 1123.52/292.79 a__minus(s(X), s(Y)) -> a__minus(X, Y) 1123.52/292.79 a__geq(X, 0) -> true 1123.52/292.79 a__geq(0, s(Y)) -> false 1123.52/292.79 a__geq(s(X), s(Y)) -> a__geq(X, Y) 1123.52/292.79 a__div(0, s(Y)) -> 0 1123.52/292.79 a__div(s(X), s(Y)) -> a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0) 1123.52/292.79 a__if(true, X, Y) -> mark(X) 1123.52/292.79 a__if(false, X, Y) -> mark(Y) 1123.52/292.79 mark(minus(X1, X2)) -> a__minus(X1, X2) 1123.52/292.79 mark(geq(X1, X2)) -> a__geq(X1, X2) 1123.52/292.79 mark(div(X1, X2)) -> a__div(mark(X1), X2) 1123.52/292.79 mark(if(X1, X2, X3)) -> a__if(mark(X1), X2, X3) 1123.52/292.79 mark(0) -> 0 1123.52/292.79 mark(s(X)) -> s(mark(X)) 1123.52/292.79 mark(true) -> true 1123.52/292.79 mark(false) -> false 1123.52/292.79 a__minus(X1, X2) -> minus(X1, X2) 1123.52/292.79 a__geq(X1, X2) -> geq(X1, X2) 1123.52/292.79 a__div(X1, X2) -> div(X1, X2) 1123.52/292.79 a__if(X1, X2, X3) -> if(X1, X2, X3) 1123.52/292.79 1123.52/292.79 S is empty. 1123.52/292.79 Rewrite Strategy: INNERMOST 1123.52/292.79 ---------------------------------------- 1123.52/292.79 1123.52/292.79 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 1123.52/292.79 Renamed function symbols to avoid clashes with predefined symbol. 1123.52/292.79 ---------------------------------------- 1123.52/292.79 1123.52/292.79 (2) 1123.52/292.79 Obligation: 1123.52/292.79 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1123.52/292.79 1123.52/292.79 1123.52/292.79 The TRS R consists of the following rules: 1123.52/292.79 1123.52/292.79 a__minus(0', Y) -> 0' 1123.52/292.79 a__minus(s(X), s(Y)) -> a__minus(X, Y) 1123.52/292.79 a__geq(X, 0') -> true 1123.52/292.79 a__geq(0', s(Y)) -> false 1123.52/292.79 a__geq(s(X), s(Y)) -> a__geq(X, Y) 1123.52/292.79 a__div(0', s(Y)) -> 0' 1123.52/292.79 a__div(s(X), s(Y)) -> a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0') 1123.52/292.79 a__if(true, X, Y) -> mark(X) 1123.52/292.79 a__if(false, X, Y) -> mark(Y) 1123.52/292.79 mark(minus(X1, X2)) -> a__minus(X1, X2) 1123.52/292.79 mark(geq(X1, X2)) -> a__geq(X1, X2) 1123.52/292.79 mark(div(X1, X2)) -> a__div(mark(X1), X2) 1123.52/292.79 mark(if(X1, X2, X3)) -> a__if(mark(X1), X2, X3) 1123.52/292.79 mark(0') -> 0' 1123.52/292.79 mark(s(X)) -> s(mark(X)) 1123.52/292.79 mark(true) -> true 1123.52/292.79 mark(false) -> false 1123.52/292.79 a__minus(X1, X2) -> minus(X1, X2) 1123.52/292.79 a__geq(X1, X2) -> geq(X1, X2) 1123.52/292.79 a__div(X1, X2) -> div(X1, X2) 1123.52/292.79 a__if(X1, X2, X3) -> if(X1, X2, X3) 1123.52/292.79 1123.52/292.79 S is empty. 1123.52/292.79 Rewrite Strategy: INNERMOST 1123.52/292.79 ---------------------------------------- 1123.52/292.79 1123.52/292.79 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 1123.52/292.79 Infered types.
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