Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308283
details
property
value
status
complete
benchmark
PALINDROME_nokinds_noand_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n128.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
11.4215 seconds
cpu usage
33.1693
user time
31.2307
system time
1.93861
max virtual memory
1.94733E7
max residence set size
4145084.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
30.41/8.90 WORST_CASE(Omega(n^1), O(n^1)) 30.41/8.92 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 30.41/8.92 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 30.41/8.92 30.41/8.92 30.41/8.92 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 30.41/8.92 30.41/8.92 (0) CpxTRS 30.41/8.92 (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] 30.41/8.92 (2) CpxTRS 30.41/8.92 (3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] 30.41/8.92 (4) CpxTRS 30.41/8.92 (5) CpxTrsMatchBoundsTAProof [FINISHED, 475 ms] 30.41/8.92 (6) BOUNDS(1, n^1) 30.41/8.92 (7) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 30.41/8.92 (8) CpxTRS 30.41/8.92 (9) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 30.41/8.92 (10) typed CpxTrs 30.41/8.92 (11) OrderProof [LOWER BOUND(ID), 0 ms] 30.41/8.92 (12) typed CpxTrs 30.41/8.92 (13) RewriteLemmaProof [LOWER BOUND(ID), 512 ms] 30.41/8.92 (14) BEST 30.41/8.92 (15) proven lower bound 30.41/8.92 (16) LowerBoundPropagationProof [FINISHED, 0 ms] 30.41/8.92 (17) BOUNDS(n^1, INF) 30.41/8.92 (18) typed CpxTrs 30.41/8.92 (19) RewriteLemmaProof [LOWER BOUND(ID), 99 ms] 30.41/8.92 (20) typed CpxTrs 30.41/8.92 (21) RewriteLemmaProof [LOWER BOUND(ID), 150 ms] 30.41/8.92 (22) typed CpxTrs 30.41/8.92 (23) RewriteLemmaProof [LOWER BOUND(ID), 92 ms] 30.41/8.92 (24) typed CpxTrs 30.41/8.92 (25) RewriteLemmaProof [LOWER BOUND(ID), 78 ms] 30.41/8.92 (26) typed CpxTrs 30.41/8.92 (27) RewriteLemmaProof [LOWER BOUND(ID), 121 ms] 30.41/8.92 (28) typed CpxTrs 30.41/8.92 (29) RewriteLemmaProof [LOWER BOUND(ID), 172 ms] 30.41/8.92 (30) typed CpxTrs 30.41/8.92 (31) RewriteLemmaProof [LOWER BOUND(ID), 104 ms] 30.41/8.92 (32) typed CpxTrs 30.41/8.92 (33) RewriteLemmaProof [LOWER BOUND(ID), 152 ms] 30.41/8.92 (34) typed CpxTrs 30.41/8.92 (35) RewriteLemmaProof [LOWER BOUND(ID), 181 ms] 30.41/8.92 (36) typed CpxTrs 30.41/8.92 (37) RewriteLemmaProof [LOWER BOUND(ID), 83 ms] 30.41/8.92 (38) typed CpxTrs 30.41/8.92 (39) RewriteLemmaProof [LOWER BOUND(ID), 63 ms] 30.41/8.92 (40) typed CpxTrs 30.41/8.92 (41) RewriteLemmaProof [LOWER BOUND(ID), 106 ms] 30.41/8.92 (42) typed CpxTrs 30.41/8.92 30.41/8.92 30.41/8.92 ---------------------------------------- 30.41/8.92 30.41/8.92 (0) 30.41/8.92 Obligation: 30.41/8.92 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 30.41/8.92 30.41/8.92 30.41/8.92 The TRS R consists of the following rules: 30.41/8.92 30.41/8.92 active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) 30.41/8.92 active(__(X, nil)) -> mark(X) 30.41/8.92 active(__(nil, X)) -> mark(X) 30.41/8.92 active(U11(tt)) -> mark(tt) 30.41/8.92 active(U21(tt, V2)) -> mark(U22(isList(V2))) 30.41/8.92 active(U22(tt)) -> mark(tt) 30.41/8.92 active(U31(tt)) -> mark(tt) 30.41/8.92 active(U41(tt, V2)) -> mark(U42(isNeList(V2))) 30.41/8.92 active(U42(tt)) -> mark(tt) 30.41/8.92 active(U51(tt, V2)) -> mark(U52(isList(V2))) 30.41/8.92 active(U52(tt)) -> mark(tt) 30.41/8.92 active(U61(tt)) -> mark(tt) 30.41/8.92 active(U71(tt, P)) -> mark(U72(isPal(P))) 30.41/8.92 active(U72(tt)) -> mark(tt) 30.41/8.92 active(U81(tt)) -> mark(tt) 30.41/8.92 active(isList(V)) -> mark(U11(isNeList(V))) 30.41/8.92 active(isList(nil)) -> mark(tt) 30.41/8.92 active(isList(__(V1, V2))) -> mark(U21(isList(V1), V2)) 30.41/8.92 active(isNeList(V)) -> mark(U31(isQid(V))) 30.41/8.92 active(isNeList(__(V1, V2))) -> mark(U41(isList(V1), V2)) 30.41/8.92 active(isNeList(__(V1, V2))) -> mark(U51(isNeList(V1), V2)) 30.41/8.92 active(isNePal(V)) -> mark(U61(isQid(V))) 30.41/8.92 active(isNePal(__(I, __(P, I)))) -> mark(U71(isQid(I), P)) 30.41/8.92 active(isPal(V)) -> mark(U81(isNePal(V))) 30.41/8.92 active(isPal(nil)) -> mark(tt) 30.41/8.92 active(isQid(a)) -> mark(tt) 30.41/8.92 active(isQid(e)) -> mark(tt) 30.41/8.92 active(isQid(i)) -> mark(tt) 30.41/8.92 active(isQid(o)) -> mark(tt) 30.41/8.92 active(isQid(u)) -> mark(tt) 30.41/8.92 active(__(X1, X2)) -> __(active(X1), X2) 30.41/8.92 active(__(X1, X2)) -> __(X1, active(X2)) 30.41/8.92 active(U11(X)) -> U11(active(X)) 30.41/8.92 active(U21(X1, X2)) -> U21(active(X1), X2) 30.41/8.92 active(U22(X)) -> U22(active(X)) 30.41/8.92 active(U31(X)) -> U31(active(X)) 30.41/8.92 active(U41(X1, X2)) -> U41(active(X1), X2) 30.41/8.92 active(U42(X)) -> U42(active(X)) 30.41/8.92 active(U51(X1, X2)) -> U51(active(X1), X2)
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
