Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903577
details
property
value
status
complete
benchmark
OvConsOS_complete_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
297.672190189 seconds
cpu usage
1176.18896965
max memory
1.5434842112E10
stage attributes
key
value
output-size
323480
starexec-result
WORST_CASE(Omega(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), ?) 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, INF). (0) CpxTRS (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) typed CpxTrs (5) OrderProof [LOWER BOUND(ID), 8 ms] (6) typed CpxTrs (7) RewriteLemmaProof [LOWER BOUND(ID), 517 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 129 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 155 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 122 ms] (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 186 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 143 ms] (22) typed CpxTrs (23) RewriteLemmaProof [LOWER BOUND(ID), 125 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 127 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 194 ms] (28) typed CpxTrs (29) RewriteLemmaProof [LOWER BOUND(ID), 138 ms] (30) typed CpxTrs (31) RewriteLemmaProof [LOWER BOUND(ID), 152 ms] (32) typed CpxTrs (33) RewriteLemmaProof [LOWER BOUND(ID), 155 ms] (34) typed CpxTrs (35) RewriteLemmaProof [LOWER BOUND(ID), 213 ms] (36) typed CpxTrs (37) RewriteLemmaProof [LOWER BOUND(ID), 198 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 195 ms] (40) typed CpxTrs (41) RewriteLemmaProof [LOWER BOUND(ID), 152 ms] (42) typed CpxTrs (43) RewriteLemmaProof [LOWER BOUND(ID), 266 ms] (44) typed CpxTrs (45) RewriteLemmaProof [LOWER BOUND(ID), 187 ms] (46) typed CpxTrs (47) RewriteLemmaProof [LOWER BOUND(ID), 176 ms] (48) typed CpxTrs (49) RewriteLemmaProof [LOWER BOUND(ID), 241 ms] (50) typed CpxTrs (51) RewriteLemmaProof [LOWER BOUND(ID), 173 ms] (52) typed CpxTrs (53) RewriteLemmaProof [LOWER BOUND(ID), 95 ms] (54) typed CpxTrs (55) RewriteLemmaProof [LOWER BOUND(ID), 259 ms] (56) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: active(zeros) -> mark(cons(0, zeros)) active(U11(tt, V1)) -> mark(U12(isNatList(V1))) active(U12(tt)) -> mark(tt) active(U21(tt, V1)) -> mark(U22(isNat(V1))) active(U22(tt)) -> mark(tt) active(U31(tt, V)) -> mark(U32(isNatList(V))) active(U32(tt)) -> mark(tt) active(U41(tt, V1, V2)) -> mark(U42(isNat(V1), V2)) active(U42(tt, V2)) -> mark(U43(isNatIList(V2))) active(U43(tt)) -> mark(tt) active(U51(tt, V1, V2)) -> mark(U52(isNat(V1), V2)) active(U52(tt, V2)) -> mark(U53(isNatList(V2))) active(U53(tt)) -> mark(tt) active(U61(tt, V1, V2)) -> mark(U62(isNat(V1), V2)) active(U62(tt, V2)) -> mark(U63(isNatIList(V2))) active(U63(tt)) -> mark(tt) active(U71(tt, L)) -> mark(s(length(L))) active(U81(tt)) -> mark(nil) active(U91(tt, IL, M, N)) -> mark(cons(N, take(M, IL)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127