details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.67893 seconds
cpu usage	3.45649
user time	3.30445
system time	0.152033
max virtual memory	1.8275312E7
max residence set size	225036.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox2/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(EXP, 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 (9) DecreasingLoopProof [FINISHED, 0 ms] (10) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: sort(l) -> st(0, l) st(n, l) -> cond1(member(n, l), n, l) cond1(true, n, l) -> cons(n, st(s(n), l)) cond1(false, n, l) -> cond2(gt(n, max(l)), n, l) cond2(true, n, l) -> nil cond2(false, n, l) -> st(s(n), l) member(n, nil) -> false member(n, cons(m, l)) -> or(equal(n, m), member(n, l)) or(x, true) -> true or(x, false) -> x equal(0, 0) -> true equal(s(x), 0) -> false equal(0, s(y)) -> false equal(s(x), s(y)) -> equal(x, y) gt(0, v) -> false gt(s(u), 0) -> true gt(s(u), s(v)) -> gt(u, v) max(nil) -> 0 max(cons(u, l)) -> if(gt(u, max(l)), u, max(l)) if(true, u, v) -> u if(false, u, v) -> v 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(EXP, INF). The TRS R consists of the following rules: sort(l) -> st(0, l) st(n, l) -> cond1(member(n, l), n, l) cond1(true, n, l) -> cons(n, st(s(n), l)) cond1(false, n, l) -> cond2(gt(n, max(l)), n, l) cond2(true, n, l) -> nil cond2(false, n, l) -> st(s(n), l) member(n, nil) -> false member(n, cons(m, l)) -> or(equal(n, m), member(n, l)) or(x, true) -> true or(x, false) -> x equal(0, 0) -> true equal(s(x), 0) -> false equal(0, s(y)) -> false equal(s(x), s(y)) -> equal(x, y) gt(0, v) -> false gt(s(u), 0) -> true gt(s(u), s(v)) -> gt(u, v) max(nil) -> 0 max(cons(u, l)) -> if(gt(u, max(l)), u, max(l)) if(true, u, v) -> u if(false, u, v) -> v S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1): The rewrite sequence gt(s(u), s(v)) ->^+ gt(u, v) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS