Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902419
details
property
value
status
complete
benchmark
PALINDROME_complete_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
11.8044610023 seconds
cpu usage
40.389742068
max memory
4.32082944E9
stage attributes
key
value
output-size
261241
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, 827 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), 496 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), 159 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 115 ms] (22) typed CpxTrs (23) RewriteLemmaProof [LOWER BOUND(ID), 86 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 81 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 146 ms] (28) typed CpxTrs (29) RewriteLemmaProof [LOWER BOUND(ID), 127 ms] (30) typed CpxTrs (31) RewriteLemmaProof [LOWER BOUND(ID), 142 ms] (32) typed CpxTrs (33) RewriteLemmaProof [LOWER BOUND(ID), 127 ms] (34) typed CpxTrs (35) RewriteLemmaProof [LOWER BOUND(ID), 150 ms] (36) typed CpxTrs (37) RewriteLemmaProof [LOWER BOUND(ID), 136 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 120 ms] (40) typed CpxTrs (41) RewriteLemmaProof [LOWER BOUND(ID), 237 ms] (42) typed CpxTrs (43) RewriteLemmaProof [LOWER BOUND(ID), 165 ms] (44) typed CpxTrs (45) RewriteLemmaProof [LOWER BOUND(ID), 155 ms] (46) typed CpxTrs (47) RewriteLemmaProof [LOWER BOUND(ID), 200 ms] (48) typed CpxTrs (49) RewriteLemmaProof [LOWER BOUND(ID), 211 ms] (50) typed CpxTrs (51) RewriteLemmaProof [LOWER BOUND(ID), 170 ms] (52) typed CpxTrs (53) RewriteLemmaProof [LOWER BOUND(ID), 165 ms] (54) 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, V)) -> mark(U12(isNeList(V))) active(U12(tt)) -> mark(tt) active(U21(tt, V1, V2)) -> mark(U22(isList(V1), V2)) active(U22(tt, V2)) -> mark(U23(isList(V2))) active(U23(tt)) -> mark(tt) active(U31(tt, V)) -> mark(U32(isQid(V))) active(U32(tt)) -> mark(tt) active(U41(tt, V1, V2)) -> mark(U42(isList(V1), V2)) active(U42(tt, V2)) -> mark(U43(isNeList(V2))) active(U43(tt)) -> mark(tt) active(U51(tt, V1, V2)) -> mark(U52(isNeList(V1), V2)) active(U52(tt, V2)) -> mark(U53(isList(V2))) active(U53(tt)) -> mark(tt) active(U61(tt, V)) -> mark(U62(isQid(V))) active(U62(tt)) -> mark(tt) active(U71(tt, V)) -> mark(U72(isNePal(V))) active(U72(tt)) -> mark(tt) active(and(tt, X)) -> mark(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127