details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.49 seconds
cpu usage	311.453
user time	309.363
system time	2.08949
max virtual memory	1.8281604E7
max residence set size	5224648.0

stage attributes

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

output

WORST_CASE(Omega(n^1), ?) 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(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), 276 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), 104 ms] (14) typed CpxTrs ---------------------------------------- (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: f(true, x, y) -> f(gt(x, y), x, round(s(y))) round(0) -> 0 round(s(0)) -> s(s(0)) round(s(s(x))) -> s(s(round(x))) gt(0, v) -> false gt(s(u), 0) -> true gt(s(u), s(v)) -> gt(u, v) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) 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: f(true, x, y) -> f(gt(x, y), x, round(s(y))) round(0') -> 0' round(s(0')) -> s(s(0')) round(s(s(x))) -> s(s(round(x))) gt(0', v) -> false gt(s(u), 0') -> true gt(s(u), s(v)) -> gt(u, v) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: f(true, x, y) -> f(gt(x, y), x, round(s(y))) round(0') -> 0' round(s(0')) -> s(s(0')) round(s(s(x))) -> s(s(round(x))) gt(0', v) -> false gt(s(u), 0') -> true gt(s(u), s(v)) -> gt(u, v) Types: f :: true:false -> s:0' -> s:0' -> f true :: true:false gt :: s:0' -> s:0' -> true:false round :: s:0' -> s:0' s :: s:0' -> s:0' 0' :: s:0' false :: true:false hole_f1_0 :: f hole_true:false2_0 :: true:false hole_s:0'3_0 :: s:0' gen_s:0'4_0 :: Nat -> s:0' ---------------------------------------- (5) OrderProof (LOWER BOUND(ID)) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS