details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.676 seconds
cpu usage	1131.96
user time	1119.84
system time	12.1191
max virtual memory	1.8913728E7
max residence set size	1.4924456E7

stage attributes

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

output

WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/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, 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), 535 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: a__fact(X) -> a__if(a__zero(mark(X)), s(0), prod(X, fact(p(X)))) a__add(0, X) -> mark(X) a__add(s(X), Y) -> s(a__add(mark(X), mark(Y))) a__prod(0, X) -> 0 a__prod(s(X), Y) -> a__add(mark(Y), a__prod(mark(X), mark(Y))) a__if(true, X, Y) -> mark(X) a__if(false, X, Y) -> mark(Y) a__zero(0) -> true a__zero(s(X)) -> false a__p(s(X)) -> mark(X) mark(fact(X)) -> a__fact(mark(X)) mark(if(X1, X2, X3)) -> a__if(mark(X1), X2, X3) mark(zero(X)) -> a__zero(mark(X)) mark(prod(X1, X2)) -> a__prod(mark(X1), mark(X2)) mark(p(X)) -> a__p(mark(X)) mark(add(X1, X2)) -> a__add(mark(X1), mark(X2)) mark(s(X)) -> s(mark(X)) mark(0) -> 0 mark(true) -> true mark(false) -> false a__fact(X) -> fact(X) a__if(X1, X2, X3) -> if(X1, X2, X3) a__zero(X) -> zero(X) a__prod(X1, X2) -> prod(X1, X2) a__p(X) -> p(X) a__add(X1, X2) -> add(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^1, INF). The TRS R consists of the following rules: a__fact(X) -> a__if(a__zero(mark(X)), s(0'), prod(X, fact(p(X)))) a__add(0', X) -> mark(X) a__add(s(X), Y) -> s(a__add(mark(X), mark(Y))) a__prod(0', X) -> 0' a__prod(s(X), Y) -> a__add(mark(Y), a__prod(mark(X), mark(Y))) a__if(true, X, Y) -> mark(X) a__if(false, X, Y) -> mark(Y) a__zero(0') -> true a__zero(s(X)) -> false a__p(s(X)) -> mark(X) mark(fact(X)) -> a__fact(mark(X)) mark(if(X1, X2, X3)) -> a__if(mark(X1), X2, X3) mark(zero(X)) -> a__zero(mark(X)) mark(prod(X1, X2)) -> a__prod(mark(X1), mark(X2)) mark(p(X)) -> a__p(mark(X)) mark(add(X1, X2)) -> a__add(mark(X1), mark(X2)) mark(s(X)) -> s(mark(X)) mark(0') -> 0' mark(true) -> true mark(false) -> false a__fact(X) -> fact(X) a__if(X1, X2, X3) -> if(X1, X2, X3) a__zero(X) -> zero(X) a__prod(X1, X2) -> prod(X1, X2) a__p(X) -> p(X) a__add(X1, X2) -> add(X1, X2) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS Innermost