details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.88761496544 seconds
cpu usage	4.952343152
max memory	4.29481984E8

stage attributes

key	value
output-size	5862
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 (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) CpxTrsMatchBoundsProof [FINISHED, 0 ms] (4) BOUNDS(1, n^1) (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxTRS (7) SlicingProof [LOWER BOUND(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), 162 ms] (14) proven lower bound (15) LowerBoundPropagationProof [FINISHED, 0 ms] (16) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: a__f(X) -> g(h(f(X))) mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) mark(h(X)) -> h(mark(X)) a__f(X) -> f(X) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RelTrsToTrsProof (UPPER BOUND(ID)) transformed relative TRS to TRS ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: a__f(X) -> g(h(f(X))) mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) mark(h(X)) -> h(mark(X)) a__f(X) -> f(X) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) CpxTrsMatchBoundsProof (FINISHED) A linear upper bound on the runtime complexity of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 2. The certificate found is represented by the following graph. "[1, 2, 3, 4, 5, 6, 7, 8] {(1,2,[a__f_1|0, mark_1|0, f_1|1, g_1|1]), (1,3,[g_1|1]), (1,5,[a__f_1|1, f_1|2]), (1,6,[h_1|1]), (1,7,[g_1|2]), (2,2,[g_1|0, h_1|0, f_1|0]), (3,4,[h_1|1]), (4,2,[f_1|1]), (5,2,[mark_1|1, g_1|1]), (5,5,[a__f_1|1, f_1|2]), (5,6,[h_1|1]), (5,7,[g_1|2]), (6,2,[mark_1|1, g_1|1]), (6,5,[a__f_1|1, f_1|2]), (6,6,[h_1|1]), (6,7,[g_1|2]), (7,8,[h_1|2]), (8,5,[f_1|2])}" ---------------------------------------- (4) BOUNDS(1, n^1) ---------------------------------------- (5) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (6) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: a__f(X) -> g(h(f(X))) mark(f(X)) -> a__f(mark(X)) mark(g(X)) -> g(X) mark(h(X)) -> h(mark(X)) popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807