details

property	value
status	complete
benchmark	MYNAT_nosorts-noand_FR.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n053.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	5.93392801285 seconds
cpu usage	20.513326316
max memory	3.535888384E9

stage attributes

key	value
output-size	19930
starexec-result	WORST_CASE(Omega(n^2), O(n^2))

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^2), O(n^2)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, n^2). (0) CpxTRS (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxWeightedTrs (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxTypedWeightedTrs (5) CompletionProof [UPPER BOUND(ID), 0 ms] (6) CpxTypedWeightedCompleteTrs (7) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 5 ms] (8) CpxRNTS (9) CompleteCoflocoProof [FINISHED, 283 ms] (10) BOUNDS(1, n^2) (11) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CpxTRS (13) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (14) typed CpxTrs (15) OrderProof [LOWER BOUND(ID), 0 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 259 ms] (18) BEST (19) proven lower bound (20) LowerBoundPropagationProof [FINISHED, 0 ms] (21) BOUNDS(n^1, INF) (22) typed CpxTrs (23) RewriteLemmaProof [LOWER BOUND(ID), 67 ms] (24) proven lower bound (25) LowerBoundPropagationProof [FINISHED, 0 ms] (26) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, n^2). The TRS R consists of the following rules: U11(tt, M, N) -> U12(tt, activate(M), activate(N)) U12(tt, M, N) -> s(plus(activate(N), activate(M))) U21(tt, M, N) -> U22(tt, activate(M), activate(N)) U22(tt, M, N) -> plus(x(activate(N), activate(M)), activate(N)) plus(N, 0) -> N plus(N, s(M)) -> U11(tt, M, N) x(N, 0) -> 0 x(N, s(M)) -> U21(tt, M, N) activate(X) -> X S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) Transformed relative TRS to weighted TRS ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^2). The TRS R consists of the following rules: U11(tt, M, N) -> U12(tt, activate(M), activate(N)) [1] U12(tt, M, N) -> s(plus(activate(N), activate(M))) [1] U21(tt, M, N) -> U22(tt, activate(M), activate(N)) [1] U22(tt, M, N) -> plus(x(activate(N), activate(M)), activate(N)) [1] plus(N, 0) -> N [1] plus(N, s(M)) -> U11(tt, M, N) [1] x(N, 0) -> 0 [1] x(N, s(M)) -> U21(tt, M, N) [1] activate(X) -> X [1] Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Runtime Complexity Weighted TRS with Types. The TRS R consists of the following rules: U11(tt, M, N) -> U12(tt, activate(M), activate(N)) [1] U12(tt, M, N) -> s(plus(activate(N), activate(M))) [1] popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807