Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Derivational Complexity: TRS Innermost pair #487109462
details
property
value
status
complete
benchmark
parting04_maxsort_h.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
AProVE_08
run statistics
property
value
solver
AProVE
configuration
rcdcRelativeAlsoLower
runtime (wallclock)
293.178 seconds
cpu usage
1142.12
user time
1130.84
system time
11.2811
max virtual memory
3.7859244E7
max residence set size
1.4930636E7
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), 579 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 0 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 284 ms] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 4704 ms] (18) BOUNDS(1, INF) ---------------------------------------- (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(h(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) h(nil) -> nil h(cons(x, xs)) -> cons(x, h(xs)) 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)) encArg(cons_h(x_1)) -> h(encArg(x_1)) 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)) encode_h(x_1) -> h(encArg(x_1)) ---------------------------------------- (2) Obligation:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Derivational Complexity: TRS Innermost