details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.68648099899 seconds
cpu usage	3.932749826
max memory	2.78286336E8

stage attributes

key	value
output-size	4538
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 (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) CpxTrsMatchBoundsTAProof [FINISHED, 101 ms] (4) BOUNDS(1, n^1) (5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (6) TRS for Loop Detection (7) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) TRS for Loop Detection ---------------------------------------- (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: f(a, a) -> f(a, b) f(a, b) -> f(s(a), c) f(s(X), c) -> f(X, c) f(c, c) -> f(a, a) 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: f(a, a) -> f(a, b) f(a, b) -> f(s(a), c) f(s(X), c) -> f(X, c) f(c, c) -> f(a, a) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) CpxTrsMatchBoundsTAProof (FINISHED) A linear upper bound on the runtime complexity of the TRS R could be shown with a Match-Bound[TAB_LEFTLINEAR,TAB_NONLEFTLINEAR] (for contructor-based start-terms) of 4. The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by: final states : [1] transitions: a0() -> 0 b0() -> 0 s0(0) -> 0 c0() -> 0 f0(0, 0) -> 1 a1() -> 2 b1() -> 3 f1(2, 3) -> 1 a1() -> 5 s1(5) -> 4 c1() -> 6 f1(4, 6) -> 1 f1(0, 6) -> 1 a1() -> 7 f1(2, 7) -> 1 a2() -> 8 b2() -> 9 f2(8, 9) -> 1 a2() -> 11 s2(11) -> 10 c2() -> 12 f2(10, 12) -> 1 f2(5, 12) -> 1 a3() -> 14 s3(14) -> 13 c3() -> 15 f3(13, 15) -> 1 f3(11, 15) -> 1 popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807