Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903777
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
n056.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
9.02139401436 seconds
cpu usage
31.472250296
max memory
4.350324736E9
stage attributes
key
value
output-size
135015
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (4) CpxTRS (5) CpxTrsMatchBoundsTAProof [FINISHED, 460 ms] (6) BOUNDS(1, n^1) (7) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CpxTRS (9) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (10) typed CpxTrs (11) OrderProof [LOWER BOUND(ID), 0 ms] (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 485 ms] (14) BEST (15) proven lower bound (16) LowerBoundPropagationProof [FINISHED, 0 ms] (17) BOUNDS(n^1, INF) (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 101 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 104 ms] (22) typed CpxTrs (23) RewriteLemmaProof [LOWER BOUND(ID), 99 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 119 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 69 ms] (28) typed CpxTrs (29) RewriteLemmaProof [LOWER BOUND(ID), 110 ms] (30) typed CpxTrs (31) RewriteLemmaProof [LOWER BOUND(ID), 54 ms] (32) typed CpxTrs (33) RewriteLemmaProof [LOWER BOUND(ID), 139 ms] (34) typed CpxTrs (35) RewriteLemmaProof [LOWER BOUND(ID), 169 ms] (36) typed CpxTrs (37) RewriteLemmaProof [LOWER BOUND(ID), 87 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 113 ms] (40) typed CpxTrs (41) RewriteLemmaProof [LOWER BOUND(ID), 75 ms] (42) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(U11(tt)) -> mark(tt) active(U21(tt, V2)) -> mark(U22(isList(V2))) active(U22(tt)) -> mark(tt) active(U31(tt)) -> mark(tt) active(U41(tt, V2)) -> mark(U42(isNeList(V2))) active(U42(tt)) -> mark(tt) active(U51(tt, V2)) -> mark(U52(isList(V2))) active(U52(tt)) -> mark(tt) active(U61(tt)) -> mark(tt) active(U71(tt, P)) -> mark(U72(isPal(P))) active(U72(tt)) -> mark(tt) active(U81(tt)) -> mark(tt) active(isList(V)) -> mark(U11(isNeList(V))) active(isList(nil)) -> mark(tt) active(isList(__(V1, V2))) -> mark(U21(isList(V1), V2)) active(isNeList(V)) -> mark(U31(isQid(V))) active(isNeList(__(V1, V2))) -> mark(U41(isList(V1), V2)) active(isNeList(__(V1, V2))) -> mark(U51(isNeList(V1), V2)) active(isNePal(V)) -> mark(U61(isQid(V))) active(isNePal(__(I, __(P, I)))) -> mark(U71(isQid(I), P)) active(isPal(V)) -> mark(U81(isNePal(V))) active(isPal(nil)) -> mark(tt) active(isQid(a)) -> mark(tt) active(isQid(e)) -> mark(tt) active(isQid(i)) -> mark(tt) active(isQid(o)) -> mark(tt) active(isQid(u)) -> mark(tt) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(U11(X)) -> U11(active(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127