details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.6 seconds
cpu usage	760.737
user time	749.656
system time	11.0814
max virtual memory	1.901734E7
max residence set size	1.4978E7

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 (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). (0) CpxTRS (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) typed CpxTrs (5) OrderProof [LOWER BOUND(ID), 0 ms] (6) typed CpxTrs (7) RewriteLemmaProof [LOWER BOUND(ID), 233 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 64 ms] (14) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: -(x, 0) -> x -(s(x), s(y)) -> -(x, y) <=(0, y) -> true <=(s(x), 0) -> false <=(s(x), s(y)) -> <=(x, y) if(true, x, y) -> x if(false, x, y) -> y perfectp(0) -> false perfectp(s(x)) -> f(x, s(0), s(x), s(x)) f(0, y, 0, u) -> true f(0, y, s(z), u) -> false f(s(x), 0, z, u) -> f(x, u, -(z, s(x)), u) f(s(x), s(y), z, u) -> if(<=(x, y), f(s(x), -(y, x), z, u), f(x, u, z, u)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: -(x, 0') -> x -(s(x), s(y)) -> -(x, y) <=(0', y) -> true <=(s(x), 0') -> false <=(s(x), s(y)) -> <=(x, y) if(true, x, y) -> x if(false, x, y) -> y perfectp(0') -> false perfectp(s(x)) -> f(x, s(0'), s(x), s(x)) f(0', y, 0', u) -> true f(0', y, s(z), u) -> false f(s(x), 0', z, u) -> f(x, u, -(z, s(x)), u) f(s(x), s(y), z, u) -> if(<=(x, y), f(s(x), -(y, x), z, u), f(x, u, z, u)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Innermost TRS: Rules: -(x, 0') -> x -(s(x), s(y)) -> -(x, y) <=(0', y) -> true <=(s(x), 0') -> false <=(s(x), s(y)) -> <=(x, y) if(true, x, y) -> x if(false, x, y) -> y perfectp(0') -> false perfectp(s(x)) -> f(x, s(0'), s(x), s(x)) f(0', y, 0', u) -> true f(0', y, s(z), u) -> false f(s(x), 0', z, u) -> f(x, u, -(z, s(x)), u) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS Innermost