Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902814
details
property
value
status
complete
benchmark
MYNAT_nokinds_noand_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
9.92019104958 seconds
cpu usage
36.024058995
max memory
4.322086912E9
stage attributes
key
value
output-size
124209
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/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, 385 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), 471 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), 119 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 138 ms] (22) typed CpxTrs (23) RewriteLemmaProof [LOWER BOUND(ID), 84 ms] (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 122 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 148 ms] (28) typed CpxTrs (29) RewriteLemmaProof [LOWER BOUND(ID), 88 ms] (30) typed CpxTrs (31) RewriteLemmaProof [LOWER BOUND(ID), 155 ms] (32) typed CpxTrs (33) RewriteLemmaProof [LOWER BOUND(ID), 129 ms] (34) typed CpxTrs (35) RewriteLemmaProof [LOWER BOUND(ID), 144 ms] (36) typed CpxTrs (37) RewriteLemmaProof [LOWER BOUND(ID), 169 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 162 ms] (40) typed CpxTrs (41) RewriteLemmaProof [LOWER BOUND(ID), 77 ms] (42) typed CpxTrs (43) RewriteLemmaProof [LOWER BOUND(ID), 197 ms] (44) 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(U11(tt, V2)) -> mark(U12(isNat(V2))) active(U12(tt)) -> mark(tt) active(U21(tt)) -> mark(tt) active(U31(tt, V2)) -> mark(U32(isNat(V2))) active(U32(tt)) -> mark(tt) active(U41(tt, N)) -> mark(N) active(U51(tt, M, N)) -> mark(U52(isNat(N), M, N)) active(U52(tt, M, N)) -> mark(s(plus(N, M))) active(U61(tt)) -> mark(0) active(U71(tt, M, N)) -> mark(U72(isNat(N), M, N)) active(U72(tt, M, N)) -> mark(plus(x(N, M), N)) active(isNat(0)) -> mark(tt) active(isNat(plus(V1, V2))) -> mark(U11(isNat(V1), V2)) active(isNat(s(V1))) -> mark(U21(isNat(V1))) active(isNat(x(V1, V2))) -> mark(U31(isNat(V1), V2)) active(plus(N, 0)) -> mark(U41(isNat(N), N)) active(plus(N, s(M))) -> mark(U51(isNat(M), M, N)) active(x(N, 0)) -> mark(U61(isNat(N))) active(x(N, s(M))) -> mark(U71(isNat(M), M, N)) active(U11(X1, X2)) -> U11(active(X1), X2) active(U12(X)) -> U12(active(X)) active(U21(X)) -> U21(active(X)) active(U31(X1, X2)) -> U31(active(X1), X2) active(U32(X)) -> U32(active(X)) active(U41(X1, X2)) -> U41(active(X1), X2) active(U51(X1, X2, X3)) -> U51(active(X1), X2, X3) active(U52(X1, X2, X3)) -> U52(active(X1), X2, X3) active(s(X)) -> s(active(X)) active(plus(X1, X2)) -> plus(active(X1), X2) active(plus(X1, X2)) -> plus(X1, active(X2)) active(U61(X)) -> U61(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