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	n139.star.cs.uiowa.edu
space	Secret_07_TRS

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.603 seconds
cpu usage	1127.54
user time	1111.87
system time	15.6668
max virtual memory	5.6805076E7
max residence set size	1.4960308E7

stage attributes

key	value
starexec-result	WORST_CASE(Omega(n^1), O(n^5))

output

WORST_CASE(Omega(n^1), O(n^5)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^5). (0) CpxTRS (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxWeightedTrs (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxTypedWeightedTrs (5) CompletionProof [UPPER BOUND(ID), 0 ms] (6) CpxTypedWeightedCompleteTrs (7) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 9 ms] (8) CpxRNTS (9) CompleteCoflocoProof [FINISHED, 52.7 s] (10) BOUNDS(1, n^5) (11) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (12) TRS for Loop Detection (13) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (14) BEST (15) proven lower bound (16) LowerBoundPropagationProof [FINISHED, 0 ms] (17) BOUNDS(n^1, INF) (18) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^5). 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: INNERMOST ---------------------------------------- (1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) Transformed relative TRS to weighted TRS ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^5). The TRS R consists of the following rules: plus(x, y) -> ifPlus(isZero(x), x, inc(y)) [1] ifPlus(true, x, y) -> p(y) [1] ifPlus(false, x, y) -> plus(p(x), y) [1] times(x, y) -> timesIter(0, x, y, 0) [1] timesIter(i, x, y, z) -> ifTimes(ge(i, x), i, x, y, z) [1] ifTimes(true, i, x, y, z) -> z [1] ifTimes(false, i, x, y, z) -> timesIter(inc(i), x, y, plus(z, y)) [1] isZero(0) -> true [1] isZero(s(0)) -> false [1] isZero(s(s(x))) -> isZero(s(x)) [1] inc(0) -> s(0) [1] inc(s(x)) -> s(inc(x)) [1] inc(x) -> s(x) [1] p(0) -> 0 [1] p(s(x)) -> x [1] p(s(s(x))) -> s(p(s(x))) [1] ge(x, 0) -> true [1] ge(0, s(y)) -> false [1] ge(s(x), s(y)) -> ge(x, y) [1] f0(0, y, x) -> f1(x, y, x) [1] f1(x, y, z) -> f2(x, y, z) [1] f2(x, 1, z) -> f0(x, z, z) [1] f0(x, y, z) -> d [1] popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS Innermost