details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.61 seconds
cpu usage	316.347
user time	314.597
system time	1.75068
max virtual memory	1.8281608E7
max residence set size	5173668.0

stage attributes

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

output

WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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: p(s(N)) -> N +(N, 0) -> N +(s(N), s(M)) -> s(s(+(N, M))) *(N, 0) -> 0 *(s(N), s(M)) -> s(+(N, +(M, *(N, M)))) gt(0, M) -> False gt(NzN, 0) -> u_4(is_NzNat(NzN)) u_4(True) -> True is_NzNat(0) -> False is_NzNat(s(N)) -> True gt(s(N), s(M)) -> gt(N, M) lt(N, M) -> gt(M, N) d(0, N) -> N d(s(N), s(M)) -> d(N, M) quot(N, NzM) -> u_11(is_NzNat(NzM), N, NzM) u_11(True, N, NzM) -> u_1(gt(N, NzM), N, NzM) u_1(True, N, NzM) -> s(quot(d(N, NzM), NzM)) quot(NzM, NzM) -> u_01(is_NzNat(NzM)) u_01(True) -> s(0) quot(N, NzM) -> u_21(is_NzNat(NzM), NzM, N) u_21(True, NzM, N) -> u_2(gt(NzM, N)) u_2(True) -> 0 gcd(0, N) -> 0 gcd(NzM, NzM) -> u_02(is_NzNat(NzM), NzM) u_02(True, NzM) -> NzM gcd(NzN, NzM) -> u_31(is_NzNat(NzN), is_NzNat(NzM), NzN, NzM) u_31(True, True, NzN, NzM) -> u_3(gt(NzN, NzM), NzN, NzM) u_3(True, NzN, NzM) -> gcd(d(NzN, NzM), NzM) 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: p(s(N)) -> N +(N, 0) -> N +(s(N), s(M)) -> s(s(+(N, M))) *(N, 0) -> 0 *(s(N), s(M)) -> s(+(N, +(M, *(N, M)))) gt(0, M) -> False gt(NzN, 0) -> u_4(is_NzNat(NzN)) u_4(True) -> True is_NzNat(0) -> False is_NzNat(s(N)) -> True gt(s(N), s(M)) -> gt(N, M) lt(N, M) -> gt(M, N) d(0, N) -> N d(s(N), s(M)) -> d(N, M) quot(N, NzM) -> u_11(is_NzNat(NzM), N, NzM) u_11(True, N, NzM) -> u_1(gt(N, NzM), N, NzM) u_1(True, N, NzM) -> s(quot(d(N, NzM), NzM)) quot(NzM, NzM) -> u_01(is_NzNat(NzM)) u_01(True) -> s(0) quot(N, NzM) -> u_21(is_NzNat(NzM), NzM, N) u_21(True, NzM, N) -> u_2(gt(NzM, N)) u_2(True) -> 0 gcd(0, N) -> 0 gcd(NzM, NzM) -> u_02(is_NzNat(NzM), NzM) u_02(True, NzM) -> NzM gcd(NzN, NzM) -> u_31(is_NzNat(NzN), is_NzNat(NzM), NzN, NzM) u_31(True, True, NzN, NzM) -> u_3(gt(NzN, NzM), NzN, NzM) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS