details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.566436052 seconds
cpu usage	314.819598986
max memory	5.460549632E9

stage attributes

key	value
output-size	5568
starexec-result	WORST_CASE(Omega(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), ?) 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, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: plus(x, y) -> ifPlus(isZero(x), x, inc(y)) ifPlus(true, x, y) -> p(y) ifPlus(false, x, y) -> plus(p(x), y) times(x, y) -> timesIter(0, x, y, 0) timesIter(i, x, y, z) -> ifTimes(ge(i, x), i, x, y, z) ifTimes(true, i, x, y, z) -> z ifTimes(false, i, x, y, z) -> timesIter(inc(i), x, y, plus(z, y)) isZero(0) -> true isZero(s(0)) -> false isZero(s(s(x))) -> isZero(s(x)) inc(0) -> s(0) inc(s(x)) -> s(inc(x)) inc(x) -> s(x) p(0) -> 0 p(s(x)) -> x p(s(s(x))) -> s(p(s(x))) ge(x, 0) -> true ge(0, s(y)) -> false ge(s(x), s(y)) -> ge(x, y) f0(0, y, x) -> f1(x, y, x) f1(x, y, z) -> f2(x, y, z) f2(x, 1, z) -> f0(x, z, z) f0(x, y, z) -> d f1(x, y, z) -> c S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (2) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: plus(x, y) -> ifPlus(isZero(x), x, inc(y)) ifPlus(true, x, y) -> p(y) ifPlus(false, x, y) -> plus(p(x), y) times(x, y) -> timesIter(0, x, y, 0) timesIter(i, x, y, z) -> ifTimes(ge(i, x), i, x, y, z) ifTimes(true, i, x, y, z) -> z ifTimes(false, i, x, y, z) -> timesIter(inc(i), x, y, plus(z, y)) isZero(0) -> true isZero(s(0)) -> false isZero(s(s(x))) -> isZero(s(x)) inc(0) -> s(0) inc(s(x)) -> s(inc(x)) inc(x) -> s(x) p(0) -> 0 p(s(x)) -> x p(s(s(x))) -> s(p(s(x))) ge(x, 0) -> true ge(0, s(y)) -> false ge(s(x), s(y)) -> ge(x, y) f0(0, y, x) -> f1(x, y, x) f1(x, y, z) -> f2(x, y, z) f2(x, 1, z) -> f0(x, z, z) f0(x, y, z) -> d f1(x, y, z) -> c popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127