details

property	value
status	complete
benchmark	aprove10.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	Secret_07_TRS

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.551 seconds
cpu usage	944.242
user time	935.645
system time	8.59705
max virtual memory	3.8040908E7
max residence set size	1.4748028E7

stage attributes

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

output

WORST_CASE(Omega(n^1), O(n^3)) proof of /export/starexec/sandbox2/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^3). (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), 5 ms] (8) CpxRNTS (9) CompleteCoflocoProof [FINISHED, 3667 ms] (10) BOUNDS(1, n^3) (11) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CpxTRS (13) SlicingProof [LOWER BOUND(ID), 0 ms] (14) CpxTRS (15) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (16) typed CpxTrs (17) OrderProof [LOWER BOUND(ID), 0 ms] (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 286 ms] (20) BEST (21) proven lower bound (22) LowerBoundPropagationProof [FINISHED, 0 ms] (23) BOUNDS(n^1, INF) (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 67 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 51 ms] (28) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^3). The TRS R consists of the following rules: lessElements(l, t) -> lessE(l, t, 0) lessE(l, t, n) -> if(le(length(l), n), le(length(toList(t)), n), l, t, n) if(true, b, l, t, n) -> l if(false, true, l, t, n) -> t if(false, false, l, t, n) -> lessE(l, t, s(n)) length(nil) -> 0 length(cons(n, l)) -> s(length(l)) toList(leaf) -> nil toList(node(t1, n, t2)) -> append(toList(t1), cons(n, toList(t2))) append(nil, l2) -> l2 append(cons(n, l1), l2) -> cons(n, append(l1, l2)) le(s(n), 0) -> false le(0, m) -> true le(s(n), s(m)) -> le(n, m) a -> c a -> d 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^3). The TRS R consists of the following rules: lessElements(l, t) -> lessE(l, t, 0) [1] lessE(l, t, n) -> if(le(length(l), n), le(length(toList(t)), n), l, t, n) [1] if(true, b, l, t, n) -> l [1] if(false, true, l, t, n) -> t [1] if(false, false, l, t, n) -> lessE(l, t, s(n)) [1] length(nil) -> 0 [1] length(cons(n, l)) -> s(length(l)) [1] toList(leaf) -> nil [1] toList(node(t1, n, t2)) -> append(toList(t1), cons(n, toList(t2))) [1] append(nil, l2) -> l2 [1] append(cons(n, l1), l2) -> cons(n, append(l1, l2)) [1] le(s(n), 0) -> false [1] le(0, m) -> true [1] le(s(n), s(m)) -> le(n, m) [1] a -> c [1] a -> d [1] Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS Innermost