Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308224
details
property
value
status
complete
benchmark
PEANO_nosorts_noand_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n068.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.889 seconds
cpu usage
1115.84
user time
1103.83
system time
12.0043
max virtual memory
3.7247816E7
max residence set size
1.5099336E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), ?)
output
1114.48/291.51 WORST_CASE(Omega(n^2), ?) 1115.16/291.75 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1115.16/291.75 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1115.16/291.75 1115.16/291.75 1115.16/291.75 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 1115.16/291.75 1115.16/291.75 (0) CpxTRS 1115.16/291.75 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1115.16/291.75 (2) CpxTRS 1115.16/291.75 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1115.16/291.75 (4) typed CpxTrs 1115.16/291.75 (5) OrderProof [LOWER BOUND(ID), 0 ms] 1115.16/291.75 (6) typed CpxTrs 1115.16/291.75 (7) RewriteLemmaProof [LOWER BOUND(ID), 620 ms] 1115.16/291.75 (8) BEST 1115.16/291.75 (9) proven lower bound 1115.16/291.75 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 1115.16/291.75 (11) BOUNDS(n^1, INF) 1115.16/291.75 (12) typed CpxTrs 1115.16/291.75 (13) RewriteLemmaProof [LOWER BOUND(ID), 120 ms] 1115.16/291.75 (14) BEST 1115.16/291.75 (15) proven lower bound 1115.16/291.75 (16) LowerBoundPropagationProof [FINISHED, 0 ms] 1115.16/291.75 (17) BOUNDS(n^2, INF) 1115.16/291.75 (18) typed CpxTrs 1115.16/291.75 (19) RewriteLemmaProof [LOWER BOUND(ID), 109 ms] 1115.16/291.75 (20) typed CpxTrs 1115.16/291.75 (21) RewriteLemmaProof [LOWER BOUND(ID), 70 ms] 1115.16/291.75 (22) typed CpxTrs 1115.16/291.75 (23) RewriteLemmaProof [LOWER BOUND(ID), 0 ms] 1115.16/291.75 (24) typed CpxTrs 1115.16/291.75 (25) RewriteLemmaProof [LOWER BOUND(ID), 128 ms] 1115.16/291.75 (26) typed CpxTrs 1115.16/291.75 (27) RewriteLemmaProof [LOWER BOUND(ID), 81 ms] 1115.16/291.75 (28) BOUNDS(1, INF) 1115.16/291.75 1115.16/291.75 1115.16/291.75 ---------------------------------------- 1115.16/291.75 1115.16/291.75 (0) 1115.16/291.75 Obligation: 1115.16/291.75 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 1115.16/291.75 1115.16/291.75 1115.16/291.75 The TRS R consists of the following rules: 1115.16/291.75 1115.16/291.75 a__U11(tt, M, N) -> a__U12(tt, M, N) 1115.16/291.75 a__U12(tt, M, N) -> s(a__plus(mark(N), mark(M))) 1115.16/291.75 a__plus(N, 0) -> mark(N) 1115.16/291.75 a__plus(N, s(M)) -> a__U11(tt, M, N) 1115.16/291.75 mark(U11(X1, X2, X3)) -> a__U11(mark(X1), X2, X3) 1115.16/291.75 mark(U12(X1, X2, X3)) -> a__U12(mark(X1), X2, X3) 1115.16/291.75 mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2)) 1115.16/291.75 mark(tt) -> tt 1115.16/291.75 mark(s(X)) -> s(mark(X)) 1115.16/291.75 mark(0) -> 0 1115.16/291.75 a__U11(X1, X2, X3) -> U11(X1, X2, X3) 1115.16/291.75 a__U12(X1, X2, X3) -> U12(X1, X2, X3) 1115.16/291.75 a__plus(X1, X2) -> plus(X1, X2) 1115.16/291.75 1115.16/291.75 S is empty. 1115.16/291.75 Rewrite Strategy: FULL 1115.16/291.75 ---------------------------------------- 1115.16/291.75 1115.16/291.75 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 1115.16/291.75 Renamed function symbols to avoid clashes with predefined symbol. 1115.16/291.75 ---------------------------------------- 1115.16/291.75 1115.16/291.75 (2) 1115.16/291.75 Obligation: 1115.16/291.75 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 1115.16/291.75 1115.16/291.75 1115.16/291.75 The TRS R consists of the following rules: 1115.16/291.75 1115.16/291.75 a__U11(tt, M, N) -> a__U12(tt, M, N) 1115.16/291.75 a__U12(tt, M, N) -> s(a__plus(mark(N), mark(M))) 1115.16/291.75 a__plus(N, 0') -> mark(N) 1115.16/291.75 a__plus(N, s(M)) -> a__U11(tt, M, N) 1115.16/291.75 mark(U11(X1, X2, X3)) -> a__U11(mark(X1), X2, X3) 1115.16/291.75 mark(U12(X1, X2, X3)) -> a__U12(mark(X1), X2, X3) 1115.16/291.75 mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2)) 1115.16/291.75 mark(tt) -> tt 1115.16/291.75 mark(s(X)) -> s(mark(X)) 1115.16/291.75 mark(0') -> 0' 1115.16/291.75 a__U11(X1, X2, X3) -> U11(X1, X2, X3) 1115.16/291.75 a__U12(X1, X2, X3) -> U12(X1, X2, X3) 1115.16/291.75 a__plus(X1, X2) -> plus(X1, X2) 1115.16/291.75 1115.16/291.75 S is empty. 1115.16/291.75 Rewrite Strategy: FULL 1115.16/291.75 ---------------------------------------- 1115.16/291.75 1115.16/291.75 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 1115.16/291.75 Infered types. 1115.16/291.75 ---------------------------------------- 1115.16/291.75 1115.16/291.75 (4) 1115.16/291.75 Obligation:
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