details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.851267099 seconds
cpu usage	1102.85555309
max memory	1.5791263744E10

stage attributes

key	value
output-size	23175
starexec-result	WORST_CASE(Omega(n^2), ?)

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^2), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, 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), 381 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) BEST (15) proven lower bound (16) LowerBoundPropagationProof [FINISHED, 0 ms] (17) BOUNDS(n^2, INF) (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 57 ms] (20) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: a__p(0) -> 0 a__p(s(X)) -> mark(X) a__leq(0, Y) -> true a__leq(s(X), 0) -> false a__leq(s(X), s(Y)) -> a__leq(mark(X), mark(Y)) a__if(true, X, Y) -> mark(X) a__if(false, X, Y) -> mark(Y) a__diff(X, Y) -> a__if(a__leq(mark(X), mark(Y)), 0, s(diff(p(X), Y))) mark(p(X)) -> a__p(mark(X)) mark(leq(X1, X2)) -> a__leq(mark(X1), mark(X2)) mark(if(X1, X2, X3)) -> a__if(mark(X1), X2, X3) mark(diff(X1, X2)) -> a__diff(mark(X1), mark(X2)) mark(0) -> 0 mark(s(X)) -> s(mark(X)) mark(true) -> true mark(false) -> false a__p(X) -> p(X) a__leq(X1, X2) -> leq(X1, X2) a__if(X1, X2, X3) -> if(X1, X2, X3) a__diff(X1, X2) -> diff(X1, X2) 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^2, INF). The TRS R consists of the following rules: a__p(0') -> 0' a__p(s(X)) -> mark(X) a__leq(0', Y) -> true a__leq(s(X), 0') -> false a__leq(s(X), s(Y)) -> a__leq(mark(X), mark(Y)) a__if(true, X, Y) -> mark(X) a__if(false, X, Y) -> mark(Y) a__diff(X, Y) -> a__if(a__leq(mark(X), mark(Y)), 0', s(diff(p(X), Y))) mark(p(X)) -> a__p(mark(X)) mark(leq(X1, X2)) -> a__leq(mark(X1), mark(X2)) mark(if(X1, X2, X3)) -> a__if(mark(X1), X2, X3) mark(diff(X1, X2)) -> a__diff(mark(X1), mark(X2)) mark(0') -> 0' mark(s(X)) -> s(mark(X)) mark(true) -> true mark(false) -> false a__p(X) -> p(X) a__leq(X1, X2) -> leq(X1, X2) a__if(X1, X2, X3) -> if(X1, X2, X3) popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807