details

property	value
status	complete
benchmark	parting05_maxsort.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	AProVE_08

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	294.884 seconds
cpu usage	1148.99
user time	1137.96
system time	11.0325
max virtual memory	3.7645636E7
max residence set size	1.4901812E7

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 Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 562 ms] (4) CpxRelTRS (5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (6) TRS for Loop Detection (7) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: max(nil) -> 0 max(cons(x, nil)) -> x max(cons(x, cons(y, xs))) -> if1(ge(x, y), x, y, xs) if1(true, x, y, xs) -> max(cons(x, xs)) if1(false, x, y, xs) -> max(cons(y, xs)) del(x, nil) -> nil del(x, cons(y, xs)) -> if2(eq(x, y), x, y, xs) if2(true, x, y, xs) -> xs if2(false, x, y, xs) -> cons(y, del(x, xs)) eq(0, 0) -> true eq(0, s(y)) -> false eq(s(x), 0) -> false eq(s(x), s(y)) -> eq(x, y) sort(nil) -> nil sort(cons(x, xs)) -> cons(max(cons(x, xs)), sort(del(max(cons(x, xs)), cons(x, xs)))) ge(0, 0) -> true ge(s(x), 0) -> true ge(0, s(x)) -> false ge(s(x), s(y)) -> ge(x, y) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID)) The following rules have been added to S to convert the given derivational complexity problem to a runtime complexity problem: encArg(nil) -> nil encArg(0) -> 0 encArg(cons(x_1, x_2)) -> cons(encArg(x_1), encArg(x_2)) encArg(true) -> true encArg(false) -> false encArg(s(x_1)) -> s(encArg(x_1)) encArg(cons_max(x_1)) -> max(encArg(x_1)) encArg(cons_if1(x_1, x_2, x_3, x_4)) -> if1(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4)) encArg(cons_del(x_1, x_2)) -> del(encArg(x_1), encArg(x_2)) encArg(cons_if2(x_1, x_2, x_3, x_4)) -> if2(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4)) encArg(cons_eq(x_1, x_2)) -> eq(encArg(x_1), encArg(x_2)) encArg(cons_sort(x_1)) -> sort(encArg(x_1)) encArg(cons_ge(x_1, x_2)) -> ge(encArg(x_1), encArg(x_2)) encode_max(x_1) -> max(encArg(x_1)) encode_nil -> nil encode_0 -> 0 encode_cons(x_1, x_2) -> cons(encArg(x_1), encArg(x_2)) encode_if1(x_1, x_2, x_3, x_4) -> if1(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4)) encode_ge(x_1, x_2) -> ge(encArg(x_1), encArg(x_2)) encode_true -> true encode_false -> false encode_del(x_1, x_2) -> del(encArg(x_1), encArg(x_2)) encode_if2(x_1, x_2, x_3, x_4) -> if2(encArg(x_1), encArg(x_2), encArg(x_3), encArg(x_4)) encode_eq(x_1, x_2) -> eq(encArg(x_1), encArg(x_2)) encode_s(x_1) -> s(encArg(x_1)) encode_sort(x_1) -> sort(encArg(x_1)) ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: max(nil) -> 0 max(cons(x, nil)) -> x max(cons(x, cons(y, xs))) -> if1(ge(x, y), x, y, xs) if1(true, x, y, xs) -> max(cons(x, xs)) if1(false, x, y, xs) -> max(cons(y, xs)) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost