details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.586641073 seconds
cpu usage	1112.95281303
max memory	1.4076264448E10

stage attributes

key	value
output-size	24179
starexec-result	WORST_CASE(Omega(n^1), 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^1), O(n^2)) 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^2). (0) CpxTRS (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxWeightedTrs (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxTypedWeightedTrs (7) CompletionProof [UPPER BOUND(ID), 0 ms] (8) CpxTypedWeightedCompleteTrs (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (10) CpxRNTS (11) CompleteCoflocoProof [FINISHED, 807 ms] (12) BOUNDS(1, n^2) (13) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (14) TRS for Loop Detection (15) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (16) BEST (17) proven lower bound (18) LowerBoundPropagationProof [FINISHED, 0 ms] (19) BOUNDS(n^1, INF) (20) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). The TRS R consists of the following rules: gt(s(x), 0) -> true gt(0, y) -> false gt(s(x), s(y)) -> gt(x, y) divides(x, y) -> div(x, y, y) div(0, 0, z) -> true div(0, s(x), z) -> false div(s(x), 0, s(z)) -> div(s(x), s(z), s(z)) div(s(x), s(y), z) -> div(x, y, z) prime(x) -> test(x, s(s(0))) test(x, y) -> if1(gt(x, y), x, y) if1(true, x, y) -> if2(divides(x, y), x, y) if1(false, x, y) -> true if2(true, x, y) -> false if2(false, x, y) -> test(x, s(y)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RcToIrcProof (BOTH BOUNDS(ID, ID)) Converted rc-obligation to irc-obligation. The duplicating contexts are: divides(x, []) div(s(x), 0, s([])) test([], y) test(x, []) if1(true, [], y) if1(true, x, []) The defined contexts are: if2([], x1, x2) if1([], x1, x2) [] just represents basic- or constructor-terms in the following defined contexts: if2([], x1, x2) if1([], x1, x2) As the TRS is an overlay system and the defined contexts and the duplicating contexts don't overlap, we have rc = irc. ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^2). The TRS R consists of the following rules: gt(s(x), 0) -> true gt(0, y) -> false gt(s(x), s(y)) -> gt(x, y) divides(x, y) -> div(x, y, y) popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127