details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.69646787643 seconds
cpu usage	4.00351536
max memory	2.79257088E8

stage attributes

key	value
output-size	4738
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) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) CpxTrsMatchBoundsTAProof [FINISHED, 106 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 (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: max(L(x)) -> x max(N(L(0), L(y))) -> y max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y)))) max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z))))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RelTrsToTrsProof (UPPER BOUND(ID)) transformed relative TRS to TRS ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: max(L(x)) -> x max(N(L(0), L(y))) -> y max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y)))) max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z))))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (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 1. The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by: final states : [1] transitions: L0(0) -> 0 N0(0, 0) -> 0 00() -> 0 s0(0) -> 0 max0(0) -> 1 L1(0) -> 4 L1(0) -> 5 N1(4, 5) -> 3 max1(3) -> 2 s1(2) -> 1 N1(0, 0) -> 8 max1(8) -> 7 L1(7) -> 6 N1(4, 6) -> 3 max1(3) -> 1 s1(2) -> 7 max1(3) -> 7 L1(2) -> 5 0 -> 1 0 -> 7 0 -> 2 7 -> 1 7 -> 2 2 -> 1 2 -> 7 ---------------------------------------- popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127